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.r391-oct2-167903715400503.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 ShieldPPPs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.2K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 02:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 02:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 02:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 447K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679276966524

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:49:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:49:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:49:29] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-20 01:49:29] [INFO ] Transformed 1553 places.
[2023-03-20 01:49:29] [INFO ] Transformed 1303 transitions.
[2023-03-20 01:49:29] [INFO ] Found NUPN structural information;
[2023-03-20 01:49:29] [INFO ] Parsed PT model containing 1553 places and 1303 transitions and 5006 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 16) seen :11
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:49:30] [INFO ] Computed 551 place invariants in 27 ms
[2023-03-20 01:49:31] [INFO ] After 879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 01:49:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 197 ms returned sat
[2023-03-20 01:49:35] [INFO ] After 3356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 01:49:38] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 14 ms to minimize.
[2023-03-20 01:49:38] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2023-03-20 01:49:38] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 14 ms to minimize.
[2023-03-20 01:49:39] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 15 ms to minimize.
[2023-03-20 01:49:39] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2023-03-20 01:49:39] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 24 ms to minimize.
[2023-03-20 01:49:39] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2023-03-20 01:49:40] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-20 01:49:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2567 ms
[2023-03-20 01:49:42] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:49:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-20 01:49:42] [INFO ] After 10284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2683 ms.
[2023-03-20 01:49:45] [INFO ] After 13874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 798 ms.
Support contains 267 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Partial Free-agglomeration rule applied 321 times.
Drop transitions removed 321 transitions
Iterating global reduction 0 with 321 rules applied. Total rules applied 321 place count 1553 transition count 1303
Applied a total of 321 rules in 264 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 5) seen :2
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:49:47] [INFO ] Computed 551 place invariants in 61 ms
[2023-03-20 01:49:47] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:49:48] [INFO ] [Nat]Absence check using 537 positive place invariants in 211 ms returned sat
[2023-03-20 01:49:48] [INFO ] [Nat]Absence check using 537 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-20 01:49:51] [INFO ] After 3521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:49:55] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2023-03-20 01:49:55] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2023-03-20 01:49:56] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-20 01:49:56] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2023-03-20 01:49:56] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-20 01:49:57] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-03-20 01:49:57] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:49:57] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-20 01:49:57] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 14 ms to minimize.
[2023-03-20 01:49:58] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-20 01:49:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2770 ms
[2023-03-20 01:50:01] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2023-03-20 01:50:01] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-20 01:50:02] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-20 01:50:02] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-20 01:50:02] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 0 ms to minimize.
[2023-03-20 01:50:02] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-20 01:50:03] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-20 01:50:03] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2023-03-20 01:50:03] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-20 01:50:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2797 ms
[2023-03-20 01:50:04] [INFO ] After 16526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7825 ms.
[2023-03-20 01:50:12] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 339 ms.
Support contains 161 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1552 transition count 1302
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 32 place count 1552 transition count 1302
Applied a total of 32 rules in 315 ms. Remains 1552 /1553 variables (removed 1) and now considering 1302/1303 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 1552/1553 places, 1302/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-20 01:50:13] [INFO ] Computed 551 place invariants in 44 ms
[2023-03-20 01:50:14] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:50:14] [INFO ] [Nat]Absence check using 530 positive place invariants in 99 ms returned sat
[2023-03-20 01:50:14] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-20 01:50:19] [INFO ] After 5224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:50:20] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-03-20 01:50:20] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2023-03-20 01:50:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 695 ms
[2023-03-20 01:50:27] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:50:27] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 4 ms to minimize.
[2023-03-20 01:50:27] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:50:28] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-20 01:50:28] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-20 01:50:28] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-20 01:50:29] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 0 ms to minimize.
[2023-03-20 01:50:29] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 13 ms to minimize.
[2023-03-20 01:50:29] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
[2023-03-20 01:50:30] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:50:30] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-20 01:50:30] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-03-20 01:50:31] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-20 01:50:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4412 ms
[2023-03-20 01:50:31] [INFO ] After 16955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3294 ms.
[2023-03-20 01:50:34] [INFO ] After 20800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 244 ms.
Support contains 138 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 1552 transition count 1302
Applied a total of 18 rules in 105 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 114303 steps, run timeout after 3011 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 114303 steps, saw 105840 distinct states, run finished after 3014 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-20 01:50:38] [INFO ] Computed 551 place invariants in 16 ms
[2023-03-20 01:50:39] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:50:39] [INFO ] [Nat]Absence check using 525 positive place invariants in 96 ms returned sat
[2023-03-20 01:50:39] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-20 01:50:43] [INFO ] After 4193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:50:46] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-20 01:50:47] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2023-03-20 01:50:47] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2023-03-20 01:50:47] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2023-03-20 01:50:47] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-20 01:50:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1340 ms
[2023-03-20 01:50:53] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 1 ms to minimize.
[2023-03-20 01:50:53] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:50:53] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2023-03-20 01:50:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1444 ms
[2023-03-20 01:50:54] [INFO ] After 14851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9722 ms.
[2023-03-20 01:51:04] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 261 ms.
Support contains 138 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 57 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 47 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-20 01:51:04] [INFO ] Invariant cache hit.
[2023-03-20 01:51:05] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2023-03-20 01:51:05] [INFO ] Invariant cache hit.
[2023-03-20 01:51:08] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 3887 ms to find 0 implicit places.
[2023-03-20 01:51:08] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-20 01:51:08] [INFO ] Invariant cache hit.
[2023-03-20 01:51:09] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5142 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 42 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:51:09] [INFO ] Invariant cache hit.
[2023-03-20 01:51:10] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:51:10] [INFO ] [Nat]Absence check using 525 positive place invariants in 102 ms returned sat
[2023-03-20 01:51:10] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-20 01:51:13] [INFO ] After 3389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:51:24] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-20 01:51:24] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-20 01:51:25] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-20 01:51:25] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:51:25] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:51:25] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:51:26] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-20 01:51:26] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-20 01:51:27] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 0 ms to minimize.
[2023-03-20 01:51:27] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2023-03-20 01:51:27] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-20 01:51:28] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2023-03-20 01:51:28] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2023-03-20 01:51:29] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:51:29] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-20 01:51:29] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-20 01:51:29] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-20 01:51:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6172 ms
[2023-03-20 01:51:30] [INFO ] After 19679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1209 ms.
[2023-03-20 01:51:31] [INFO ] After 21396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:51:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 01:51:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1552 places, 1302 transitions and 6023 arcs took 11 ms.
[2023-03-20 01:51:31] [INFO ] Flatten gal took : 179 ms
Total runtime 122832 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-050A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityFireability

FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679277095995

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 3 ShieldPPPs-PT-050A-ReachabilityFireability-11
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 ShieldPPPs-PT-050A-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 ShieldPPPs-PT-050A-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 3 ShieldPPPs-PT-050A-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 6 (type FNDP) for ShieldPPPs-PT-050A-ReachabilityFireability-11
lola: result : true
lola: fired transitions : 125
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 7 (type EQUN) for ShieldPPPs-PT-050A-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 9 (type SRCH) for ShieldPPPs-PT-050A-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ShieldPPPs-PT-050A-ReachabilityFireability-11 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 0 ShieldPPPs-PT-050A-ReachabilityFireability-08
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 ShieldPPPs-PT-050A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 ShieldPPPs-PT-050A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 0 ShieldPPPs-PT-050A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for ShieldPPPs-PT-050A-ReachabilityFireability-08
lola: result : true
lola: markings : 136
lola: fired transitions : 135
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for ShieldPPPs-PT-050A-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldPPPs-PT-050A-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldPPPs-PT-050A-ReachabilityFireability-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-ReachabilityFireability-08: EF true tandem / insertion
ShieldPPPs-PT-050A-ReachabilityFireability-11: EF true findpath


Time elapsed: 3 secs. Pages in use: 3

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="ShieldPPPs-PT-050A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPs-PT-050A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715400503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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