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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 107K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 666K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 13 03:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 76K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 121K Apr 13 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 795K Apr 13 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 33K 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 749K 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-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716773287894

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-28
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 01:28:09] [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 01:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 01:28:09] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-27 01:28:09] [INFO ] Transformed 2998 places.
[2024-05-27 01:28:09] [INFO ] Transformed 446 transitions.
[2024-05-27 01:28:09] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 446 rows 2998 cols
[2024-05-27 01:28:09] [INFO ] Computed 2553 invariants in 126 ms
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 304 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 15) seen :3
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :1
[2024-05-27 01:28:10] [INFO ] Invariant cache hit.
[2024-05-27 01:28:10] [INFO ] [Real]Absence check using 32 positive place invariants in 68 ms returned sat
[2024-05-27 01:28:11] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 520 ms returned sat
[2024-05-27 01:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:12] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2024-05-27 01:28:12] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 42 ms.
[2024-05-27 01:28:14] [INFO ] Added : 135 causal constraints over 27 iterations in 2329 ms. Result :sat
Minimization took 500 ms.
[2024-05-27 01:28:15] [INFO ] [Real]Absence check using 32 positive place invariants in 63 ms returned sat
[2024-05-27 01:28:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 603 ms returned sat
[2024-05-27 01:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:20] [INFO ] [Real]Absence check using state equation in 4095 ms returned unknown
[2024-05-27 01:28:20] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-05-27 01:28:21] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 549 ms returned sat
[2024-05-27 01:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:22] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2024-05-27 01:28:22] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2024-05-27 01:28:24] [INFO ] Added : 122 causal constraints over 25 iterations in 2030 ms. Result :sat
Minimization took 415 ms.
[2024-05-27 01:28:25] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2024-05-27 01:28:26] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 521 ms returned sat
[2024-05-27 01:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:29] [INFO ] [Real]Absence check using state equation in 3876 ms returned sat
[2024-05-27 01:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:28:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 57 ms returned sat
[2024-05-27 01:28:30] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 554 ms returned sat
[2024-05-27 01:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:35] [INFO ] [Nat]Absence check using state equation in 4108 ms returned unknown
[2024-05-27 01:28:35] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-05-27 01:28:35] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 555 ms returned sat
[2024-05-27 01:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:37] [INFO ] [Real]Absence check using state equation in 1475 ms returned sat
[2024-05-27 01:28:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:28:37] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2024-05-27 01:28:38] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 545 ms returned sat
[2024-05-27 01:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:39] [INFO ] [Nat]Absence check using state equation in 1548 ms returned sat
[2024-05-27 01:28:40] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2024-05-27 01:28:40] [INFO ] Added : 59 causal constraints over 12 iterations in 919 ms. Result :sat
Minimization took 201 ms.
[2024-05-27 01:28:41] [INFO ] [Real]Absence check using 32 positive place invariants in 47 ms returned sat
[2024-05-27 01:28:42] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 504 ms returned sat
[2024-05-27 01:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:44] [INFO ] [Real]Absence check using state equation in 2009 ms returned sat
[2024-05-27 01:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:28:44] [INFO ] [Nat]Absence check using 32 positive place invariants in 48 ms returned sat
[2024-05-27 01:28:44] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 511 ms returned sat
[2024-05-27 01:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:47] [INFO ] [Nat]Absence check using state equation in 2198 ms returned sat
[2024-05-27 01:28:47] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2024-05-27 01:28:48] [INFO ] Added : 75 causal constraints over 15 iterations in 1101 ms. Result :sat
Minimization took 494 ms.
[2024-05-27 01:28:49] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-05-27 01:28:49] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 540 ms returned sat
[2024-05-27 01:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:50] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2024-05-27 01:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:28:51] [INFO ] [Nat]Absence check using 32 positive place invariants in 47 ms returned sat
[2024-05-27 01:28:51] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2024-05-27 01:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:52] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2024-05-27 01:28:52] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2024-05-27 01:28:54] [INFO ] Added : 126 causal constraints over 26 iterations in 1864 ms. Result :sat
Minimization took 239 ms.
[2024-05-27 01:28:55] [INFO ] [Real]Absence check using 32 positive place invariants in 47 ms returned sat
[2024-05-27 01:28:55] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 517 ms returned sat
[2024-05-27 01:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:55] [INFO ] [Real]Absence check using state equation in 95 ms returned unsat
[2024-05-27 01:28:55] [INFO ] [Real]Absence check using 32 positive place invariants in 46 ms returned sat
[2024-05-27 01:28:56] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 516 ms returned sat
[2024-05-27 01:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:28:57] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2024-05-27 01:28:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:28:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 47 ms returned sat
[2024-05-27 01:28:58] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 505 ms returned sat
[2024-05-27 01:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:00] [INFO ] [Nat]Absence check using state equation in 1401 ms returned sat
[2024-05-27 01:29:00] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 33 ms.
[2024-05-27 01:29:01] [INFO ] Added : 59 causal constraints over 12 iterations in 881 ms. Result :sat
Minimization took 203 ms.
[2024-05-27 01:29:01] [INFO ] [Real]Absence check using 32 positive place invariants in 45 ms returned sat
[2024-05-27 01:29:02] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 501 ms returned sat
[2024-05-27 01:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:03] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2024-05-27 01:29:03] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2024-05-27 01:29:05] [INFO ] Added : 135 causal constraints over 27 iterations in 2052 ms. Result :sat
Minimization took 237 ms.
[2024-05-27 01:29:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:29:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 47 ms returned sat
[2024-05-27 01:29:06] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2024-05-27 01:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:07] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2024-05-27 01:29:07] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2024-05-27 01:29:09] [INFO ] Added : 135 causal constraints over 27 iterations in 1861 ms. Result :sat
Minimization took 198 ms.
[2024-05-27 01:29:09] [INFO ] [Real]Absence check using 32 positive place invariants in 46 ms returned sat
[2024-05-27 01:29:10] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 526 ms returned sat
[2024-05-27 01:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:11] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2024-05-27 01:29:11] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2024-05-27 01:29:13] [INFO ] Added : 122 causal constraints over 25 iterations in 2023 ms. Result :sat
Minimization took 250 ms.
[2024-05-27 01:29:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:29:14] [INFO ] [Nat]Absence check using 32 positive place invariants in 51 ms returned sat
[2024-05-27 01:29:14] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 557 ms returned sat
[2024-05-27 01:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:15] [INFO ] [Nat]Absence check using state equation in 1034 ms returned sat
[2024-05-27 01:29:16] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2024-05-27 01:29:18] [INFO ] Added : 135 causal constraints over 27 iterations in 1984 ms. Result :sat
Minimization took 227 ms.
[2024-05-27 01:29:18] [INFO ] [Real]Absence check using 32 positive place invariants in 46 ms returned sat
[2024-05-27 01:29:19] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 515 ms returned sat
[2024-05-27 01:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:20] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2024-05-27 01:29:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:29:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 51 ms returned sat
[2024-05-27 01:29:20] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 553 ms returned sat
[2024-05-27 01:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:22] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2024-05-27 01:29:22] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2024-05-27 01:29:24] [INFO ] Added : 134 causal constraints over 27 iterations in 2003 ms. Result :sat
Minimization took 212 ms.
[2024-05-27 01:29:24] [INFO ] [Real]Absence check using 32 positive place invariants in 45 ms returned sat
[2024-05-27 01:29:25] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 506 ms returned sat
[2024-05-27 01:29:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:26] [INFO ] [Real]Absence check using state equation in 1388 ms returned sat
[2024-05-27 01:29:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:29:26] [INFO ] [Nat]Absence check using 32 positive place invariants in 52 ms returned sat
[2024-05-27 01:29:27] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 548 ms returned sat
[2024-05-27 01:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:29:28] [INFO ] [Nat]Absence check using state equation in 1511 ms returned sat
[2024-05-27 01:29:29] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 29 ms.
[2024-05-27 01:29:29] [INFO ] Added : 59 causal constraints over 12 iterations in 927 ms. Result :sat
Minimization took 209 ms.
Current structural bounds on expressions (after SMT) : [841, -1, 841, 841, 1, -1, 29, 1, -1, -1, 29, -1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 960 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2095 are kept as prefixes of interest. Removing 903 places using SCC suffix rule.14 ms
Discarding 903 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 178 rules applied. Total rules applied 179 place count 2066 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 2065 transition count 267
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 180 place count 2065 transition count 237
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 57 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 297 place count 1978 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 297 place count 1978 transition count 236
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 2 with 3 rules applied. Total rules applied 300 place count 1976 transition count 236
Applied a total of 300 rules in 249 ms. Remains 1976 /2998 variables (removed 1022) and now considering 236/446 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 1976/2998 places, 236/446 transitions.
// Phase 1: matrix 236 rows 1976 cols
[2024-05-27 01:29:33] [INFO ] Computed 1740 invariants in 15 ms
Incomplete random walk after 1000000 steps, including 13513 resets, run finished after 24976 ms. (steps per millisecond=40 ) properties (out of 10) seen :429
Incomplete Best-First random walk after 1000001 steps, including 798 resets, run finished after 3261 ms. (steps per millisecond=306 ) properties (out of 10) seen :428
Interrupted Best-First random walk after 383415 steps, including 315 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 427
Incomplete Best-First random walk after 1000001 steps, including 798 resets, run finished after 3101 ms. (steps per millisecond=322 ) properties (out of 10) seen :428
Incomplete Best-First random walk after 1000001 steps, including 448 resets, run finished after 3733 ms. (steps per millisecond=267 ) properties (out of 10) seen :697
Incomplete Best-First random walk after 1000001 steps, including 669 resets, run finished after 2881 ms. (steps per millisecond=347 ) properties (out of 10) seen :436
Incomplete Best-First random walk after 1000001 steps, including 797 resets, run finished after 2753 ms. (steps per millisecond=363 ) properties (out of 10) seen :427
Incomplete Best-First random walk after 1000001 steps, including 806 resets, run finished after 2772 ms. (steps per millisecond=360 ) properties (out of 10) seen :426
Incomplete Best-First random walk after 1000001 steps, including 798 resets, run finished after 2776 ms. (steps per millisecond=360 ) properties (out of 10) seen :430
Incomplete Best-First random walk after 1000001 steps, including 799 resets, run finished after 2707 ms. (steps per millisecond=369 ) properties (out of 10) seen :428
Incomplete Best-First random walk after 1000001 steps, including 798 resets, run finished after 2631 ms. (steps per millisecond=380 ) properties (out of 10) seen :429
[2024-05-27 01:30:30] [INFO ] Invariant cache hit.
[2024-05-27 01:30:30] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 331 ms returned sat
[2024-05-27 01:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:30:42] [INFO ] [Real]Absence check using state equation in 11426 ms returned sat
[2024-05-27 01:30:42] [INFO ] Computed and/alt/rep : 175/204/175 causal constraints (skipped 60 transitions) in 19 ms.
[2024-05-27 01:30:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 01:30:42] [INFO ] [Nat]Absence check using 0 positive and 1740 generalized place invariants in 325 ms returned sat
[2024-05-27 01:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 01:30:49] [INFO ] [Nat]Absence check using state equation in 6294 ms returned sat
[2024-05-27 01:30:49] [INFO ] Computed and/alt/rep : 175/204/175 causal constraints (skipped 60 transitions) in 18 ms.
[2024-05-27 01:30:50] [INFO ] Added : 115 causal constraints over 23 iterations in 1032 ms. Result :sat
Minimization took 1213 ms.
[2024-05-27 01:30:59] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 8306 ms returned sat
[2024-05-27 01:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:26] [INFO ] [Real]Absence check using state equation in 26245 ms returned unsat
[2024-05-27 01:31:26] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 335 ms returned sat
[2024-05-27 01:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:35] [INFO ] [Real]Absence check using state equation in 8845 ms returned unsat
[2024-05-27 01:31:36] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 337 ms returned sat
[2024-05-27 01:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:37] [INFO ] [Real]Absence check using state equation in 1401 ms returned unsat
[2024-05-27 01:31:38] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 363 ms returned sat
[2024-05-27 01:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:38] [INFO ] [Real]Absence check using state equation in 263 ms returned unsat
[2024-05-27 01:31:38] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 351 ms returned sat
[2024-05-27 01:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:41] [INFO ] [Real]Absence check using state equation in 2927 ms returned unsat
[2024-05-27 01:31:42] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 342 ms returned sat
[2024-05-27 01:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:42] [INFO ] [Real]Absence check using state equation in 258 ms returned unsat
[2024-05-27 01:31:43] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 339 ms returned sat
[2024-05-27 01:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:43] [INFO ] [Real]Absence check using state equation in 371 ms returned unsat
[2024-05-27 01:31:43] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 356 ms returned sat
[2024-05-27 01:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:47] [INFO ] [Real]Absence check using state equation in 3691 ms returned unsat
[2024-05-27 01:31:48] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 346 ms returned sat
[2024-05-27 01:31:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 01:31:53] [INFO ] [Real]Absence check using state equation in 5187 ms returned unsat
Current structural bounds on expressions (after SMT) : [841, 841, 29, 29, 29, 1, 1, 1, 1, 1] Max seen :[13, 841, 29, 29, 29, 1, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 841 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 29 out of 1976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1976/1976 places, 236/236 transitions.
Graph (complete) has 28074 edges and 1976 vertex of which 1945 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.3 ms
Discarding 31 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 1916 transition count 147
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 146 place count 1887 transition count 147
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 146 place count 1887 transition count 89
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 291 place count 1800 transition count 89
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 292 place count 1800 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 293 place count 1799 transition count 88
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 812 places
Reduce places removed 841 places and 0 transitions.
Iterating global reduction 4 with 870 rules applied. Total rules applied 1163 place count 958 transition count 59
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1164 place count 957 transition count 58
Ensure Unique test removed 29 places
Iterating post reduction 4 with 29 rules applied. Total rules applied 1193 place count 928 transition count 58
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 5 with 29 rules applied. Total rules applied 1222 place count 899 transition count 29
Ensure Unique test removed 841 places
Iterating post reduction 5 with 841 rules applied. Total rules applied 2063 place count 58 transition count 29
Applied a total of 2063 rules in 246 ms. Remains 58 /1976 variables (removed 1918) and now considering 29/236 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 58/1976 places, 29/236 transitions.
// Phase 1: matrix 29 rows 58 cols
[2024-05-27 01:31:53] [INFO ] Computed 29 invariants in 0 ms
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 33333 resets, run finished after 1271 ms. (steps per millisecond=786 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 225781 ms.

BK_STOP 1716773516133

--------------------
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-28"
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-28, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361500061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.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 ;