./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:19:48,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:19:48,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:19:48,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:19:48,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:19:48,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:19:48,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:19:48,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:19:48,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:19:48,627 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:19:48,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:19:48,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:19:48,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:19:48,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:19:48,628 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:19:48,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:19:48,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:19:48,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:19:48,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:19:48,630 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2025-02-08 01:19:48,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:19:48,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:19:48,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:19:48,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:19:48,964 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:19:48,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-02-08 01:19:50,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b609b3f2d/d3ea3c110e0741ddb2a9c6c0e4668698/FLAG9945e33c8 [2025-02-08 01:19:50,601 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:19:50,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-02-08 01:19:50,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b609b3f2d/d3ea3c110e0741ddb2a9c6c0e4668698/FLAG9945e33c8 [2025-02-08 01:19:50,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b609b3f2d/d3ea3c110e0741ddb2a9c6c0e4668698 [2025-02-08 01:19:50,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:19:50,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:19:50,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:19:50,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:19:50,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:19:50,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:19:50" (1/1) ... [2025-02-08 01:19:50,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b04a2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:50, skipping insertion in model container [2025-02-08 01:19:50,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:19:50" (1/1) ... [2025-02-08 01:19:50,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:19:51,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-02-08 01:19:51,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:19:51,140 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:19:51,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2025-02-08 01:19:51,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:19:51,176 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:19:51,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51 WrapperNode [2025-02-08 01:19:51,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:19:51,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:19:51,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:19:51,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:19:51,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,205 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-02-08 01:19:51,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:19:51,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:19:51,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:19:51,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:19:51,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:19:51,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:19:51,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:19:51,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:19:51,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:19:51,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (1/1) ... [2025-02-08 01:19:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:19:51,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:19:51,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:19:51,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:19:51,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:19:51,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:19:51,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:19:51,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:19:51,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:19:51,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:19:51,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:19:51,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 01:19:51,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 01:19:51,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:19:51,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:19:51,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:19:51,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:19:51,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:19:51,295 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:19:51,360 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:19:51,361 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:19:51,614 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:19:51,614 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:19:51,747 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:19:51,747 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:19:51,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:19:51 BoogieIcfgContainer [2025-02-08 01:19:51,748 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:19:51,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:19:51,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:19:51,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:19:51,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:19:50" (1/3) ... [2025-02-08 01:19:51,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5569ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:19:51, skipping insertion in model container [2025-02-08 01:19:51,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:19:51" (2/3) ... [2025-02-08 01:19:51,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5569ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:19:51, skipping insertion in model container [2025-02-08 01:19:51,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:19:51" (3/3) ... [2025-02-08 01:19:51,755 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-02-08 01:19:51,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:19:51,765 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c that has 5 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-08 01:19:51,765 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:19:51,823 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 01:19:51,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 100 flow [2025-02-08 01:19:51,878 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-02-08 01:19:51,880 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:19:51,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 32 events. 4/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-02-08 01:19:51,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 36 transitions, 100 flow [2025-02-08 01:19:51,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-02-08 01:19:51,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:19:51,912 INFO L333 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;@6a0285ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:19:51,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:19:51,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:19:51,929 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-02-08 01:19:51,929 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:19:51,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:51,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:51,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:51,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1041570193, now seen corresponding path program 1 times [2025-02-08 01:19:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:51,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37452222] [2025-02-08 01:19:51,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:52,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:19:52,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:19:52,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:52,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37452222] [2025-02-08 01:19:52,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37452222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:52,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:19:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617761201] [2025-02-08 01:19:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:19:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:52,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:19:52,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:19:52,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-02-08 01:19:52,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:52,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:52,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-02-08 01:19:52,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:52,446 INFO L124 PetriNetUnfolderBase]: 1184/1704 cut-off events. [2025-02-08 01:19:52,446 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-02-08 01:19:52,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1704 events. 1184/1704 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7276 event pairs, 182 based on Foata normal form. 42/1725 useless extension candidates. Maximal degree in co-relation 2858. Up to 1334 conditions per place. [2025-02-08 01:19:52,464 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 34 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2025-02-08 01:19:52,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 219 flow [2025-02-08 01:19:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:19:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:19:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-02-08 01:19:52,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-02-08 01:19:52,476 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 81 transitions. [2025-02-08 01:19:52,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 219 flow [2025-02-08 01:19:52,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:52,485 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 93 flow [2025-02-08 01:19:52,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-02-08 01:19:52,491 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-02-08 01:19:52,492 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 93 flow [2025-02-08 01:19:52,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:52,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:52,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:52,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:19:52,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:52,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 670108553, now seen corresponding path program 1 times [2025-02-08 01:19:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017487597] [2025-02-08 01:19:52,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:52,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:19:52,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:52,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:52,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:52,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017487597] [2025-02-08 01:19:52,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017487597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:52,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:52,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920905027] [2025-02-08 01:19:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:52,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:52,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:52,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:52,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-02-08 01:19:52,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:52,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:52,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-02-08 01:19:52,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:52,938 INFO L124 PetriNetUnfolderBase]: 1979/2810 cut-off events. [2025-02-08 01:19:52,938 INFO L125 PetriNetUnfolderBase]: For 688/724 co-relation queries the response was YES. [2025-02-08 01:19:52,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6485 conditions, 2810 events. 1979/2810 cut-off events. For 688/724 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12987 event pairs, 328 based on Foata normal form. 8/2640 useless extension candidates. Maximal degree in co-relation 1246. Up to 1661 conditions per place. [2025-02-08 01:19:52,951 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 68 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-02-08 01:19:52,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 398 flow [2025-02-08 01:19:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:19:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:19:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-02-08 01:19:52,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2025-02-08 01:19:52,952 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 93 flow. Second operand 5 states and 134 transitions. [2025-02-08 01:19:52,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 85 transitions, 398 flow [2025-02-08 01:19:52,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 85 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:19:52,954 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 155 flow [2025-02-08 01:19:52,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2025-02-08 01:19:52,955 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-02-08 01:19:52,955 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 155 flow [2025-02-08 01:19:52,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:52,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:52,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:52,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:19:52,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:52,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash -432089497, now seen corresponding path program 2 times [2025-02-08 01:19:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:52,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812909485] [2025-02-08 01:19:52,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:52,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:52,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:19:52,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:52,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:19:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812909485] [2025-02-08 01:19:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812909485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:53,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442643428] [2025-02-08 01:19:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:53,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:53,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:53,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:19:53,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:53,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:53,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:19:53,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:53,351 INFO L124 PetriNetUnfolderBase]: 2737/3825 cut-off events. [2025-02-08 01:19:53,351 INFO L125 PetriNetUnfolderBase]: For 2912/2912 co-relation queries the response was YES. [2025-02-08 01:19:53,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10622 conditions, 3825 events. 2737/3825 cut-off events. For 2912/2912 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 18299 event pairs, 552 based on Foata normal form. 12/3531 useless extension candidates. Maximal degree in co-relation 2225. Up to 3206 conditions per place. [2025-02-08 01:19:53,373 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 58 selfloop transitions, 6 changer transitions 2/73 dead transitions. [2025-02-08 01:19:53,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 73 transitions, 387 flow [2025-02-08 01:19:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:19:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:19:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-02-08 01:19:53,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-02-08 01:19:53,375 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 155 flow. Second operand 4 states and 102 transitions. [2025-02-08 01:19:53,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 73 transitions, 387 flow [2025-02-08 01:19:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 387 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:19:53,378 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 191 flow [2025-02-08 01:19:53,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-02-08 01:19:53,378 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-02-08 01:19:53,378 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 191 flow [2025-02-08 01:19:53,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:53,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:53,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:53,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:19:53,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:53,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash -435906419, now seen corresponding path program 3 times [2025-02-08 01:19:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959592024] [2025-02-08 01:19:53,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:53,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:19:53,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:53,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:19:53,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959592024] [2025-02-08 01:19:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959592024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190909634] [2025-02-08 01:19:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:53,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:53,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:53,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-02-08 01:19:53,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:53,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:53,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-02-08 01:19:53,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:53,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L40-->L41: Formula: (< v_~i1~0_3 v_~N1~0_1) InVars {~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} OutVars{~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[][15], [60#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 25#L64true, Black: 50#(= ~counter~0 0), 21#L97-1true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 66#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 52#true]) [2025-02-08 01:19:53,634 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2025-02-08 01:19:53,634 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-02-08 01:19:53,634 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-02-08 01:19:53,634 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2025-02-08 01:19:53,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L40-->L41: Formula: (< v_~i1~0_3 v_~N1~0_1) InVars {~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} OutVars{~i1~0=v_~i1~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[][15], [60#true, Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), 34#L51true, Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 25#L64true, Black: 50#(= ~counter~0 0), 21#L97-1true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 66#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 52#true]) [2025-02-08 01:19:53,655 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2025-02-08 01:19:53,655 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-02-08 01:19:53,655 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:19:53,655 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2025-02-08 01:19:53,850 INFO L124 PetriNetUnfolderBase]: 2615/3657 cut-off events. [2025-02-08 01:19:53,851 INFO L125 PetriNetUnfolderBase]: For 4087/4127 co-relation queries the response was YES. [2025-02-08 01:19:53,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11266 conditions, 3657 events. 2615/3657 cut-off events. For 4087/4127 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 17255 event pairs, 583 based on Foata normal form. 15/3586 useless extension candidates. Maximal degree in co-relation 2104. Up to 2714 conditions per place. [2025-02-08 01:19:53,871 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 65 selfloop transitions, 7 changer transitions 7/88 dead transitions. [2025-02-08 01:19:53,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 520 flow [2025-02-08 01:19:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:19:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:19:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-02-08 01:19:53,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-02-08 01:19:53,872 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 191 flow. Second operand 5 states and 128 transitions. [2025-02-08 01:19:53,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 520 flow [2025-02-08 01:19:53,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:19:53,879 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 233 flow [2025-02-08 01:19:53,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-02-08 01:19:53,880 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-02-08 01:19:53,880 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 233 flow [2025-02-08 01:19:53,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:53,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:53,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:53,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:19:53,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1237960397, now seen corresponding path program 4 times [2025-02-08 01:19:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:53,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382023109] [2025-02-08 01:19:53,881 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:19:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:53,888 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:19:53,893 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:53,893 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:19:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382023109] [2025-02-08 01:19:53,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382023109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:53,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:53,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825432277] [2025-02-08 01:19:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:53,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:53,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:53,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:53,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:19:53,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:53,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:53,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:19:53,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:54,268 INFO L124 PetriNetUnfolderBase]: 3765/5050 cut-off events. [2025-02-08 01:19:54,268 INFO L125 PetriNetUnfolderBase]: For 6628/6710 co-relation queries the response was YES. [2025-02-08 01:19:54,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16173 conditions, 5050 events. 3765/5050 cut-off events. For 6628/6710 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 23649 event pairs, 535 based on Foata normal form. 120/5043 useless extension candidates. Maximal degree in co-relation 5824. Up to 1923 conditions per place. [2025-02-08 01:19:54,290 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 78 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2025-02-08 01:19:54,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 620 flow [2025-02-08 01:19:54,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:19:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:19:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-02-08 01:19:54,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-02-08 01:19:54,292 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 233 flow. Second operand 5 states and 128 transitions. [2025-02-08 01:19:54,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 620 flow [2025-02-08 01:19:54,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 96 transitions, 607 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 01:19:54,295 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 287 flow [2025-02-08 01:19:54,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-02-08 01:19:54,295 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-02-08 01:19:54,296 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 287 flow [2025-02-08 01:19:54,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:54,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:54,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:54,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:19:54,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1484093211, now seen corresponding path program 1 times [2025-02-08 01:19:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50377582] [2025-02-08 01:19:54,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:54,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:19:54,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:54,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:54,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50377582] [2025-02-08 01:19:54,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50377582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:54,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:54,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534882300] [2025-02-08 01:19:54,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:54,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:54,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:54,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:54,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-02-08 01:19:54,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:54,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:54,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-02-08 01:19:54,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:54,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][41], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,572 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,572 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,572 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,572 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][41], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,581 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,581 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,581 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,581 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,605 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][41], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,605 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:54,605 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,605 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,605 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,606 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,607 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,607 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,607 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,607 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,616 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:54,616 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,616 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,616 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 33#L63true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,617 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:54,617 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,617 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,617 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 33#L63true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,627 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:54,627 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,627 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,627 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 29#thread3EXITtrue, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,627 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:54,627 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,627 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,627 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 33#L63true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,628 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:54,628 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,628 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,628 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 29#thread3EXITtrue, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,636 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:54,636 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,636 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:54,636 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:54,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 33#L63true, 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,637 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:54,637 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,637 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:54,637 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 2#thread4EXITtrue, 29#thread3EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,637 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:54,637 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:54,637 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:54,637 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][34], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 2#thread4EXITtrue, 29#thread3EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,638 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 01:19:54,638 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 01:19:54,638 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,638 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:54,640 INFO L124 PetriNetUnfolderBase]: 2737/3746 cut-off events. [2025-02-08 01:19:54,641 INFO L125 PetriNetUnfolderBase]: For 8931/9299 co-relation queries the response was YES. [2025-02-08 01:19:54,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14253 conditions, 3746 events. 2737/3746 cut-off events. For 8931/9299 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 17276 event pairs, 583 based on Foata normal form. 41/3637 useless extension candidates. Maximal degree in co-relation 8187. Up to 3322 conditions per place. [2025-02-08 01:19:54,665 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 40 selfloop transitions, 3 changer transitions 16/72 dead transitions. [2025-02-08 01:19:54,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 472 flow [2025-02-08 01:19:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:19:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:19:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-02-08 01:19:54,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-08 01:19:54,666 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 287 flow. Second operand 4 states and 99 transitions. [2025-02-08 01:19:54,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 472 flow [2025-02-08 01:19:54,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 458 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-02-08 01:19:54,675 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 256 flow [2025-02-08 01:19:54,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2025-02-08 01:19:54,676 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-02-08 01:19:54,677 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 256 flow [2025-02-08 01:19:54,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:54,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:54,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:54,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:19:54,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:54,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1888700455, now seen corresponding path program 2 times [2025-02-08 01:19:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:54,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463833509] [2025-02-08 01:19:54,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:54,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:19:54,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:54,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:19:54,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463833509] [2025-02-08 01:19:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463833509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:54,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452306597] [2025-02-08 01:19:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:54,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:54,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:54,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-02-08 01:19:54,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:54,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:54,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-02-08 01:19:54,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:54,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 15#L98-2true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,918 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2025-02-08 01:19:54,918 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-02-08 01:19:54,918 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-02-08 01:19:54,918 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2025-02-08 01:19:54,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 19#thread4ENTRYtrue]) [2025-02-08 01:19:54,943 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-08 01:19:54,943 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:19:54,943 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:19:54,943 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:19:54,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 83#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 15#L98-2true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,943 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-02-08 01:19:54,943 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:19:54,944 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:19:54,944 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-02-08 01:19:54,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 19#thread4ENTRYtrue]) [2025-02-08 01:19:54,968 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,968 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:19:54,968 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:19:54,968 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:19:54,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 83#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 19#thread4ENTRYtrue, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,969 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-08 01:19:54,969 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:19:54,969 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:19:54,969 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-02-08 01:19:54,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 83#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 19#thread4ENTRYtrue, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:54,991 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:54,991 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:54,992 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:54,992 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,019 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,019 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,019 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,019 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,041 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,041 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,041 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,041 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,048 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,048 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,048 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,048 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,049 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,049 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,049 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,049 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,050 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,050 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,050 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,050 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,051 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,051 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,055 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,055 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,055 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,055 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,071 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,071 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,071 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,071 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,071 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,071 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,072 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,078 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,078 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,078 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,078 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,078 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,078 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,079 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,079 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,079 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,079 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,079 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,079 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,080 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,080 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,080 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,080 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,080 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,080 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,084 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,085 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,085 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,085 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,095 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,095 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:55,095 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,095 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,095 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,095 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,099 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][33], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,099 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:55,099 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,099 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,100 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,100 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][61], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,102 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,102 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,102 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,102 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][61], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 33#L63true, 83#true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,111 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:55,112 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,112 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,112 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][61], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 29#thread3EXITtrue, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,119 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][61], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 33#L63true, 83#true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,119 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,119 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][61], [Black: 63#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= 1 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 83#true, 2#thread4EXITtrue, 29#thread3EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 88#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (<= ~M1~0 0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,123 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 01:19:55,123 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,123 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,123 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,126 INFO L124 PetriNetUnfolderBase]: 3039/4160 cut-off events. [2025-02-08 01:19:55,126 INFO L125 PetriNetUnfolderBase]: For 8773/9204 co-relation queries the response was YES. [2025-02-08 01:19:55,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15137 conditions, 4160 events. 3039/4160 cut-off events. For 8773/9204 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 19607 event pairs, 503 based on Foata normal form. 26/3911 useless extension candidates. Maximal degree in co-relation 8695. Up to 3310 conditions per place. [2025-02-08 01:19:55,152 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 66 selfloop transitions, 8 changer transitions 2/89 dead transitions. [2025-02-08 01:19:55,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 606 flow [2025-02-08 01:19:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:19:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:19:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-02-08 01:19:55,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-02-08 01:19:55,154 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 256 flow. Second operand 5 states and 125 transitions. [2025-02-08 01:19:55,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 606 flow [2025-02-08 01:19:55,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 582 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:19:55,163 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 319 flow [2025-02-08 01:19:55,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-02-08 01:19:55,164 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-02-08 01:19:55,165 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 319 flow [2025-02-08 01:19:55,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:55,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:55,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:19:55,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1750348543, now seen corresponding path program 3 times [2025-02-08 01:19:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579593840] [2025-02-08 01:19:55,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:55,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:19:55,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:55,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:19:55,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579593840] [2025-02-08 01:19:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579593840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478786822] [2025-02-08 01:19:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:55,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:55,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:55,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:55,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:19:55,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:55,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:55,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:19:55,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:55,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 18#L98-1true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,576 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,577 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,577 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,577 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,577 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,577 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,577 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,577 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,586 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,586 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,586 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,586 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,586 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,586 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,588 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 18#L98-1true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,588 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,588 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,588 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,588 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-02-08 01:19:55,588 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,600 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,600 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,600 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,600 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,634 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,634 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,634 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,634 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,635 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,635 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,635 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 9#thread2EXITtrue, 18#L98-1true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,636 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,636 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,636 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,636 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,644 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,644 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,644 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,644 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,644 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,645 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,646 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,646 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,646 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,646 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,646 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,646 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,650 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,650 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,650 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,650 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,650 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,650 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,651 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,651 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,651 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,651 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,651 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,651 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,652 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 18#L98-1true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,652 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,652 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,652 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,652 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,652 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:55,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,662 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,662 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,662 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,663 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,664 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,664 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,664 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,664 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 9#thread2EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 11#L41true, 98#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,690 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,690 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,690 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,690 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,690 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,690 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,690 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,690 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,700 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 2#thread4EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,700 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,700 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,700 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,700 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,700 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,701 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 9#thread2EXITtrue, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 12#L75true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,701 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,701 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,701 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,701 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,702 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,702 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), 34#L51true, Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,702 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,702 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,702 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,702 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,702 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,704 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 9#thread2EXITtrue, 18#L98-1true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,704 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,704 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,704 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,704 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,704 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 9#thread2EXITtrue, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,709 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,710 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,710 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,710 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][65], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 18#L98-1true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 98#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,712 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,712 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,712 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,712 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,730 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][31], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 9#thread2EXITtrue, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,730 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:55,730 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,730 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,730 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,730 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][65], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, 11#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,733 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,733 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,733 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,733 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][65], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 18#L98-1true, 33#L63true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 11#L41true, 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,734 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,734 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,734 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,734 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][65], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 33#L63true, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,747 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][65], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 18#L98-1true, 29#thread3EXITtrue, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,747 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,747 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:55,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L52-->L51: Formula: (and (= (+ v_~counter~0_99 1) v_~counter~0_100) (= (+ v_~i2~0_49 1) v_~i2~0_48) (not (= (ite (< 0 v_~counter~0_100) 1 0) 0))) InVars {~counter~0=v_~counter~0_100, ~i2~0=v_~i2~0_49} OutVars{~counter~0=v_~counter~0_99, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, ~i2~0=v_~i2~0_48, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][65], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 29#thread3EXITtrue, 16#L74true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 90#true, 11#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:55,756 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:55,756 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,756 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,756 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:55,762 INFO L124 PetriNetUnfolderBase]: 4642/6191 cut-off events. [2025-02-08 01:19:55,762 INFO L125 PetriNetUnfolderBase]: For 18622/19103 co-relation queries the response was YES. [2025-02-08 01:19:55,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24681 conditions, 6191 events. 4642/6191 cut-off events. For 18622/19103 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 29287 event pairs, 856 based on Foata normal form. 57/5476 useless extension candidates. Maximal degree in co-relation 13768. Up to 4577 conditions per place. [2025-02-08 01:19:55,802 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 73 selfloop transitions, 9 changer transitions 1/95 dead transitions. [2025-02-08 01:19:55,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 754 flow [2025-02-08 01:19:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:19:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:19:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-08 01:19:55,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-02-08 01:19:55,804 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 319 flow. Second operand 4 states and 100 transitions. [2025-02-08 01:19:55,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 754 flow [2025-02-08 01:19:55,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:19:55,812 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 391 flow [2025-02-08 01:19:55,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-02-08 01:19:55,812 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-02-08 01:19:55,812 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 391 flow [2025-02-08 01:19:55,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:55,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:55,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:55,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:19:55,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash 866866445, now seen corresponding path program 4 times [2025-02-08 01:19:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:55,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998318419] [2025-02-08 01:19:55,814 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:19:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:55,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:19:55,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:55,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:19:55,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998318419] [2025-02-08 01:19:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998318419] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:19:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250356615] [2025-02-08 01:19:55,861 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:19:55,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:55,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:19:55,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:19:55,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:19:55,903 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:19:55,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:19:55,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:19:55,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:55,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:19:55,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:19:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:56,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:19:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250356615] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:19:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:19:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2025-02-08 01:19:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546455699] [2025-02-08 01:19:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:56,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:56,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:19:56,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:19:56,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:56,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:56,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:19:56,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:56,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 18#L98-1true, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 6#L40true, 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,434 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,434 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:56,434 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:56,434 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-02-08 01:19:56,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 8#thread1EXITtrue, 18#L98-1true, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 12#L75true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,468 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,468 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,468 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,468 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 6#L40true, 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, 98#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,476 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,476 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,476 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,476 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 18#L98-1true, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 6#L40true, 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,477 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,477 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,478 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,478 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-02-08 01:19:56,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 8#thread1EXITtrue, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,492 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:56,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,492 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 8#thread1EXITtrue, 9#thread2EXITtrue, 18#L98-1true, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, 98#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,493 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:56,493 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,493 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,493 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 9#thread2EXITtrue, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 6#L40true, 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, 98#true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,497 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-02-08 01:19:56,497 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,497 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,497 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 01:19:56,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, 8#thread1EXITtrue, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, 10#L99true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,508 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:56,509 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,509 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,509 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), 34#L51true, 25#L64true, Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), Black: 50#(= ~counter~0 0), 74#true, 12#L75true, 31#L100true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,510 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 01:19:56,510 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,510 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,510 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 01:19:56,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 9#thread2EXITtrue, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, 31#L100true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,519 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 01:19:56,519 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 01:19:56,519 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 01:19:56,520 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 01:19:56,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([311] L63-->L64: Formula: (< v_~j1~0_3 v_~M1~0_1) InVars {~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} OutVars{~j1~0=v_~j1~0_3, ~M1~0=v_~M1~0_1} AuxVars[] AssignedVars[][69], [Black: 95#(and (<= ~N1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 92#(and (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), Black: 62#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 24#L101true, Black: 101#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), Black: 100#(and (= ~j2~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0) (= ~M2~0 ~N1~0)), 104#true, Black: 68#(and (= ~i1~0 0) (= ~M1~0 ~N1~0) (= ~j1~0 0)), 52#true, Black: 77#(<= (+ ~i2~0 1) ~N2~0), Black: 79#(and (<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)) (<= (+ ~i2~0 1) ~N2~0)), Black: 76#(<= (+ ~N1~0 ~i2~0) (+ ~N2~0 ~i1~0)), 25#L64true, Black: 50#(= ~counter~0 0), 74#true, 12#L75true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0)), 98#true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (= ~N2~0 ~N1~0))]) [2025-02-08 01:19:56,527 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2025-02-08 01:19:56,527 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2025-02-08 01:19:56,527 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-02-08 01:19:56,527 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2025-02-08 01:19:56,538 INFO L124 PetriNetUnfolderBase]: 3996/5566 cut-off events. [2025-02-08 01:19:56,538 INFO L125 PetriNetUnfolderBase]: For 19896/20476 co-relation queries the response was YES. [2025-02-08 01:19:56,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24660 conditions, 5566 events. 3996/5566 cut-off events. For 19896/20476 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 28609 event pairs, 728 based on Foata normal form. 247/5693 useless extension candidates. Maximal degree in co-relation 13530. Up to 2559 conditions per place. [2025-02-08 01:19:56,583 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 80 selfloop transitions, 12 changer transitions 1/103 dead transitions. [2025-02-08 01:19:56,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 852 flow [2025-02-08 01:19:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:19:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:19:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-08 01:19:56,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2025-02-08 01:19:56,589 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 391 flow. Second operand 4 states and 103 transitions. [2025-02-08 01:19:56,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 852 flow [2025-02-08 01:19:56,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:19:56,596 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 451 flow [2025-02-08 01:19:56,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2025-02-08 01:19:56,597 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2025-02-08 01:19:56,597 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 451 flow [2025-02-08 01:19:56,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:56,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:56,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:56,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:19:56,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:56,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:56,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash -823745745, now seen corresponding path program 1 times [2025-02-08 01:19:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973158998] [2025-02-08 01:19:56,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:56,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:19:56,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:19:56,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:56,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:19:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973158998] [2025-02-08 01:19:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973158998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:56,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:19:56,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413309624] [2025-02-08 01:19:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:19:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:56,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:19:56,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:19:56,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2025-02-08 01:19:56,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:56,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:56,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2025-02-08 01:19:56,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:57,315 INFO L124 PetriNetUnfolderBase]: 3917/5621 cut-off events. [2025-02-08 01:19:57,315 INFO L125 PetriNetUnfolderBase]: For 26406/27109 co-relation queries the response was YES. [2025-02-08 01:19:57,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26896 conditions, 5621 events. 3917/5621 cut-off events. For 26406/27109 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 30494 event pairs, 1110 based on Foata normal form. 166/5558 useless extension candidates. Maximal degree in co-relation 15862. Up to 4451 conditions per place. [2025-02-08 01:19:57,395 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 64 selfloop transitions, 9 changer transitions 5/92 dead transitions. [2025-02-08 01:19:57,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 846 flow [2025-02-08 01:19:57,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:19:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:19:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-08 01:19:57,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-02-08 01:19:57,400 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 451 flow. Second operand 4 states and 93 transitions. [2025-02-08 01:19:57,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 846 flow [2025-02-08 01:19:57,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 844 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 01:19:57,411 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 536 flow [2025-02-08 01:19:57,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=536, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-02-08 01:19:57,413 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2025-02-08 01:19:57,413 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 536 flow [2025-02-08 01:19:57,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:57,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:57,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:57,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:19:57,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:57,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1059253551, now seen corresponding path program 2 times [2025-02-08 01:19:57,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:57,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196134325] [2025-02-08 01:19:57,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:57,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:19:57,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-02-08 01:19:57,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:19:57,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:19:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196134325] [2025-02-08 01:19:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196134325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:57,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:57,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:19:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978056212] [2025-02-08 01:19:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:57,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:19:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:57,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:19:57,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:19:57,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:19:57,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:57,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:57,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:19:57,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:57,956 INFO L124 PetriNetUnfolderBase]: 4640/6375 cut-off events. [2025-02-08 01:19:57,956 INFO L125 PetriNetUnfolderBase]: For 34125/34511 co-relation queries the response was YES. [2025-02-08 01:19:57,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32204 conditions, 6375 events. 4640/6375 cut-off events. For 34125/34511 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 31491 event pairs, 623 based on Foata normal form. 281/6528 useless extension candidates. Maximal degree in co-relation 18438. Up to 3216 conditions per place. [2025-02-08 01:19:57,989 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 91 selfloop transitions, 13 changer transitions 4/120 dead transitions. [2025-02-08 01:19:57,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 120 transitions, 1144 flow [2025-02-08 01:19:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:19:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:19:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-02-08 01:19:57,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-02-08 01:19:57,990 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 536 flow. Second operand 5 states and 123 transitions. [2025-02-08 01:19:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 120 transitions, 1144 flow [2025-02-08 01:19:58,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 120 transitions, 1132 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-08 01:19:58,001 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 590 flow [2025-02-08 01:19:58,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=590, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2025-02-08 01:19:58,002 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-02-08 01:19:58,002 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 590 flow [2025-02-08 01:19:58,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:58,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:58,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:58,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:19:58,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:58,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1317733379, now seen corresponding path program 1 times [2025-02-08 01:19:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:58,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083681637] [2025-02-08 01:19:58,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:19:58,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:19:58,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:58,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:19:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083681637] [2025-02-08 01:19:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083681637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:58,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:19:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425307179] [2025-02-08 01:19:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:58,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:19:58,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:58,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:19:58,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:19:58,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:19:58,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 590 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:58,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:58,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:19:58,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:58,371 INFO L124 PetriNetUnfolderBase]: 3437/4734 cut-off events. [2025-02-08 01:19:58,372 INFO L125 PetriNetUnfolderBase]: For 29143/29740 co-relation queries the response was YES. [2025-02-08 01:19:58,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25482 conditions, 4734 events. 3437/4734 cut-off events. For 29143/29740 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22468 event pairs, 583 based on Foata normal form. 212/4837 useless extension candidates. Maximal degree in co-relation 23082. Up to 3150 conditions per place. [2025-02-08 01:19:58,399 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 75 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2025-02-08 01:19:58,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 950 flow [2025-02-08 01:19:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:19:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:19:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-02-08 01:19:58,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-02-08 01:19:58,401 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 590 flow. Second operand 5 states and 114 transitions. [2025-02-08 01:19:58,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 950 flow [2025-02-08 01:19:58,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 903 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-02-08 01:19:58,425 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 563 flow [2025-02-08 01:19:58,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=563, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2025-02-08 01:19:58,427 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2025-02-08 01:19:58,427 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 563 flow [2025-02-08 01:19:58,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:58,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:58,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:58,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:19:58,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:58,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -734326423, now seen corresponding path program 1 times [2025-02-08 01:19:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222188363] [2025-02-08 01:19:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:19:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:58,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:19:58,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:19:58,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:58,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222188363] [2025-02-08 01:19:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222188363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:58,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:19:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528099894] [2025-02-08 01:19:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:58,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:19:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:58,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:19:58,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:19:58,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-02-08 01:19:58,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 563 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:58,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:58,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-02-08 01:19:58,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:59,151 INFO L124 PetriNetUnfolderBase]: 6001/9079 cut-off events. [2025-02-08 01:19:59,152 INFO L125 PetriNetUnfolderBase]: For 54712/56728 co-relation queries the response was YES. [2025-02-08 01:19:59,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46826 conditions, 9079 events. 6001/9079 cut-off events. For 54712/56728 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 56067 event pairs, 1245 based on Foata normal form. 914/9601 useless extension candidates. Maximal degree in co-relation 30551. Up to 3904 conditions per place. [2025-02-08 01:19:59,219 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 69 selfloop transitions, 27 changer transitions 2/124 dead transitions. [2025-02-08 01:19:59,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 124 transitions, 1210 flow [2025-02-08 01:19:59,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:19:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:19:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-08 01:19:59,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2025-02-08 01:19:59,221 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 563 flow. Second operand 4 states and 114 transitions. [2025-02-08 01:19:59,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 124 transitions, 1210 flow [2025-02-08 01:19:59,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 124 transitions, 1182 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:19:59,239 INFO L231 Difference]: Finished difference. Result has 73 places, 89 transitions, 958 flow [2025-02-08 01:19:59,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=958, PETRI_PLACES=73, PETRI_TRANSITIONS=89} [2025-02-08 01:19:59,241 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2025-02-08 01:19:59,241 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 89 transitions, 958 flow [2025-02-08 01:19:59,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:59,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:59,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:19:59,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:19:59,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2088359987, now seen corresponding path program 2 times [2025-02-08 01:19:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765950946] [2025-02-08 01:19:59,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:59,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:19:59,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:19:59,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:19:59,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:59,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765950946] [2025-02-08 01:19:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765950946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:19:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469007044] [2025-02-08 01:19:59,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:59,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:19:59,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:19:59,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:19:59,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:19:59,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:19:59,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:19:59,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:19:59,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:59,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:19:59,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:19:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:19:59,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:19:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469007044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:19:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-02-08 01:19:59,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862646630] [2025-02-08 01:19:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:59,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:19:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:59,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:19:59,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:19:59,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2025-02-08 01:19:59,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 89 transitions, 958 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:19:59,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:59,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2025-02-08 01:19:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:00,843 INFO L124 PetriNetUnfolderBase]: 12033/18119 cut-off events. [2025-02-08 01:20:00,843 INFO L125 PetriNetUnfolderBase]: For 166943/172984 co-relation queries the response was YES. [2025-02-08 01:20:00,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105455 conditions, 18119 events. 12033/18119 cut-off events. For 166943/172984 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 123622 event pairs, 2078 based on Foata normal form. 1457/18836 useless extension candidates. Maximal degree in co-relation 70076. Up to 7711 conditions per place. [2025-02-08 01:20:01,002 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 87 selfloop transitions, 66 changer transitions 2/181 dead transitions. [2025-02-08 01:20:01,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 181 transitions, 2076 flow [2025-02-08 01:20:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:20:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:20:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-02-08 01:20:01,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2025-02-08 01:20:01,004 INFO L175 Difference]: Start difference. First operand has 73 places, 89 transitions, 958 flow. Second operand 5 states and 147 transitions. [2025-02-08 01:20:01,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 181 transitions, 2076 flow [2025-02-08 01:20:01,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 181 transitions, 2042 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-02-08 01:20:01,038 INFO L231 Difference]: Finished difference. Result has 79 places, 128 transitions, 1694 flow [2025-02-08 01:20:01,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1694, PETRI_PLACES=79, PETRI_TRANSITIONS=128} [2025-02-08 01:20:01,039 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 39 predicate places. [2025-02-08 01:20:01,039 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 128 transitions, 1694 flow [2025-02-08 01:20:01,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:01,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:01,039 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:01,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:20:01,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:01,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:20:01,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1533925659, now seen corresponding path program 3 times [2025-02-08 01:20:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114864528] [2025-02-08 01:20:01,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:20:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:01,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:20:01,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:20:01,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:20:01,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:01,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114864528] [2025-02-08 01:20:01,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114864528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:01,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:01,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:20:01,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360070725] [2025-02-08 01:20:01,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:01,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:20:01,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:01,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:20:01,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:20:01,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:20:01,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 128 transitions, 1694 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:01,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:01,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:20:01,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:04,492 INFO L124 PetriNetUnfolderBase]: 26032/37197 cut-off events. [2025-02-08 01:20:04,493 INFO L125 PetriNetUnfolderBase]: For 373090/383249 co-relation queries the response was YES. [2025-02-08 01:20:04,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224511 conditions, 37197 events. 26032/37197 cut-off events. For 373090/383249 co-relation queries the response was YES. Maximal size of possible extension queue 1961. Compared 250915 event pairs, 5122 based on Foata normal form. 2027/38130 useless extension candidates. Maximal degree in co-relation 84641. Up to 18929 conditions per place. [2025-02-08 01:20:04,890 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 248 selfloop transitions, 43 changer transitions 0/304 dead transitions. [2025-02-08 01:20:04,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 304 transitions, 4446 flow [2025-02-08 01:20:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:20:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:20:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-02-08 01:20:04,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-02-08 01:20:04,891 INFO L175 Difference]: Start difference. First operand has 79 places, 128 transitions, 1694 flow. Second operand 7 states and 176 transitions. [2025-02-08 01:20:04,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 304 transitions, 4446 flow [2025-02-08 01:20:05,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 304 transitions, 4176 flow, removed 135 selfloop flow, removed 0 redundant places. [2025-02-08 01:20:05,210 INFO L231 Difference]: Finished difference. Result has 87 places, 147 transitions, 2030 flow [2025-02-08 01:20:05,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2030, PETRI_PLACES=87, PETRI_TRANSITIONS=147} [2025-02-08 01:20:05,212 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2025-02-08 01:20:05,212 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 147 transitions, 2030 flow [2025-02-08 01:20:05,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:05,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:05,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:05,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:20:05,212 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:20:05,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 200691219, now seen corresponding path program 4 times [2025-02-08 01:20:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:05,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985655561] [2025-02-08 01:20:05,216 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:20:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:05,220 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:05,227 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:20:05,229 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:20:05,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985655561] [2025-02-08 01:20:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985655561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:20:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464961117] [2025-02-08 01:20:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:20:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:05,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:20:05,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:20:05,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-02-08 01:20:05,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 147 transitions, 2030 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:05,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:05,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-02-08 01:20:05,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:10,196 INFO L124 PetriNetUnfolderBase]: 43320/61809 cut-off events. [2025-02-08 01:20:10,196 INFO L125 PetriNetUnfolderBase]: For 666041/670531 co-relation queries the response was YES. [2025-02-08 01:20:10,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387210 conditions, 61809 events. 43320/61809 cut-off events. For 666041/670531 co-relation queries the response was YES. Maximal size of possible extension queue 3194. Compared 446441 event pairs, 7151 based on Foata normal form. 1690/62490 useless extension candidates. Maximal degree in co-relation 284308. Up to 18729 conditions per place. [2025-02-08 01:20:10,708 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 373 selfloop transitions, 88 changer transitions 19/492 dead transitions. [2025-02-08 01:20:10,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 492 transitions, 7872 flow [2025-02-08 01:20:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:20:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:20:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-02-08 01:20:10,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-02-08 01:20:10,709 INFO L175 Difference]: Start difference. First operand has 87 places, 147 transitions, 2030 flow. Second operand 8 states and 207 transitions. [2025-02-08 01:20:10,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 492 transitions, 7872 flow [2025-02-08 01:20:11,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 492 transitions, 7778 flow, removed 29 selfloop flow, removed 2 redundant places. [2025-02-08 01:20:11,308 INFO L231 Difference]: Finished difference. Result has 98 places, 222 transitions, 3556 flow [2025-02-08 01:20:11,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1993, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3556, PETRI_PLACES=98, PETRI_TRANSITIONS=222} [2025-02-08 01:20:11,309 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 58 predicate places. [2025-02-08 01:20:11,309 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 222 transitions, 3556 flow [2025-02-08 01:20:11,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:11,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:11,309 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:11,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:20:11,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:20:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1833718753, now seen corresponding path program 5 times [2025-02-08 01:20:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:11,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589162117] [2025-02-08 01:20:11,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:20:11,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:11,316 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:11,319 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:20:11,319 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:11,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:11,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589162117] [2025-02-08 01:20:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589162117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803900639] [2025-02-08 01:20:11,385 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:20:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:11,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:20:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:20:11,425 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:20:11,444 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:20:11,444 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:11,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:11,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 01:20:11,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:11,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:11,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803900639] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:20:11,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:20:11,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-08 01:20:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866704908] [2025-02-08 01:20:11,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:20:11,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 01:20:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:11,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 01:20:11,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:20:11,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-02-08 01:20:11,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 222 transitions, 3556 flow. Second operand has 14 states, 14 states have (on average 14.785714285714286) internal successors, (207), 14 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:11,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:11,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-02-08 01:20:11,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand