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.r520-tall-171662337700069.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 ltsminxred
Input is QuasiCertifProtocol-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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 78K 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-06-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717219793187

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:29:54] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-01 05:29:54] [INFO ] Transformed 270 places.
[2024-06-01 05:29:54] [INFO ] Transformed 116 transitions.
[2024-06-01 05:29:54] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 7, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 7, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 116 rows 270 cols
[2024-06-01 05:29:54] [INFO ] Computed 155 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 7, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[49, +inf, 49, +inf, 1, 49, 3, +inf, 1, 7, 1, 7, +inf, 3, +inf]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (986 resets) in 46 ms. (212 steps per ms)
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130008 steps (2149 resets) in 174 ms. (742 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 7, 7, 0, 0, 0, 7, 0, 0, 0, 0, 1] Max Struct:[49, +inf, 49, +inf, 1, 49, +inf, 7, 7, +inf, 3, +inf]
[2024-06-01 05:29:54] [INFO ] Invariant cache hit.
[2024-06-01 05:29:54] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 05:29:55] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 40 ms returned sat
[2024-06-01 05:29:55] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 05:29:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 05:29:55] [INFO ] Added : 61 causal constraints over 13 iterations in 225 ms. Result :sat
Minimization took 279 ms.
[2024-06-01 05:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 05:29:55] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 46 ms returned sat
[2024-06-01 05:29:55] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2024-06-01 05:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2024-06-01 05:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:29:56] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2024-06-01 05:29:56] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 05:29:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:29:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:29:56] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 28 ms returned sat
[2024-06-01 05:29:56] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 05:29:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 05:29:56] [INFO ] Added : 19 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 164 ms.
[2024-06-01 05:29:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:29:56] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2024-06-01 05:29:56] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-01 05:29:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:29:56] [INFO ] Added : 41 causal constraints over 9 iterations in 135 ms. Result :sat
Minimization took 208 ms.
[2024-06-01 05:29:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:29:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:29:57] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2024-06-01 05:29:57] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 05:29:57] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:29:57] [INFO ] Added : 41 causal constraints over 9 iterations in 145 ms. Result :sat
Minimization took 120 ms.
[2024-06-01 05:29:57] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:29:57] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2024-06-01 05:29:57] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 05:29:57] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 05:29:57] [INFO ] Added : 23 causal constraints over 5 iterations in 86 ms. Result :sat
Minimization took 218 ms.
[2024-06-01 05:29:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 05:29:58] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2024-06-01 05:29:58] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
[2024-06-01 05:29:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 05:29:58] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2024-06-01 05:29:58] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 05:29:58] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:29:58] [INFO ] Added : 29 causal constraints over 6 iterations in 88 ms. Result :sat
Minimization took 203 ms.
[2024-06-01 05:29:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:29:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 05:29:58] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 23 ms returned sat
[2024-06-01 05:29:58] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-01 05:29:58] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:29:58] [INFO ] Added : 29 causal constraints over 6 iterations in 84 ms. Result :sat
Minimization took 138 ms.
[2024-06-01 05:29:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 05:29:59] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2024-06-01 05:29:59] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 05:29:59] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:29:59] [INFO ] Added : 52 causal constraints over 11 iterations in 151 ms. Result :sat
Minimization took 268 ms.
[2024-06-01 05:29:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:29:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:29:59] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 28 ms returned sat
[2024-06-01 05:29:59] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 05:29:59] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:29:59] [INFO ] Added : 52 causal constraints over 11 iterations in 133 ms. Result :sat
Minimization took 160 ms.
[2024-06-01 05:30:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:30:00] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2024-06-01 05:30:00] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 05:30:00] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:30:00] [INFO ] Added : 24 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 211 ms.
[2024-06-01 05:30:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:30:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 05:30:00] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 18 ms returned sat
[2024-06-01 05:30:00] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 05:30:00] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:30:00] [INFO ] Added : 24 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 119 ms.
[2024-06-01 05:30:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:30:00] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2024-06-01 05:30:01] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 05:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:30:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 05:30:01] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2024-06-01 05:30:01] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-01 05:30:01] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:30:01] [INFO ] Added : 42 causal constraints over 9 iterations in 106 ms. Result :sat
Minimization took 138 ms.
[2024-06-01 05:30:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 05:30:01] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 43 ms returned sat
[2024-06-01 05:30:01] [INFO ] [Real]Absence check using state equation in 66 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 7, 7, 0, 0, 0, 7, 0, 0, 0, 0, 1] Max Struct:[49, 7, 7, +inf, 1, 49, 7, 7, 7, +inf, 3, 1]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 7, 7, 1, 1, 1] Max Struct:[49, +inf, 49, 7, 7, +inf]
Support contains 24 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 259 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 245 transition count 69
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 8 rules applied. Total rules applied 70 place count 244 transition count 62
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 77 place count 237 transition count 62
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 77 place count 237 transition count 55
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 104 place count 217 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 104 place count 217 transition count 54
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 3 with 3 rules applied. Total rules applied 107 place count 215 transition count 54
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 122 place count 205 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 204 transition count 48
Applied a total of 123 rules in 82 ms. Remains 204 /270 variables (removed 66) and now considering 48/116 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 204/270 places, 48/116 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 48 rows 204 cols
[2024-06-01 05:30:01] [INFO ] Computed 156 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 7, 7, 1, 1, 1] Max Struct:[7, 13, 49, 7, 3, +inf]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (33713 resets) in 2251 ms. (444 steps per ms)
BEST_FIRST walk for 5000005 steps (28410 resets) in 5054 ms. (989 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 1, 1, 1] Max Struct:[13, 49, 7, 3, +inf]
[2024-06-01 05:30:09] [INFO ] Invariant cache hit.
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive and 148 generalized place invariants in 22 ms returned unsat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive and 148 generalized place invariants in 25 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive and 148 generalized place invariants in 23 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive and 148 generalized place invariants in 19 ms returned unsat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using 8 positive and 148 generalized place invariants in 21 ms returned sat
[2024-06-01 05:30:09] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 1, 1, 1] Max Struct:[7, 7, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15444 ms.
ITS solved all properties within timeout

BK_STOP 1717219809760

--------------------
content from stderr:

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-PT-06, 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 r520-tall-171662337700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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