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-174881266200096.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-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 147K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 120K 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-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-28-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748900088248

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-28
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 21:34:49] [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:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:34:49] [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:34:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 21:34:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 790 ms
[2025-06-02 21:34:50] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2025-06-02 21:34:50] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2025-06-02 21:34:50] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2025-06-02 21:34:50] [INFO ] Computed 5 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 29, 1, 16, +inf, 29, +inf, 1, 16, 16, 841, 1, 29, 1, +inf, 1]
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-08 16 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 21:34:50] [INFO ] Invariant cache hit.
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 21:34:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 21:34:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:34:50] [INFO ] Added : 13 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 21:34:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:50] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 21:34:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 21:34:50] [INFO ] Added : 4 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:34:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 21:34:50] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:34:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:50] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 21:34:50] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:34:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:34:51] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:34:51] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:34:51] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:34:51] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:34:51] [INFO ] Added : 13 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:34:51] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:34:51] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:34:51] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:34:51] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 21:34:51] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:34:51] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:34:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:34:51] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:34:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:34:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:34:51] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 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, 0, 0] Max Struct:[29, 29, 1, 16, +inf, 29, +inf, 1, 16, 841, 1, 29, 1, +inf, 1]
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2025-06-02 21:34:51] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 29 ms.
[2025-06-02 21:34:51] [INFO ] Unfolded 15 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, 0, 0] Max Struct:[+inf, +inf, +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, 0, 0] Max Struct:[29, 29, 1, 16, +inf, 29, +inf, 1, 16, 841, 1, 29, 1, +inf, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 29, 1, 16, +inf, 29, +inf, 1, 16, 841, 1, 29, 1, +inf, 1]
// Phase 1: matrix 446 rows 2998 cols
[2025-06-02 21:34:52] [INFO ] Computed 2553 invariants in 110 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 29, 1, 16, +inf, 29, +inf, 1, 16, 841, 1, 29, 1, +inf, 1]
RANDOM walk for 10000 steps (302 resets) in 336 ms. (29 steps per ms)
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (173 resets) in 557 ms. (215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 29, 1, +inf, 29, +inf, 1, 16, 841, 1, 29, +inf]
[2025-06-02 21:34:53] [INFO ] Invariant cache hit.
[2025-06-02 21:34:53] [INFO ] [Real]Absence check using 4 positive place invariants in 40 ms returned sat
[2025-06-02 21:34:53] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 509 ms returned sat
[2025-06-02 21:34:56] [INFO ] [Real]Absence check using state equation in 2258 ms returned sat
[2025-06-02 21:34:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 38 ms returned sat
[2025-06-02 21:34:57] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 506 ms returned sat
[2025-06-02 21:34:58] [INFO ] [Nat]Absence check using state equation in 1808 ms returned sat
[2025-06-02 21:34:58] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 48 ms.
[2025-06-02 21:35:01] [INFO ] Added : 147 causal constraints over 30 iterations in 2102 ms. Result :sat
Minimization took 189 ms.
[2025-06-02 21:35:01] [INFO ] [Real]Absence check using 4 positive place invariants in 28 ms returned sat
[2025-06-02 21:35:02] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 473 ms returned sat
[2025-06-02 21:35:04] [INFO ] [Real]Absence check using state equation in 2731 ms returned sat
[2025-06-02 21:35:04] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 39 ms.
[2025-06-02 21:35:05] [INFO ] Added : 60 causal constraints over 12 iterations in 975 ms. Result :sat
Minimization took 306 ms.
[2025-06-02 21:35:06] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2025-06-02 21:35:07] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 457 ms returned sat
[2025-06-02 21:35:08] [INFO ] [Real]Absence check using state equation in 1503 ms returned sat
[2025-06-02 21:35:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2025-06-02 21:35:10] [INFO ] Added : 85 causal constraints over 17 iterations in 1409 ms. Result :sat
Minimization took 816 ms.
[2025-06-02 21:35:11] [INFO ] [Real]Absence check using 4 positive place invariants in 28 ms returned sat
[2025-06-02 21:35:11] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 485 ms returned sat
[2025-06-02 21:35:13] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2025-06-02 21:35:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 29 ms returned sat
[2025-06-02 21:35:13] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 480 ms returned sat
[2025-06-02 21:35:15] [INFO ] [Nat]Absence check using state equation in 1299 ms returned sat
[2025-06-02 21:35:15] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2025-06-02 21:35:16] [INFO ] Added : 75 causal constraints over 15 iterations in 1105 ms. Result :sat
Minimization took 758 ms.
[2025-06-02 21:35:17] [INFO ] [Real]Absence check using 4 positive place invariants in 29 ms returned sat
[2025-06-02 21:35:17] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 465 ms returned sat
[2025-06-02 21:35:18] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2025-06-02 21:35:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 38 ms returned sat
[2025-06-02 21:35:19] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 422 ms returned sat
[2025-06-02 21:35:20] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2025-06-02 21:35:20] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2025-06-02 21:35:22] [INFO ] Added : 119 causal constraints over 24 iterations in 1895 ms. Result :sat
Minimization took 805 ms.
[2025-06-02 21:35:23] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2025-06-02 21:35:24] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 432 ms returned sat
[2025-06-02 21:35:25] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2025-06-02 21:35:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 28 ms returned sat
[2025-06-02 21:35:26] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 497 ms returned sat
[2025-06-02 21:35:28] [INFO ] [Nat]Absence check using state equation in 1647 ms returned sat
[2025-06-02 21:35:28] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
[2025-06-02 21:35:29] [INFO ] Added : 105 causal constraints over 21 iterations in 1595 ms. Result :sat
Minimization took 789 ms.
[2025-06-02 21:35:30] [INFO ] [Real]Absence check using 4 positive place invariants in 32 ms returned sat
[2025-06-02 21:35:31] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 421 ms returned sat
[2025-06-02 21:35:32] [INFO ] [Real]Absence check using state equation in 1428 ms returned sat
[2025-06-02 21:35:32] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2025-06-02 21:35:33] [INFO ] Added : 42 causal constraints over 9 iterations in 792 ms. Result :sat
Minimization took 644 ms.
[2025-06-02 21:35:34] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2025-06-02 21:35:35] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 466 ms returned sat
[2025-06-02 21:35:36] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2025-06-02 21:35:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 29 ms returned sat
[2025-06-02 21:35:37] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 446 ms returned sat
[2025-06-02 21:35:39] [INFO ] [Nat]Absence check using state equation in 2232 ms returned unknown
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using 4 positive place invariants in 39 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 449 ms returned sat
[2025-06-02 21:35:43] [INFO ] [Real]Absence check using state equation in 3476 ms returned sat
[2025-06-02 21:35:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 27 ms returned sat
[2025-06-02 21:35:44] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 481 ms returned sat
[2025-06-02 21:35:48] [INFO ] [Nat]Absence check using state equation in 4204 ms returned unknown
[2025-06-02 21:35:48] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2025-06-02 21:35:49] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 478 ms returned sat
[2025-06-02 21:35:50] [INFO ] [Real]Absence check using state equation in 1508 ms returned sat
[2025-06-02 21:35:51] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 42 ms.
[2025-06-02 21:35:52] [INFO ] Added : 92 causal constraints over 19 iterations in 1515 ms. Result :sat
Minimization took 842 ms.
[2025-06-02 21:35:53] [INFO ] [Real]Absence check using 4 positive place invariants in 36 ms returned sat
[2025-06-02 21:35:54] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 432 ms returned sat
[2025-06-02 21:35:55] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2025-06-02 21:35:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 28 ms returned sat
[2025-06-02 21:35:56] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 490 ms returned sat
[2025-06-02 21:35:58] [INFO ] [Nat]Absence check using state equation in 2143 ms returned unknown
[2025-06-02 21:35:59] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2025-06-02 21:35:59] [INFO ] [Real]Absence check using 4 positive and 2549 generalized place invariants in 429 ms returned sat
[2025-06-02 21:36:01] [INFO ] [Real]Absence check using state equation in 1718 ms returned sat
[2025-06-02 21:36:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 27 ms returned sat
[2025-06-02 21:36:02] [INFO ] [Nat]Absence check using 4 positive and 2549 generalized place invariants in 425 ms returned sat
[2025-06-02 21:36:04] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2025-06-02 21:36:04] [INFO ] Deduced a trap composed of 9 places in 475 ms of which 62 ms to minimize.
[2025-06-02 21:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 606 ms
[2025-06-02 21:36:04] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
Maximisation of solution failed !
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 29, 1, +inf, 29, +inf, 1, 16, 841, 1, 29, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 29, 1, +inf, 29, +inf, 1, 16, 841, 1, 29, +inf]
Support contains 1860 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2967 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.17 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 148 rules applied. Total rules applied 149 place count 2938 transition count 327
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 149 place count 2938 transition count 298
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 57 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 1 with 115 rules applied. Total rules applied 264 place count 2852 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 264 place count 2852 transition count 297
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 267 place count 2850 transition count 297
Applied a total of 267 rules in 263 ms. Remains 2850 /2998 variables (removed 148) and now considering 297/446 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 2850/2998 places, 297/446 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 297 rows 2850 cols
[2025-06-02 21:36:07] [INFO ] Computed 2553 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[29, 29, 1, +inf, 29, +inf, 1, 16, 841, 1, 29, +inf]
RANDOM walk for 811333 steps (20073 resets) in 30001 ms. (27 steps per ms)
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7649184 steps (10881 resets) in 34344 ms. (222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 29, 0, 21, 0, 0, 0, 0, 609] Max Struct:[29, +inf, 29, +inf, 16, 841, 1, 29, +inf]
[2025-06-02 21:37:11] [INFO ] Invariant cache hit.
[2025-06-02 21:37:12] [INFO ] [Real]Absence check using 1 positive place invariants in 40 ms returned sat
[2025-06-02 21:37:12] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 622 ms returned sat
[2025-06-02 21:37:13] [INFO ] [Real]Absence check using state equation in 966 ms returned sat
[2025-06-02 21:37:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 32 ms returned sat
[2025-06-02 21:37:14] [INFO ] [Nat]Absence check using 1 positive and 2552 generalized place invariants in 549 ms returned sat
[2025-06-02 21:37:15] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2025-06-02 21:37:15] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 28 ms.
[2025-06-02 21:37:17] [INFO ] Added : 118 causal constraints over 24 iterations in 1586 ms. Result :sat
Minimization took 4048 ms.
[2025-06-02 21:37:21] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2025-06-02 21:37:22] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 477 ms returned sat
[2025-06-02 21:37:23] [INFO ] [Real]Absence check using state equation in 963 ms returned unsat
[2025-06-02 21:37:23] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2025-06-02 21:37:24] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 607 ms returned sat
[2025-06-02 21:37:24] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2025-06-02 21:37:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:37:25] [INFO ] [Nat]Absence check using 1 positive and 2552 generalized place invariants in 613 ms returned sat
[2025-06-02 21:37:28] [INFO ] [Nat]Absence check using state equation in 2481 ms returned sat
[2025-06-02 21:37:28] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 27 ms.
[2025-06-02 21:37:29] [INFO ] Added : 89 causal constraints over 18 iterations in 1268 ms. Result :sat
Minimization took 3887 ms.
[2025-06-02 21:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2025-06-02 21:37:34] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 511 ms returned sat
[2025-06-02 21:37:35] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2025-06-02 21:37:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2025-06-02 21:37:36] [INFO ] [Nat]Absence check using 1 positive and 2552 generalized place invariants in 533 ms returned sat
[2025-06-02 21:37:36] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2025-06-02 21:37:36] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 23 ms.
[2025-06-02 21:37:37] [INFO ] Added : 60 causal constraints over 12 iterations in 798 ms. Result :sat
Minimization took 3927 ms.
[2025-06-02 21:37:41] [INFO ] [Real]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:37:42] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 588 ms returned sat
[2025-06-02 21:37:43] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2025-06-02 21:37:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:37:44] [INFO ] [Nat]Absence check using 1 positive and 2552 generalized place invariants in 577 ms returned sat
[2025-06-02 21:37:45] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2025-06-02 21:37:45] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 23 ms.
[2025-06-02 21:37:46] [INFO ] Added : 105 causal constraints over 21 iterations in 1407 ms. Result :sat
Minimization took 3897 ms.
[2025-06-02 21:37:51] [INFO ] [Real]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:37:51] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 601 ms returned sat
[2025-06-02 21:37:55] [INFO ] [Real]Absence check using state equation in 3661 ms returned sat
[2025-06-02 21:37:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:37:56] [INFO ] [Nat]Absence check using 1 positive and 2552 generalized place invariants in 621 ms returned sat
[2025-06-02 21:38:00] [INFO ] [Nat]Absence check using state equation in 4190 ms returned sat
[2025-06-02 21:38:00] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 20 ms.
[2025-06-02 21:38:02] [INFO ] Added : 117 causal constraints over 24 iterations in 1565 ms. Result :sat
Minimization took 3862 ms.
[2025-06-02 21:38:06] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2025-06-02 21:38:06] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 476 ms returned sat
[2025-06-02 21:38:07] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2025-06-02 21:38:07] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 25 ms.
[2025-06-02 21:38:08] [INFO ] Added : 60 causal constraints over 12 iterations in 852 ms. Result :sat
Minimization took 5260 ms.
[2025-06-02 21:38:14] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2025-06-02 21:38:14] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 514 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using state equation in 2315 ms returned sat
[2025-06-02 21:38:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 1 positive and 2552 generalized place invariants in 511 ms returned sat
[2025-06-02 21:38:21] [INFO ] [Nat]Absence check using state equation in 4152 ms returned sat
[2025-06-02 21:38:21] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 22 ms.
[2025-06-02 21:38:23] [INFO ] Added : 102 causal constraints over 21 iterations in 1414 ms. Result :sat
Minimization took 3834 ms.
[2025-06-02 21:38:27] [INFO ] [Real]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:38:28] [INFO ] [Real]Absence check using 1 positive and 2552 generalized place invariants in 637 ms returned sat
[2025-06-02 21:38:30] [INFO ] [Real]Absence check using state equation in 2245 ms returned sat
[2025-06-02 21:38:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 25 ms returned sat
[2025-06-02 21:38:31] [INFO ] [Nat]Absence check using 1 positive and 2552 generalized place invariants in 653 ms returned sat
[2025-06-02 21:38:33] [INFO ] [Nat]Absence check using state equation in 2386 ms returned sat
[2025-06-02 21:38:33] [INFO ] Computed and/alt/rep : 207/236/207 causal constraints (skipped 89 transitions) in 24 ms.
[2025-06-02 21:38:35] [INFO ] Added : 84 causal constraints over 17 iterations in 1152 ms. Result :sat
Minimization took 3956 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 29, 0, 21, 0, 0, 0, 0, 609] Max Struct:[29, 29, 29, +inf, 16, 841, 1, 29, +inf]
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-12 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-10 841 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-05 29 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-09 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[29, 29, 0, 841] Max Struct:[29, +inf, 1, +inf]
Support contains 900 out of 2850 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2850/2850 places, 297/297 transitions.
Graph (complete) has 29876 edges and 2850 vertex of which 2848 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 2819 transition count 177
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 181 place count 2788 transition count 177
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 181 place count 2788 transition count 148
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 29 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 268 place count 2730 transition count 148
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 269 place count 2730 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 2729 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 2728 transition count 146
Applied a total of 271 rules in 385 ms. Remains 2728 /2850 variables (removed 122) and now considering 146/297 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2728/2850 places, 146/297 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 146 rows 2728 cols
[2025-06-02 21:38:44] [INFO ] Computed 2582 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[29, 29, 0, 841] Max Struct:[29, 29, 1, 841]
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-14 841 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-00 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (6802 resets) in 18104 ms. (55 steps per ms)
FORMULA QuasiCertifProtocol-COL-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 577401 steps (228 resets) in 5001 ms. (115 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:39:08] [INFO ] Flatten gal took : 206 ms
[2025-06-02 21:39:08] [INFO ] Flatten gal took : 124 ms
[2025-06-02 21:39:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3723524063509945038.gal : 36 ms
[2025-06-02 21:39:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9025982541200627840.prop : 1 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/ReachabilityCardinality3723524063509945038.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9025982541200627840.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 259221 ms.

BK_STOP 1748900348636

--------------------
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-28"
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-28, 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-174881266200096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 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 ;