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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K 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 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 58K 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-PT-02-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748900294135

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:38:15] [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:38:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:38:15] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-02 21:38:15] [INFO ] Transformed 86 places.
[2025-06-02 21:38:15] [INFO ] Transformed 56 transitions.
[2025-06-02 21:38:15] [INFO ] Found NUPN structural information;
[2025-06-02 21:38:15] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 3, 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, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 3, 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, +inf]
// Phase 1: matrix 56 rows 86 cols
[2025-06-02 21:38:15] [INFO ] Computed 31 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 9, +inf, 1, 9, +inf, 9, 27, 3, +inf, 1, +inf, 1, 3, +inf, 1]
RANDOM walk for 10000 steps (1641 resets) in 41 ms. (238 steps per ms)
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150011 steps (8225 resets) in 161 ms. (925 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 3, 3, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, 9, +inf, 9, +inf, 9, 27, 3, +inf, 1, +inf, 1, 3, +inf, 1]
[2025-06-02 21:38:15] [INFO ] Invariant cache hit.
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 21:38:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-02 21:38:16] [INFO ] Added : 20 causal constraints over 4 iterations in 149 ms. Result :sat
Minimization took 29 ms.
[2025-06-02 21:38:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-02 21:38:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-02 21:38:16] [INFO ] Added : 20 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 23 ms.
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 14 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 21:38:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 21:38:16] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:38:16] [INFO ] Added : 23 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned unsat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 21:38:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:38:17] [INFO ] Added : 15 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 21:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 21:38:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:38:17] [INFO ] Added : 24 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 21:38:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:38:17] [INFO ] Added : 24 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 21:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 21:38:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-02 21:38:17] [INFO ] Added : 24 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 21:38:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:38:17] [INFO ] Added : 24 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 21:38:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 21:38:17] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:38:17] [INFO ] Added : 24 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 21:38:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 21:38:18] [INFO ] Added : 23 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 21:38:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 21:38:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:38:18] [INFO ] Added : 23 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 21:38:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:38:18] [INFO ] Added : 23 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 21:38:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:38:18] [INFO ] Added : 16 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 21:38:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 21:38:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:38:18] [INFO ] Added : 15 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 17 ms.
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 21:38:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 21:38:18] [INFO ] Added : 23 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 21:38:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 21:38:18] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 21:38:18] [INFO ] Added : 23 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 3, 3, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0] Max Struct:[3, 9, +inf, 3, 3, 9, 27, 3, 1, 1, 1, 1, 3, +inf, 1]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 9, 3, 9, 1, 1, 1] Max Struct:[9, +inf, 9, 27, 3, 3, +inf]
Support contains 27 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 73 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 67 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 66 transition count 35
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 27 place count 66 transition count 28
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 51 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 49 place count 51 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 48 transition count 26
Applied a total of 54 rules in 33 ms. Remains 48 /86 variables (removed 38) and now considering 26/56 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 48/86 places, 26/56 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 26 rows 48 cols
[2025-06-02 21:38:19] [INFO ] Computed 22 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 9, 3, 9, 1, 1, 1] Max Struct:[9, +inf, 9, 27, 1, 3, +inf]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (94077 resets) in 994 ms. (1005 steps per ms)
BEST_FIRST walk for 6000006 steps (173815 resets) in 2814 ms. (2131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 9, 3, 9, 1, 1] Max Struct:[9, +inf, 9, 27, 3, +inf]
[2025-06-02 21:38:22] [INFO ] Invariant cache hit.
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using 2 positive and 20 generalized place invariants in 3 ms returned sat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using 2 positive and 20 generalized place invariants in 3 ms returned sat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using 2 positive and 20 generalized place invariants in 7 ms returned sat
[2025-06-02 21:38:22] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using 2 positive and 20 generalized place invariants in 6 ms returned sat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using 2 positive and 20 generalized place invariants in 3 ms returned sat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using 2 positive and 20 generalized place invariants in 3 ms returned sat
[2025-06-02 21:38:23] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 9, 3, 9, 1, 1] Max Struct:[3, 9, 3, 9, 1, 1]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-07 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-02 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-01 3 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:38:23] [INFO ] Flatten gal took : 27 ms
[2025-06-02 21:38:23] [INFO ] Flatten gal took : 7 ms
[2025-06-02 21:38:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1542429482716317048.gal : 5 ms
[2025-06-02 21:38:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4135424273915842027.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/ReachabilityCardinality1542429482716317048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4135424273915842027.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 7984 ms.

BK_STOP 1748900303444

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-PT-02"
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-PT-02, 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-174881266200098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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