MCC'2025- Execution of r167-tall-174881266200097

About the Execution of 2024-gold for QuasiCertifProtocol-COL-32

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15679.080	324573.00	350478.00	1091.20	33 19 1 33 1 33 33 1089 33 33 1089 33 33 33 33 33	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266200097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 131K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748900137198

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 21:35:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 21:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:35:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 21:35:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 21:35:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2025-06-02 21:35:39] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 21:35:39] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2025-06-02 21:35:39] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2025-06-02 21:35:39] [INFO ] Computed 5 invariants in 17 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[33, 19, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 19, 1, 33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 19 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 33 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 21:35:39] [INFO ] Invariant cache hit.
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 21:35:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:35:39] [INFO ] Added : 4 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 63 ms.
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:35:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:39] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:35:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:35:39] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:35:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:39] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:35:39] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 21:35:39] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 21:35:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 21:35:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:40] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using 5 positive place invariants in 27 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-02 21:35:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 21:35:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:40] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 21:35:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:35:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:40] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:35:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 21:35:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:35:40] [INFO ] Added : 12 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 11 ms.
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:35:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:35:40] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:40] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:35:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:41] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2025-06-02 21:35:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 21:35:41] [INFO ] Added : 11 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:35:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:35:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:41] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:35:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:35:41] [INFO ] Added : 8 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 21:35:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:35:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:35:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:41] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:35:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:35:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:35:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:35:41] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:35:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:35:41] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2025-06-02 21:35:41] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 37 ms.
[2025-06-02 21:35:41] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
// Phase 1: matrix 506 rows 3806 cols
[2025-06-02 21:35:41] [INFO ] Computed 3301 invariants in 125 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
RANDOM walk for 10000 steps (267 resets) in 413 ms. (24 steps per ms)
BEST_FIRST walk for 130012 steps (136 resets) in 703 ms. (184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
[2025-06-02 21:35:42] [INFO ] Invariant cache hit.
[2025-06-02 21:35:43] [INFO ] [Real]Absence check using 37 positive place invariants in 91 ms returned sat
[2025-06-02 21:35:43] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 599 ms returned sat
[2025-06-02 21:35:46] [INFO ] [Real]Absence check using state equation in 2532 ms returned sat
[2025-06-02 21:35:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 78 ms returned sat
[2025-06-02 21:35:47] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 634 ms returned sat
[2025-06-02 21:35:49] [INFO ] [Nat]Absence check using state equation in 2030 ms returned sat
[2025-06-02 21:35:52] [INFO ] Deduced a trap composed of 6 places in 2852 ms of which 188 ms to minimize.
[2025-06-02 21:35:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:35:53] [INFO ] [Real]Absence check using 37 positive place invariants in 96 ms returned sat
[2025-06-02 21:35:53] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 644 ms returned sat
[2025-06-02 21:35:55] [INFO ] [Real]Absence check using state equation in 1580 ms returned sat
[2025-06-02 21:35:55] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2025-06-02 21:35:57] [INFO ] Added : 86 causal constraints over 18 iterations in 1865 ms. Result :sat
Minimization took 184 ms.
[2025-06-02 21:35:58] [INFO ] [Real]Absence check using 37 positive place invariants in 75 ms returned sat
[2025-06-02 21:35:58] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 620 ms returned sat
[2025-06-02 21:36:00] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2025-06-02 21:36:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 73 ms returned sat
[2025-06-02 21:36:01] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 617 ms returned sat
[2025-06-02 21:36:03] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2025-06-02 21:36:03] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 59 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-02 21:36:05] [INFO ] [Real]Absence check using 37 positive place invariants in 78 ms returned sat
[2025-06-02 21:36:06] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 594 ms returned sat
[2025-06-02 21:36:07] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2025-06-02 21:36:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:08] [INFO ] [Nat]Absence check using 37 positive place invariants in 85 ms returned sat
[2025-06-02 21:36:09] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 646 ms returned sat
[2025-06-02 21:36:10] [INFO ] [Nat]Absence check using state equation in 1687 ms returned sat
[2025-06-02 21:36:10] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 46 ms.
[2025-06-02 21:36:11] [INFO ] Added : 39 causal constraints over 8 iterations in 805 ms. Result :sat
Minimization took 676 ms.
[2025-06-02 21:36:12] [INFO ] [Real]Absence check using 37 positive place invariants in 81 ms returned sat
[2025-06-02 21:36:13] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 632 ms returned sat
[2025-06-02 21:36:16] [INFO ] [Real]Absence check using state equation in 2917 ms returned sat
[2025-06-02 21:36:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:16] [INFO ] [Nat]Absence check using 37 positive place invariants in 77 ms returned sat
[2025-06-02 21:36:17] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 624 ms returned sat
[2025-06-02 21:36:20] [INFO ] [Nat]Absence check using state equation in 3186 ms returned sat
[2025-06-02 21:36:20] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 45 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-02 21:36:21] [INFO ] [Real]Absence check using 37 positive place invariants in 70 ms returned sat
[2025-06-02 21:36:22] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 614 ms returned sat
[2025-06-02 21:36:26] [INFO ] [Real]Absence check using state equation in 4004 ms returned unknown
[2025-06-02 21:36:26] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned sat
[2025-06-02 21:36:27] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 609 ms returned sat
[2025-06-02 21:36:29] [INFO ] [Real]Absence check using state equation in 1498 ms returned sat
[2025-06-02 21:36:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 72 ms returned sat
[2025-06-02 21:36:30] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 625 ms returned sat
[2025-06-02 21:36:32] [INFO ] [Nat]Absence check using state equation in 1937 ms returned sat
[2025-06-02 21:36:32] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
[2025-06-02 21:36:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:36:34] [INFO ] [Real]Absence check using 37 positive place invariants in 78 ms returned sat
[2025-06-02 21:36:35] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 621 ms returned sat
[2025-06-02 21:36:38] [INFO ] [Real]Absence check using state equation in 3337 ms returned sat
[2025-06-02 21:36:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 77 ms returned sat
[2025-06-02 21:36:39] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 623 ms returned sat
[2025-06-02 21:36:43] [INFO ] [Nat]Absence check using state equation in 3969 ms returned unknown
[2025-06-02 21:36:44] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned sat
[2025-06-02 21:36:44] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 633 ms returned sat
[2025-06-02 21:36:46] [INFO ] [Real]Absence check using state equation in 1483 ms returned unsat
[2025-06-02 21:36:46] [INFO ] [Real]Absence check using 37 positive place invariants in 78 ms returned sat
[2025-06-02 21:36:47] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 630 ms returned sat
[2025-06-02 21:36:48] [INFO ] [Real]Absence check using state equation in 1349 ms returned sat
[2025-06-02 21:36:48] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 47 ms.
[2025-06-02 21:36:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 75 ms returned sat
[2025-06-02 21:36:52] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 642 ms returned sat
[2025-06-02 21:36:53] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2025-06-02 21:36:53] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 35 ms.
[2025-06-02 21:36:56] [INFO ] Added : 135 causal constraints over 27 iterations in 2437 ms. Result :sat
Minimization took 114 ms.
[2025-06-02 21:36:56] [INFO ] [Real]Absence check using 37 positive place invariants in 78 ms returned sat
[2025-06-02 21:36:57] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 662 ms returned sat
[2025-06-02 21:36:58] [INFO ] [Real]Absence check using state equation in 1537 ms returned sat
[2025-06-02 21:36:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 73 ms returned sat
[2025-06-02 21:36:59] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 618 ms returned sat
[2025-06-02 21:37:01] [INFO ] [Nat]Absence check using state equation in 1683 ms returned sat
[2025-06-02 21:37:01] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2025-06-02 21:37:03] [INFO ] Added : 87 causal constraints over 18 iterations in 1590 ms. Result :sat
Minimization took 624 ms.
[2025-06-02 21:37:04] [INFO ] [Real]Absence check using 37 positive place invariants in 74 ms returned sat
[2025-06-02 21:37:05] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 648 ms returned sat
[2025-06-02 21:37:06] [INFO ] [Real]Absence check using state equation in 1482 ms returned sat
[2025-06-02 21:37:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:07] [INFO ] [Nat]Absence check using 37 positive place invariants in 74 ms returned sat
[2025-06-02 21:37:07] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 645 ms returned sat
[2025-06-02 21:37:09] [INFO ] [Nat]Absence check using state equation in 1529 ms returned sat
[2025-06-02 21:37:09] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2025-06-02 21:37:11] [INFO ] Added : 135 causal constraints over 27 iterations in 2325 ms. Result :unknown
[2025-06-02 21:37:12] [INFO ] [Real]Absence check using 37 positive place invariants in 75 ms returned sat
[2025-06-02 21:37:12] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 628 ms returned sat
[2025-06-02 21:37:16] [INFO ] [Real]Absence check using state equation in 3983 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, 33, 33, +inf, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[33, 1, 33, 33, 1089, 33, 33, 66, 2, 33, 33, 33] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, 33, +inf, 33, 33]
Support contains 2476 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3769 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.24 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 3736 transition count 436
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 104 place count 3736 transition count 402
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 65 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 1 with 133 rules applied. Total rules applied 237 place count 3637 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 237 place count 3637 transition count 401
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 240 place count 3635 transition count 401
Applied a total of 240 rules in 379 ms. Remains 3635 /3806 variables (removed 171) and now considering 401/506 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 3635/3806 places, 401/506 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 401 rows 3635 cols
[2025-06-02 21:37:19] [INFO ] Computed 3235 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[33, 1, 33, 33, 1089, 33, 33, 66, 2, 33, 33, 33] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, 33, +inf, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 854418 steps (12218 resets) in 30001 ms. (28 steps per ms)
BEST_FIRST walk for 4583919 steps (3242 resets) in 24806 ms. (184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33, 33, 1089, 66, 2, 33] Max Struct:[+inf, +inf, +inf, 1089, 33, +inf]
[2025-06-02 21:38:14] [INFO ] Invariant cache hit.
[2025-06-02 21:38:15] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 668 ms returned sat
[2025-06-02 21:38:21] [INFO ] [Real]Absence check using state equation in 5934 ms returned unsat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 655 ms returned sat
[2025-06-02 21:38:32] [INFO ] [Real]Absence check using state equation in 9921 ms returned sat
[2025-06-02 21:38:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:33] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 682 ms returned sat
[2025-06-02 21:38:47] [INFO ] [Nat]Absence check using state equation in 14228 ms returned unsat
[2025-06-02 21:38:48] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 662 ms returned sat
[2025-06-02 21:39:08] [INFO ] [Real]Absence check using state equation in 19985 ms returned sat
[2025-06-02 21:39:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:09] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 670 ms returned sat
[2025-06-02 21:39:53] [INFO ] [Nat]Absence check using state equation in 44042 ms returned unknown
[2025-06-02 21:39:54] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 678 ms returned sat
[2025-06-02 21:39:57] [INFO ] [Real]Absence check using state equation in 2499 ms returned sat
[2025-06-02 21:39:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:58] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 676 ms returned sat
[2025-06-02 21:39:59] [INFO ] [Nat]Absence check using state equation in 1720 ms returned sat
[2025-06-02 21:40:00] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 33 ms.
[2025-06-02 21:40:02] [INFO ] Added : 134 causal constraints over 27 iterations in 2093 ms. Result :sat
Minimization took 5153 ms.
[2025-06-02 21:40:08] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 657 ms returned sat
[2025-06-02 21:40:10] [INFO ] [Real]Absence check using state equation in 1872 ms returned sat
[2025-06-02 21:40:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:11] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 665 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Nat]Absence check using state equation in 2461 ms returned sat
[2025-06-02 21:40:13] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 37 ms.
[2025-06-02 21:40:16] [INFO ] Added : 150 causal constraints over 30 iterations in 2485 ms. Result :sat
Minimization took 5028 ms.
[2025-06-02 21:40:22] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 649 ms returned sat
[2025-06-02 21:40:25] [INFO ] [Real]Absence check using state equation in 3141 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[33, 33, 1089, 66, 2, 33] Max Struct:[33, 33, +inf, 1089, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1089, 66, 2] Max Struct:[+inf, 1089, 33]
Support contains 2211 out of 3635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3635/3635 places, 401/401 transitions.
Graph (complete) has 41814 edges and 3635 vertex of which 3600 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.5 ms
Discarding 35 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 3567 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 202 place count 3566 transition count 233
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 202 place count 3566 transition count 134
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 433 place count 3434 transition count 134
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 3434 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 435 place count 3433 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 436 place count 3432 transition count 132
Applied a total of 436 rules in 364 ms. Remains 3432 /3635 variables (removed 203) and now considering 132/401 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 3432/3635 places, 132/401 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 132 rows 3432 cols
[2025-06-02 21:40:26] [INFO ] Computed 3300 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1089, 66, 2] Max Struct:[1089, 1089, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 1089 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 506435 steps (3807 resets) in 30001 ms. (16 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 1089 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 106165 steps (44 resets) in 5001 ms. (21 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 21:41:01] [INFO ] Flatten gal took : 328 ms
[2025-06-02 21:41:01] [INFO ] Flatten gal took : 132 ms
[2025-06-02 21:41:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3643103444706460161.gal : 40 ms
[2025-06-02 21:41:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2663364359034734445.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3643103444706460161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2663364359034734445.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
ITS runner timed out or was interrupted.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 323310 ms.

BK_STOP 1748900461771

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is QuasiCertifProtocol-COL-32, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-174881266200097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;