Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r021-oct2-167813608900278.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is AutoFlight-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-167813608900278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 113K Mar 5 18:22 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 StableMarking

=== Now, execution of the tool begins

BK_START 1678932181927

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-05b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 02:03:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 02:03:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:03:04] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-16 02:03:04] [INFO ] Transformed 482 places.
[2023-03-16 02:03:04] [INFO ] Transformed 480 transitions.
[2023-03-16 02:03:04] [INFO ] Found NUPN structural information;
[2023-03-16 02:03:04] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 138 ms.
Structural test allowed to assert that 286 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 196) seen :91
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 105) seen :0
Running SMT prover for 105 properties.
// Phase 1: matrix 480 rows 482 cols
[2023-03-16 02:03:04] [INFO ] Computed 34 place invariants in 12 ms
[2023-03-16 02:03:06] [INFO ] After 2189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:105
[2023-03-16 02:03:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 44 ms returned sat
[2023-03-16 02:03:08] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 35 ms returned sat
[2023-03-16 02:03:12] [INFO ] After 2847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :105
[2023-03-16 02:03:12] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 24 ms to minimize.
[2023-03-16 02:03:13] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2023-03-16 02:03:13] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2023-03-16 02:03:13] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 13 ms to minimize.
[2023-03-16 02:03:13] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2023-03-16 02:03:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 728 ms
[2023-03-16 02:03:13] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 1 ms to minimize.
[2023-03-16 02:03:13] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 0 ms to minimize.
[2023-03-16 02:03:13] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2023-03-16 02:03:14] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 10 ms to minimize.
[2023-03-16 02:03:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 645 ms
[2023-03-16 02:03:14] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 1 ms to minimize.
[2023-03-16 02:03:14] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 0 ms to minimize.
[2023-03-16 02:03:14] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 0 ms to minimize.
[2023-03-16 02:03:14] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 0 ms to minimize.
[2023-03-16 02:03:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 628 ms
[2023-03-16 02:03:15] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 1 ms to minimize.
[2023-03-16 02:03:15] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2023-03-16 02:03:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-03-16 02:03:16] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 1 ms to minimize.
[2023-03-16 02:03:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-16 02:03:16] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 0 ms to minimize.
[2023-03-16 02:03:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-16 02:03:16] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 0 ms to minimize.
[2023-03-16 02:03:16] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2023-03-16 02:03:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2023-03-16 02:03:16] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 1 ms to minimize.
[2023-03-16 02:03:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-16 02:03:17] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 0 ms to minimize.
[2023-03-16 02:03:17] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 0 ms to minimize.
[2023-03-16 02:03:17] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2023-03-16 02:03:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2023-03-16 02:03:17] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2023-03-16 02:03:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-16 02:03:17] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 0 ms to minimize.
[2023-03-16 02:03:18] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 0 ms to minimize.
[2023-03-16 02:03:18] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2023-03-16 02:03:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 428 ms
[2023-03-16 02:03:18] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-03-16 02:03:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-16 02:03:18] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 1 ms to minimize.
[2023-03-16 02:03:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-16 02:03:18] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2023-03-16 02:03:18] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 0 ms to minimize.
[2023-03-16 02:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-16 02:03:19] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2023-03-16 02:03:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-16 02:03:19] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2023-03-16 02:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-16 02:03:20] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 1 ms to minimize.
[2023-03-16 02:03:20] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 0 ms to minimize.
[2023-03-16 02:03:20] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2023-03-16 02:03:20] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2023-03-16 02:03:20] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 0 ms to minimize.
[2023-03-16 02:03:20] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2023-03-16 02:03:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 760 ms
[2023-03-16 02:03:21] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 1 ms to minimize.
[2023-03-16 02:03:21] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 0 ms to minimize.
[2023-03-16 02:03:21] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 0 ms to minimize.
[2023-03-16 02:03:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2023-03-16 02:03:21] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 0 ms to minimize.
[2023-03-16 02:03:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-16 02:03:22] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 1 ms to minimize.
[2023-03-16 02:03:22] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 1 ms to minimize.
[2023-03-16 02:03:22] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2023-03-16 02:03:22] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 0 ms to minimize.
[2023-03-16 02:03:22] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 0 ms to minimize.
[2023-03-16 02:03:22] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2023-03-16 02:03:22] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2023-03-16 02:03:23] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2023-03-16 02:03:23] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 0 ms to minimize.
[2023-03-16 02:03:23] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2023-03-16 02:03:23] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 1 ms to minimize.
[2023-03-16 02:03:23] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 0 ms to minimize.
[2023-03-16 02:03:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1421 ms
[2023-03-16 02:03:23] [INFO ] After 13836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :105
Attempting to minimize the solution found.
Minimization took 2320 ms.
[2023-03-16 02:03:25] [INFO ] After 19047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :105
Parikh walk visited 73 properties in 9569 ms.
Support contains 32 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 482 transition count 305
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 208 rules applied. Total rules applied 383 place count 307 transition count 272
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 393 place count 297 transition count 272
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 393 place count 297 transition count 217
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 503 place count 242 transition count 217
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 537 place count 208 transition count 183
Iterating global reduction 3 with 34 rules applied. Total rules applied 571 place count 208 transition count 183
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 571 place count 208 transition count 168
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 601 place count 193 transition count 168
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 693 place count 147 transition count 122
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 695 place count 147 transition count 120
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 715 place count 147 transition count 100
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 735 place count 127 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 736 place count 126 transition count 99
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 24 rules applied. Total rules applied 760 place count 112 transition count 89
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 770 place count 102 transition count 89
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 770 place count 102 transition count 74
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 800 place count 87 transition count 74
Applied a total of 800 rules in 81 ms. Remains 87 /482 variables (removed 395) and now considering 74/480 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 87/482 places, 74/480 transitions.
Finished random walk after 91 steps, including 0 resets, run visited all 32 properties in 6 ms. (steps per millisecond=15 )
Able to resolve query StableMarking after proving 197 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 31648 ms.
ITS solved all properties within timeout

BK_STOP 1678932215738

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="AutoFlight-PT-05b"
export BK_EXAMINATION="StableMarking"
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 AutoFlight-PT-05b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-167813608900278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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