Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361400046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is QuasiCertifProtocol-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 03:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 54K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 429K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 13 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 149K May 18 16:43 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

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

=== Now, execution of the tool begins

BK_START 1716769593921

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 00:26:35] [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]
[2024-05-27 00:26:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:26:35] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-27 00:26:35] [INFO ] Transformed 550 places.
[2024-05-27 00:26:35] [INFO ] Transformed 176 transitions.
[2024-05-27 00:26:35] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 176 rows 550 cols
[2024-05-27 00:26:35] [INFO ] Computed 375 invariants in 42 ms
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 692 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 15) seen :32
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :31
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :30
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :47
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :30
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :30
[2024-05-27 00:26:36] [INFO ] Invariant cache hit.
[2024-05-27 00:26:36] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-27 00:26:36] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 56 ms returned sat
[2024-05-27 00:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:36] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-27 00:26:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-27 00:26:36] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2024-05-27 00:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:37] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2024-05-27 00:26:37] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 26 ms.
[2024-05-27 00:26:37] [INFO ] Added : 46 causal constraints over 10 iterations in 301 ms. Result :sat
Minimization took 114 ms.
[2024-05-27 00:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-27 00:26:37] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2024-05-27 00:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:37] [INFO ] [Real]Absence check using state equation in 103 ms returned unsat
[2024-05-27 00:26:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2024-05-27 00:26:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:38] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 66 ms returned sat
[2024-05-27 00:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:38] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-27 00:26:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:38] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 45 ms returned sat
[2024-05-27 00:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:38] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-27 00:26:38] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 20 ms.
[2024-05-27 00:26:38] [INFO ] Added : 52 causal constraints over 11 iterations in 248 ms. Result :sat
Minimization took 86 ms.
[2024-05-27 00:26:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-27 00:26:39] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 49 ms returned sat
[2024-05-27 00:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:39] [INFO ] [Real]Absence check using state equation in 119 ms returned unsat
[2024-05-27 00:26:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2024-05-27 00:26:39] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-27 00:26:39] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 59 ms returned sat
[2024-05-27 00:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:39] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-27 00:26:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:39] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2024-05-27 00:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:39] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-27 00:26:39] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2024-05-27 00:26:39] [INFO ] Added : 48 causal constraints over 10 iterations in 209 ms. Result :sat
Minimization took 59 ms.
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-27 00:26:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:40] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-27 00:26:40] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2024-05-27 00:26:40] [INFO ] Added : 25 causal constraints over 5 iterations in 125 ms. Result :sat
Minimization took 46 ms.
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 52 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2024-05-27 00:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:41] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-27 00:26:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:41] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 56 ms returned sat
[2024-05-27 00:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:41] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-27 00:26:41] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2024-05-27 00:26:41] [INFO ] Added : 29 causal constraints over 6 iterations in 141 ms. Result :sat
Minimization took 40 ms.
[2024-05-27 00:26:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:41] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2024-05-27 00:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:41] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-27 00:26:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-27 00:26:41] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 55 ms returned sat
[2024-05-27 00:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:42] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-27 00:26:42] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2024-05-27 00:26:42] [INFO ] Added : 47 causal constraints over 10 iterations in 217 ms. Result :sat
Minimization took 65 ms.
[2024-05-27 00:26:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:42] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 49 ms returned sat
[2024-05-27 00:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:42] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2024-05-27 00:26:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:42] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 55 ms returned sat
[2024-05-27 00:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:42] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-27 00:26:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:26:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-27 00:26:42] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 51 ms returned sat
[2024-05-27 00:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:26:43] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-27 00:26:43] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2024-05-27 00:26:43] [INFO ] Added : 52 causal constraints over 11 iterations in 214 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1, 11, 11, 121, 11, 11, 121, -1, 1, -1, 6, 1, -1] Max seen :[0, 11, 11, 0, 11, 11, 0, 0, 1, 0, 0, 1, 0]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 155 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 403 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.3 ms
Discarding 147 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 381 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 380 transition count 93
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 96 place count 380 transition count 70
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 32 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 174 place count 325 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 174 place count 325 transition count 68
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 179 place count 322 transition count 68
Applied a total of 179 rules in 67 ms. Remains 322 /550 variables (removed 228) and now considering 68/176 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 322/550 places, 68/176 transitions.
// Phase 1: matrix 68 rows 322 cols
[2024-05-27 00:26:43] [INFO ] Computed 254 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 17241 resets, run finished after 7637 ms. (steps per millisecond=130 ) properties (out of 6) seen :154
Incomplete Best-First random walk after 1000001 steps, including 2160 resets, run finished after 4119 ms. (steps per millisecond=242 ) properties (out of 6) seen :153
Incomplete Best-First random walk after 1000001 steps, including 1678 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 6) seen :155
Incomplete Best-First random walk after 1000001 steps, including 2319 resets, run finished after 2436 ms. (steps per millisecond=410 ) properties (out of 6) seen :146
Incomplete Best-First random walk after 1000001 steps, including 2186 resets, run finished after 2347 ms. (steps per millisecond=426 ) properties (out of 6) seen :153
Incomplete Best-First random walk after 1000001 steps, including 1936 resets, run finished after 2061 ms. (steps per millisecond=485 ) properties (out of 6) seen :154
Incomplete Best-First random walk after 1000001 steps, including 2074 resets, run finished after 2073 ms. (steps per millisecond=482 ) properties (out of 6) seen :154
[2024-05-27 00:27:06] [INFO ] Invariant cache hit.
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using 0 positive and 254 generalized place invariants in 72 ms returned sat
[2024-05-27 00:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using state equation in 114 ms returned unsat
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using 0 positive and 254 generalized place invariants in 38 ms returned sat
[2024-05-27 00:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using 0 positive and 254 generalized place invariants in 36 ms returned sat
[2024-05-27 00:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using 0 positive and 254 generalized place invariants in 42 ms returned sat
[2024-05-27 00:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using 0 positive and 254 generalized place invariants in 37 ms returned sat
[2024-05-27 00:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using 0 positive and 254 generalized place invariants in 38 ms returned sat
[2024-05-27 00:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:06] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
Current structural bounds on expressions (after SMT) : [121, 11, 11, 11, 1, 1] Max seen :[121, 11, 11, 11, 1, 1]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-00 121 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31637 ms.

BK_STOP 1716769628015

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-10, 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 r329-tall-171662361400046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;