Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r437-tajo-167905985000072.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVs-PT-030A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r437-tajo-167905985000072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 191K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679517020871

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=lolaxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-030A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 20:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 20:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:30:22] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-22 20:30:22] [INFO ] Transformed 423 places.
[2023-03-22 20:30:22] [INFO ] Transformed 573 transitions.
[2023-03-22 20:30:22] [INFO ] Found NUPN structural information;
[2023-03-22 20:30:22] [INFO ] Parsed PT model containing 423 places and 573 transitions and 2760 arcs in 138 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 42 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 422 cols
[2023-03-22 20:30:22] [INFO ] Computed 121 place invariants in 19 ms
[2023-03-22 20:30:23] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-22 20:30:23] [INFO ] Invariant cache hit.
[2023-03-22 20:30:23] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2023-03-22 20:30:23] [INFO ] Invariant cache hit.
[2023-03-22 20:30:23] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 422/423 places, 572/573 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1215 ms. Remains : 422/423 places, 572/573 transitions.
Discarding 180 transitions out of 572. Remains 392
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 391) seen :363
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-22 20:30:24] [INFO ] Invariant cache hit.
[2023-03-22 20:30:24] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-22 20:30:25] [INFO ] After 1191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-22 20:30:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-22 20:30:26] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-22 20:30:27] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 8 ms to minimize.
[2023-03-22 20:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-22 20:30:27] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-22 20:30:27] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2023-03-22 20:30:27] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2023-03-22 20:30:27] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-22 20:30:27] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-22 20:30:28] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2023-03-22 20:30:28] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-22 20:30:28] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 20:30:28] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-22 20:30:28] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-22 20:30:28] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2023-03-22 20:30:28] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2023-03-22 20:30:29] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2023-03-22 20:30:30] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-22 20:30:31] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2023-03-22 20:30:32] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:30:32] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-22 20:30:32] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-22 20:30:32] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:30:32] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-22 20:30:32] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 6 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Trap strengthening procedure interrupted after too many repetitions 14726 ms
[2023-03-22 20:30:41] [INFO ] Trap strengthening (SAT) tested/added 113/112 trap constraints in 14727 ms
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 743 ms
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 443 ms
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 269 ms
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-22 20:30:46] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2893 ms
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 432 ms
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:30:47] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-22 20:30:48] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-22 20:30:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2023-03-22 20:30:48] [INFO ] After 21909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 972 ms.
[2023-03-22 20:30:49] [INFO ] After 23236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Parikh walk visited 0 properties in 3230 ms.
Support contains 79 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 422 transition count 572
Applied a total of 46 rules in 83 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 422/422 places, 572/572 transitions.
Finished random walk after 18786 steps, including 51 resets, run visited all 27 properties in 263 ms. (steps per millisecond=71 )
Able to resolve query QuasiLiveness after proving 392 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 30303 ms.
ITS solved all properties within timeout

BK_STOP 1679517052847

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -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="ShieldRVs-PT-030A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldRVs-PT-030A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r437-tajo-167905985000072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030A.tgz
mv ShieldRVs-PT-030A execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;