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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K 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 503K 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-22-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716769744963

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-22
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 00:29:06] [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:29:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:29:06] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-27 00:29:06] [INFO ] Transformed 1966 places.
[2024-05-27 00:29:06] [INFO ] Transformed 356 transitions.
[2024-05-27 00:29:06] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 356 rows 1966 cols
[2024-05-27 00:29:06] [INFO ] Computed 1611 invariants in 112 ms
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-08 13 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 371 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 15) seen :50
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-14 13 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :34
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :33
[2024-05-27 00:29:07] [INFO ] Invariant cache hit.
[2024-05-27 00:29:07] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned unsat
[2024-05-27 00:29:07] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned unsat
[2024-05-27 00:29:08] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-27 00:29:08] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 318 ms returned sat
[2024-05-27 00:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:09] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2024-05-27 00:29:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 26 ms returned sat
[2024-05-27 00:29:09] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 284 ms returned sat
[2024-05-27 00:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:10] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-05-27 00:29:10] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 32 ms.
[2024-05-27 00:29:11] [INFO ] Added : 96 causal constraints over 20 iterations in 1244 ms. Result :sat
Minimization took 328 ms.
[2024-05-27 00:29:12] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2024-05-27 00:29:12] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 317 ms returned sat
[2024-05-27 00:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:13] [INFO ] [Real]Absence check using state equation in 1015 ms returned sat
[2024-05-27 00:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-27 00:29:14] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 347 ms returned sat
[2024-05-27 00:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:15] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2024-05-27 00:29:15] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 32 ms.
[2024-05-27 00:29:16] [INFO ] Added : 95 causal constraints over 19 iterations in 1044 ms. Result :sat
Minimization took 164 ms.
[2024-05-27 00:29:16] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-27 00:29:17] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 299 ms returned sat
[2024-05-27 00:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:17] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2024-05-27 00:29:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-27 00:29:18] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 295 ms returned sat
[2024-05-27 00:29:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:18] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2024-05-27 00:29:18] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
[2024-05-27 00:29:19] [INFO ] Added : 66 causal constraints over 14 iterations in 795 ms. Result :sat
Minimization took 106 ms.
[2024-05-27 00:29:20] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-27 00:29:20] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 296 ms returned sat
[2024-05-27 00:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:20] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2024-05-27 00:29:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-27 00:29:21] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 295 ms returned sat
[2024-05-27 00:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:22] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2024-05-27 00:29:22] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 28 ms.
[2024-05-27 00:29:23] [INFO ] Added : 109 causal constraints over 22 iterations in 1203 ms. Result :sat
Minimization took 438 ms.
[2024-05-27 00:29:23] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-05-27 00:29:24] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 260 ms returned sat
[2024-05-27 00:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:25] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2024-05-27 00:29:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-05-27 00:29:25] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 261 ms returned sat
[2024-05-27 00:29:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:26] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2024-05-27 00:29:26] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2024-05-27 00:29:26] [INFO ] Added : 47 causal constraints over 10 iterations in 568 ms. Result :sat
Minimization took 109 ms.
[2024-05-27 00:29:27] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2024-05-27 00:29:27] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 284 ms returned sat
[2024-05-27 00:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:27] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2024-05-27 00:29:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-27 00:29:28] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 304 ms returned sat
[2024-05-27 00:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:29] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2024-05-27 00:29:29] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 28 ms.
[2024-05-27 00:29:29] [INFO ] Added : 65 causal constraints over 13 iterations in 750 ms. Result :sat
Minimization took 112 ms.
[2024-05-27 00:29:30] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-27 00:29:30] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 298 ms returned sat
[2024-05-27 00:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:31] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2024-05-27 00:29:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-27 00:29:32] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 294 ms returned sat
[2024-05-27 00:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:33] [INFO ] [Nat]Absence check using state equation in 1138 ms returned sat
[2024-05-27 00:29:33] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 31 ms.
[2024-05-27 00:29:34] [INFO ] Added : 95 causal constraints over 19 iterations in 980 ms. Result :sat
Minimization took 112 ms.
[2024-05-27 00:29:34] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-27 00:29:35] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 287 ms returned sat
[2024-05-27 00:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:35] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2024-05-27 00:29:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-27 00:29:36] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 308 ms returned sat
[2024-05-27 00:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:36] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-05-27 00:29:36] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 39 ms.
[2024-05-27 00:29:37] [INFO ] Added : 73 causal constraints over 15 iterations in 832 ms. Result :sat
Minimization took 107 ms.
[2024-05-27 00:29:37] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-27 00:29:38] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 285 ms returned sat
[2024-05-27 00:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:39] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2024-05-27 00:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:29:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2024-05-27 00:29:39] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 291 ms returned sat
[2024-05-27 00:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:40] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2024-05-27 00:29:40] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 24 ms.
[2024-05-27 00:29:41] [INFO ] Added : 96 causal constraints over 20 iterations in 1040 ms. Result :sat
Minimization took 113 ms.
[2024-05-27 00:29:42] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-27 00:29:42] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 300 ms returned sat
[2024-05-27 00:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:29:42] [INFO ] [Real]Absence check using state equation in 499 ms returned unsat
Current structural bounds on expressions (after SMT) : [23, 23, 13, 12167, 1, 529, 1, 23, -1, 23, -1, 1] Max seen :[23, 23, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-01 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-03 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 556 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 1892 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.9 ms
Discarding 74 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 208 rules applied. Total rules applied 209 place count 1846 transition count 192
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 232 place count 1823 transition count 192
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 232 place count 1823 transition count 145
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 68 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 394 place count 1708 transition count 145
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 395 place count 1708 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 396 place count 1707 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 396 place count 1707 transition count 143
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 4 with 3 rules applied. Total rules applied 399 place count 1705 transition count 143
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 460 places
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 4 with 502 rules applied. Total rules applied 901 place count 1224 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 902 place count 1223 transition count 121
Ensure Unique test removed 23 places
Iterating post reduction 4 with 23 rules applied. Total rules applied 925 place count 1200 transition count 121
Applied a total of 925 rules in 393 ms. Remains 1200 /1966 variables (removed 766) and now considering 121/356 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 1200/1966 places, 121/356 transitions.
// Phase 1: matrix 121 rows 1200 cols
[2024-05-27 00:29:44] [INFO ] Computed 1079 invariants in 16 ms
Incomplete random walk after 1000000 steps, including 25747 resets, run finished after 29446 ms. (steps per millisecond=33 ) properties (out of 6) seen :458
Finished Best-First random walk after 220763 steps, including 473 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=44 )
Finished Best-First random walk after 931603 steps, including 1133 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=186 )
Finished Best-First random walk after 699735 steps, including 1253 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=139 )
Finished Best-First random walk after 736042 steps, including 1304 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=147 )
Finished Best-First random walk after 734301 steps, including 1203 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=146 )
Finished Best-First random walk after 716117 steps, including 1270 resets, run visited all 6 properties in 5001 ms. (steps per millisecond=143 )
[2024-05-27 00:30:44] [INFO ] Invariant cache hit.
[2024-05-27 00:30:44] [INFO ] [Real]Absence check using 0 positive and 1079 generalized place invariants in 233 ms returned sat
[2024-05-27 00:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:30:49] [INFO ] [Real]Absence check using state equation in 5070 ms returned unsat
[2024-05-27 00:30:50] [INFO ] [Real]Absence check using 0 positive and 1079 generalized place invariants in 185 ms returned sat
[2024-05-27 00:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:30:50] [INFO ] [Real]Absence check using state equation in 324 ms returned unsat
[2024-05-27 00:30:50] [INFO ] [Real]Absence check using 0 positive and 1079 generalized place invariants in 184 ms returned sat
[2024-05-27 00:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:30:51] [INFO ] [Real]Absence check using state equation in 453 ms returned unsat
[2024-05-27 00:30:51] [INFO ] [Real]Absence check using 0 positive and 1079 generalized place invariants in 187 ms returned sat
[2024-05-27 00:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:30:51] [INFO ] [Real]Absence check using state equation in 456 ms returned unsat
[2024-05-27 00:30:52] [INFO ] [Real]Absence check using 0 positive and 1079 generalized place invariants in 192 ms returned sat
[2024-05-27 00:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:30:52] [INFO ] [Real]Absence check using state equation in 159 ms returned unsat
[2024-05-27 00:30:52] [INFO ] [Real]Absence check using 0 positive and 1079 generalized place invariants in 188 ms returned sat
[2024-05-27 00:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:30:52] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
Current structural bounds on expressions (after SMT) : [529, 23, 1, 1, 1, 1] Max seen :[529, 23, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-04 529 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 106420 ms.

BK_STOP 1716769853880

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

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