MCC'2025- Execution of r167-tall-174881266200095

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15692.100	186369.00	207241.00	477.90	529 23 23 13 1 23 1 13 23 23 23 23 529 1 13 23	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-174881266200095.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-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K 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 104K 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-22-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748899891222

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-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 21:31:32] [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:31:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:31:32] [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:31:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 21:31:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 576 ms
[2025-06-02 21:31:33] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-02 21:31:33] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2025-06-02 21:31:33] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2025-06-02 21:31:33] [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, 13, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[529, 23, 23, 13, 1, 23, 1, 13, +inf, +inf, 23, 23, +inf, 1, 13, 23]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-07 13 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 21:31:33] [INFO ] Invariant cache hit.
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 21:31:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-02 21:31:33] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:31:33] [INFO ] Added : 12 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 21:31:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 21:31:33] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:31:33] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:31:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 21:31:33] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:31:33] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:31:33] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:31:33] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:31:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:31:33] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:33] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 21:31:33] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:33] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:31:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:31:34] [INFO ] Added : 13 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:31:34] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:31:34] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 7 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 21:31:34] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:31:34] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 21:31:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-02 21:31:34] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 21:31:34] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 21:31:34] [INFO ] Added : 2 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:[529, 23, 23, 13, 1, 23, 1, +inf, +inf, 23, 23, +inf, 1, 13, 23]
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2025-06-02 21:31:34] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 27 ms.
[2025-06-02 21:31:34] [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:[529, 23, 23, 13, 1, 23, 1, +inf, +inf, 23, 23, +inf, 1, 13, 23]
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:[529, 23, 23, 13, 1, 23, 1, +inf, +inf, 23, 23, +inf, 1, 13, 23]
// Phase 1: matrix 356 rows 1966 cols
[2025-06-02 21:31:35] [INFO ] Computed 1611 invariants in 60 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:[529, 23, 23, 13, 1, 23, 1, +inf, +inf, 23, 23, +inf, 1, 13, 23]
RANDOM walk for 10000 steps (370 resets) in 270 ms. (36 steps per ms)
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-14 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (269 resets) in 449 ms. (266 steps per ms)
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-15 23 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[529, 23, 23, 13, 23, +inf, +inf, 23, 23, +inf, 1]
[2025-06-02 21:31:35] [INFO ] Invariant cache hit.
[2025-06-02 21:31:36] [INFO ] [Real]Absence check using 4 positive place invariants in 28 ms returned sat
[2025-06-02 21:31:36] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 258 ms returned sat
[2025-06-02 21:31:39] [INFO ] [Real]Absence check using state equation in 2858 ms returned sat
[2025-06-02 21:31:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2025-06-02 21:31:39] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 257 ms returned sat
[2025-06-02 21:31:41] [INFO ] [Nat]Absence check using state equation in 1823 ms returned sat
[2025-06-02 21:31:42] [INFO ] Deduced a trap composed of 6 places in 962 ms of which 93 ms to minimize.
[2025-06-02 21:31:43] [INFO ] Deduced a trap composed of 6 places in 884 ms of which 19 ms to minimize.
[2025-06-02 21:31:43] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 5 ms to minimize.
[2025-06-02 21:31:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2335 ms
[2025-06-02 21:31:43] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 23 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-02 21:31:44] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-02 21:31:44] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 247 ms returned sat
[2025-06-02 21:31:45] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2025-06-02 21:31:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:31:45] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 252 ms returned sat
[2025-06-02 21:31:46] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2025-06-02 21:31:46] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 28 ms.
[2025-06-02 21:31:47] [INFO ] Added : 87 causal constraints over 18 iterations in 949 ms. Result :sat
Minimization took 594 ms.
[2025-06-02 21:31:48] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-02 21:31:48] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 279 ms returned sat
[2025-06-02 21:31:49] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2025-06-02 21:31:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:31:49] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 276 ms returned sat
[2025-06-02 21:31:50] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2025-06-02 21:31:50] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 40 ms.
[2025-06-02 21:31:52] [INFO ] Added : 117 causal constraints over 24 iterations in 1317 ms. Result :sat
Minimization took 607 ms.
[2025-06-02 21:31:52] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:31:53] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 252 ms returned sat
[2025-06-02 21:31:53] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2025-06-02 21:31:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:31:54] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 254 ms returned sat
[2025-06-02 21:31:54] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2025-06-02 21:31:54] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 24 ms.
[2025-06-02 21:31:55] [INFO ] Added : 105 causal constraints over 21 iterations in 1077 ms. Result :sat
Minimization took 586 ms.
[2025-06-02 21:31:56] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned sat
[2025-06-02 21:31:56] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 261 ms returned sat
[2025-06-02 21:31:58] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2025-06-02 21:31:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:31:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-02 21:31:58] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 259 ms returned sat
[2025-06-02 21:31:59] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2025-06-02 21:31:59] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2025-06-02 21:32:00] [INFO ] Added : 87 causal constraints over 18 iterations in 921 ms. Result :sat
Minimization took 583 ms.
[2025-06-02 21:32:00] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:32:01] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 255 ms returned sat
[2025-06-02 21:32:02] [INFO ] [Real]Absence check using state equation in 930 ms returned sat
[2025-06-02 21:32:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-02 21:32:02] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 236 ms returned sat
[2025-06-02 21:32:03] [INFO ] [Nat]Absence check using state equation in 975 ms returned sat
[2025-06-02 21:32:03] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 27 ms.
[2025-06-02 21:32:03] [INFO ] Added : 27 causal constraints over 6 iterations in 374 ms. Result :sat
Minimization took 586 ms.
[2025-06-02 21:32:04] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-02 21:32:04] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 251 ms returned sat
[2025-06-02 21:32:05] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2025-06-02 21:32:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:32:06] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 251 ms returned sat
[2025-06-02 21:32:06] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2025-06-02 21:32:06] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 31 ms.
[2025-06-02 21:32:07] [INFO ] Added : 72 causal constraints over 15 iterations in 795 ms. Result :sat
Minimization took 589 ms.
[2025-06-02 21:32:08] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-02 21:32:08] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 253 ms returned sat
[2025-06-02 21:32:09] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2025-06-02 21:32:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:32:09] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 249 ms returned sat
[2025-06-02 21:32:11] [INFO ] [Nat]Absence check using state equation in 1351 ms returned sat
[2025-06-02 21:32:12] [INFO ] Deduced a trap composed of 10 places in 934 ms of which 13 ms to minimize.
[2025-06-02 21:32:12] [INFO ] Deduced a trap composed of 13 places in 879 ms of which 13 ms to minimize.
[2025-06-02 21:32:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1940 ms
[2025-06-02 21:32:13] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2025-06-02 21:32:13] [INFO ] Added : 47 causal constraints over 10 iterations in 546 ms. Result :sat
Minimization took 588 ms.
[2025-06-02 21:32:14] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2025-06-02 21:32:14] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 247 ms returned sat
[2025-06-02 21:32:15] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2025-06-02 21:32:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 18 ms returned sat
[2025-06-02 21:32:15] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 232 ms returned sat
[2025-06-02 21:32:16] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2025-06-02 21:32:16] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 22 ms.
[2025-06-02 21:32:17] [INFO ] Added : 94 causal constraints over 19 iterations in 965 ms. Result :sat
Minimization took 584 ms.
[2025-06-02 21:32:17] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2025-06-02 21:32:18] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 251 ms returned sat
[2025-06-02 21:32:18] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-06-02 21:32:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2025-06-02 21:32:19] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 237 ms returned sat
[2025-06-02 21:32:20] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2025-06-02 21:32:20] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 23 ms.
[2025-06-02 21:32:21] [INFO ] Added : 93 causal constraints over 19 iterations in 937 ms. Result :sat
Minimization took 587 ms.
[2025-06-02 21:32:22] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2025-06-02 21:32:22] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 233 ms returned sat
[2025-06-02 21:32:22] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2025-06-02 21:32:23] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 22 ms.
[2025-06-02 21:32:23] [INFO ] Added : 55 causal constraints over 11 iterations in 650 ms. Result :sat
Minimization took 673 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[529, 23, 23, 13, 23, +inf, +inf, 23, 23, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[529, 23, 23, 13, 23, +inf, +inf, 23, 23, +inf, 1]
Support contains 1221 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1940 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.11 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Discarding 23 places :
Implicit places reduction removed 23 places
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 1917 transition count 283
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 97 place count 1917 transition count 258
Deduced a syphon composed of 25 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 1 with 95 rules applied. Total rules applied 192 place count 1847 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 192 place count 1847 transition count 257
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 195 place count 1845 transition count 257
Applied a total of 195 rules in 175 ms. Remains 1845 /1966 variables (removed 121) and now considering 257/356 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 1845/1966 places, 257/356 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 257 rows 1845 cols
[2025-06-02 21:32:24] [INFO ] Computed 1588 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[529, 23, 23, 13, 23, +inf, +inf, 23, 23, +inf, 1]
RANDOM walk for 1000000 steps (16666 resets) in 19844 ms. (50 steps per ms)
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-10 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8582060 steps (10080 resets) in 27705 ms. (309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 13, 0, 0, 10, 23, 22, 0, 414] Max Struct:[529, 23, 23, 13, 23, +inf, +inf, 23, +inf]
[2025-06-02 21:33:12] [INFO ] Invariant cache hit.
[2025-06-02 21:33:12] [INFO ] [Real]Absence check using 530 positive place invariants in 101 ms returned sat
[2025-06-02 21:33:12] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 165 ms returned sat
[2025-06-02 21:33:14] [INFO ] [Real]Absence check using state equation in 1693 ms returned sat
[2025-06-02 21:33:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:14] [INFO ] [Nat]Absence check using 530 positive place invariants in 103 ms returned sat
[2025-06-02 21:33:15] [INFO ] [Nat]Absence check using 530 positive and 1058 generalized place invariants in 173 ms returned sat
[2025-06-02 21:33:17] [INFO ] [Nat]Absence check using state equation in 2609 ms returned sat
[2025-06-02 21:33:17] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 27 ms.
[2025-06-02 21:33:18] [INFO ] Added : 93 causal constraints over 19 iterations in 972 ms. Result :sat
Minimization took 1804 ms.
[2025-06-02 21:33:20] [INFO ] [Real]Absence check using 530 positive place invariants in 91 ms returned sat
[2025-06-02 21:33:20] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 153 ms returned sat
[2025-06-02 21:33:21] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2025-06-02 21:33:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:21] [INFO ] [Nat]Absence check using 530 positive place invariants in 87 ms returned sat
[2025-06-02 21:33:22] [INFO ] [Nat]Absence check using 530 positive and 1058 generalized place invariants in 161 ms returned sat
[2025-06-02 21:33:22] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2025-06-02 21:33:22] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 18 ms.
[2025-06-02 21:33:23] [INFO ] Added : 46 causal constraints over 10 iterations in 486 ms. Result :sat
Minimization took 1638 ms.
[2025-06-02 21:33:25] [INFO ] [Real]Absence check using 530 positive place invariants in 116 ms returned sat
[2025-06-02 21:33:25] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 206 ms returned sat
[2025-06-02 21:33:25] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2025-06-02 21:33:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:26] [INFO ] [Nat]Absence check using 530 positive place invariants in 155 ms returned sat
[2025-06-02 21:33:26] [INFO ] [Nat]Absence check using 530 positive and 1058 generalized place invariants in 211 ms returned sat
[2025-06-02 21:33:27] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2025-06-02 21:33:27] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 22 ms.
[2025-06-02 21:33:28] [INFO ] Added : 93 causal constraints over 19 iterations in 939 ms. Result :sat
Minimization took 1745 ms.
[2025-06-02 21:33:30] [INFO ] [Real]Absence check using 530 positive place invariants in 94 ms returned sat
[2025-06-02 21:33:30] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 173 ms returned sat
[2025-06-02 21:33:31] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2025-06-02 21:33:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:31] [INFO ] [Nat]Absence check using 530 positive place invariants in 100 ms returned sat
[2025-06-02 21:33:31] [INFO ] [Nat]Absence check using 530 positive and 1058 generalized place invariants in 180 ms returned sat
[2025-06-02 21:33:32] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2025-06-02 21:33:32] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 21 ms.
[2025-06-02 21:33:33] [INFO ] Added : 81 causal constraints over 17 iterations in 839 ms. Result :sat
Minimization took 1789 ms.
[2025-06-02 21:33:35] [INFO ] [Real]Absence check using 530 positive place invariants in 99 ms returned sat
[2025-06-02 21:33:35] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 173 ms returned sat
[2025-06-02 21:33:36] [INFO ] [Real]Absence check using state equation in 1196 ms returned sat
[2025-06-02 21:33:36] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 20 ms.
[2025-06-02 21:33:37] [INFO ] Added : 69 causal constraints over 14 iterations in 799 ms. Result :sat
Minimization took 1715 ms.
[2025-06-02 21:33:39] [INFO ] [Real]Absence check using 530 positive place invariants in 98 ms returned sat
[2025-06-02 21:33:39] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 183 ms returned sat
[2025-06-02 21:33:40] [INFO ] [Real]Absence check using state equation in 996 ms returned unsat
[2025-06-02 21:33:41] [INFO ] [Real]Absence check using 530 positive place invariants in 94 ms returned sat
[2025-06-02 21:33:41] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 176 ms returned sat
[2025-06-02 21:33:41] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2025-06-02 21:33:41] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 24 ms.
[2025-06-02 21:33:42] [INFO ] Added : 46 causal constraints over 10 iterations in 567 ms. Result :sat
Minimization took 1643 ms.
[2025-06-02 21:33:44] [INFO ] [Real]Absence check using 530 positive place invariants in 94 ms returned sat
[2025-06-02 21:33:44] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 181 ms returned sat
[2025-06-02 21:33:45] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2025-06-02 21:33:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:45] [INFO ] [Nat]Absence check using 530 positive place invariants in 97 ms returned sat
[2025-06-02 21:33:45] [INFO ] [Nat]Absence check using 530 positive and 1058 generalized place invariants in 179 ms returned sat
[2025-06-02 21:33:46] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2025-06-02 21:33:46] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 24 ms.
[2025-06-02 21:33:47] [INFO ] Added : 82 causal constraints over 17 iterations in 865 ms. Result :sat
Minimization took 1698 ms.
[2025-06-02 21:33:49] [INFO ] [Real]Absence check using 530 positive place invariants in 98 ms returned sat
[2025-06-02 21:33:49] [INFO ] [Real]Absence check using 530 positive and 1058 generalized place invariants in 199 ms returned sat
[2025-06-02 21:33:50] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2025-06-02 21:33:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:51] [INFO ] [Nat]Absence check using 530 positive place invariants in 99 ms returned sat
[2025-06-02 21:33:51] [INFO ] [Nat]Absence check using 530 positive and 1058 generalized place invariants in 186 ms returned sat
[2025-06-02 21:33:52] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2025-06-02 21:33:52] [INFO ] Computed and/alt/rep : 185/208/185 causal constraints (skipped 71 transitions) in 22 ms.
[2025-06-02 21:33:53] [INFO ] Added : 78 causal constraints over 16 iterations in 815 ms. Result :sat
Minimization took 1978 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 13, 0, 0, 10, 23, 22, 0, 414] Max Struct:[529, 23, 23, 13, 23, 23, +inf, 23, +inf]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-08 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-05 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-11 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-01 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-03 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-02 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-00 529 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[23, 529] Max Struct:[+inf, +inf]
Support contains 552 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 257/257 transitions.
Graph (complete) has 16195 edges and 1845 vertex of which 693 are kept as prefixes of interest. Removing 1152 places using SCC suffix rule.2 ms
Discarding 1152 places :
Also discarding 115 output transitions
Drop transitions (Output transitions of discarded places.) removed 115 transitions
Drop transitions (Empty/Sink Transition effects.) removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 23 places :
Implicit places reduction removed 23 places
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 670 transition count 95
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 71 place count 670 transition count 72
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 140 place count 624 transition count 72
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 1 with 1 rules applied. Total rules applied 141 place count 624 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 623 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 622 transition count 70
Applied a total of 143 rules in 42 ms. Remains 622 /1845 variables (removed 1223) and now considering 70/257 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 622/1845 places, 70/257 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 70 rows 622 cols
[2025-06-02 21:33:57] [INFO ] Computed 552 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[23, 529] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (14084 resets) in 28727 ms. (34 steps per ms)
BEST_FIRST walk for 1242726 steps (1097 resets) in 9766 ms. (127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[23, 529] Max Struct:[+inf, +inf]
[2025-06-02 21:34:36] [INFO ] Invariant cache hit.
[2025-06-02 21:34:36] [INFO ] [Real]Absence check using 0 positive and 552 generalized place invariants in 73 ms returned sat
[2025-06-02 21:34:36] [INFO ] [Real]Absence check using state equation in 92 ms returned unsat
[2025-06-02 21:34:36] [INFO ] [Real]Absence check using 0 positive and 552 generalized place invariants in 78 ms returned sat
[2025-06-02 21:34:37] [INFO ] [Real]Absence check using state equation in 350 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[23, 529] Max Struct:[23, 529]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-12 529 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-09 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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:34:37] [INFO ] Flatten gal took : 68 ms
[2025-06-02 21:34:37] [INFO ] Flatten gal took : 33 ms
[2025-06-02 21:34:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14038652582469171595.gal : 46 ms
[2025-06-02 21:34:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality141482973252474628.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/ReachabilityCardinality14038652582469171595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality141482973252474628.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 185037 ms.

BK_STOP 1748900077591

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

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