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-167905985000087.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-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r437-tajo-167905985000087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 8.5K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 14K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:23 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 498K 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 1679517023196

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-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 20:30:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-22 20:30:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:30:25] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-22 20:30:25] [INFO ] Transformed 1603 places.
[2023-03-22 20:30:25] [INFO ] Transformed 1803 transitions.
[2023-03-22 20:30:25] [INFO ] Found NUPN structural information;
[2023-03-22 20:30:25] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 202 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1603 transition count 1642
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1442 transition count 1642
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1442 transition count 1442
Deduced a syphon composed of 200 places in 22 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 1242 transition count 1442
Performed 640 Post agglomeration using F-continuation condition.Transition count delta: 640
Deduced a syphon composed of 640 places in 5 ms
Reduce places removed 640 places and 0 transitions.
Iterating global reduction 2 with 1280 rules applied. Total rules applied 2002 place count 602 transition count 802
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2002 rules in 382 ms. Remains 602 /1603 variables (removed 1001) and now considering 802/1803 (removed 1001) transitions.
// Phase 1: matrix 802 rows 602 cols
[2023-03-22 20:30:25] [INFO ] Computed 161 place invariants in 15 ms
[2023-03-22 20:30:25] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-22 20:30:25] [INFO ] Invariant cache hit.
[2023-03-22 20:30:26] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2023-03-22 20:30:26] [INFO ] Invariant cache hit.
[2023-03-22 20:30:26] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 602/1603 places, 802/1803 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1837 ms. Remains : 602/1603 places, 802/1803 transitions.
Discarding 240 transitions out of 802. Remains 562
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 689 ms. (steps per millisecond=14 ) properties (out of 561) seen :518
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) 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 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) 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 42) 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 42) 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 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) 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 41) 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 41) 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 41) 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 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 40) 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 40) 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 40) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) 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 40) seen :0
Running SMT prover for 40 properties.
[2023-03-22 20:30:27] [INFO ] Invariant cache hit.
[2023-03-22 20:30:28] [INFO ] [Real]Absence check using 161 positive place invariants in 22 ms returned sat
[2023-03-22 20:30:30] [INFO ] After 2381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:40
[2023-03-22 20:30:30] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2023-03-22 20:30:32] [INFO ] After 1679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :40
[2023-03-22 20:30:32] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 11 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 2 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2023-03-22 20:30:33] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1646 ms
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-22 20:30:34] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-22 20:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-22 20:30:35] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2023-03-22 20:30:36] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 3 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-22 20:30:37] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2920 ms
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2023-03-22 20:30:38] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2023-03-22 20:30:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1067 ms
[2023-03-22 20:30:39] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-03-22 20:30:40] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1359 ms
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2023-03-22 20:30:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-22 20:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-22 20:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-22 20:30:43] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 286 ms
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2023-03-22 20:30:44] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-22 20:30:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1019 ms
[2023-03-22 20:30:45] [INFO ] After 14560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :40
Attempting to minimize the solution found.
Minimization took 1619 ms.
[2023-03-22 20:30:47] [INFO ] After 16930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :40
Parikh walk visited 8 properties in 7744 ms.
Support contains 90 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 802/802 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 562 transition count 762
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 562 transition count 762
Partial Free-agglomeration rule applied 57 times.
Drop transitions removed 57 transitions
Iterating global reduction 0 with 57 rules applied. Total rules applied 137 place count 562 transition count 762
Applied a total of 137 rules in 109 ms. Remains 562 /602 variables (removed 40) and now considering 762/802 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 562/602 places, 762/802 transitions.
Finished random walk after 23437 steps, including 48 resets, run visited all 32 properties in 612 ms. (steps per millisecond=38 )
Able to resolve query QuasiLiveness after proving 562 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 30958 ms.
ITS solved all properties within timeout

BK_STOP 1679517055943

--------------------
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-040B"
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-040B, 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-167905985000087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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