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.r103-tall-167814478300462.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 83K 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

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

=== Now, execution of the tool begins

BK_START 1678253057785

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:24:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 05:24:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:24:19] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-08 05:24:19] [INFO ] Transformed 274 places.
[2023-03-08 05:24:19] [INFO ] Transformed 231 transitions.
[2023-03-08 05:24:19] [INFO ] Found NUPN structural information;
[2023-03-08 05:24:19] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 230 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 14) seen :2
FORMULA DES-PT-40a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 05:24:20] [INFO ] Computed 59 place invariants in 22 ms
[2023-03-08 05:24:20] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 05:24:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:24:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 125 ms returned sat
[2023-03-08 05:24:24] [INFO ] After 3278ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-08 05:24:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 05:24:28] [INFO ] After 3464ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :10
[2023-03-08 05:24:29] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 3 ms to minimize.
[2023-03-08 05:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-08 05:24:29] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-08 05:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-08 05:24:29] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2023-03-08 05:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 05:24:31] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2023-03-08 05:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 05:24:31] [INFO ] After 6284ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 3782 ms.
[2023-03-08 05:24:34] [INFO ] After 13871ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
FORMULA DES-PT-40a-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-40a-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 558 ms.
Support contains 112 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 274 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 274 transition count 216
Applied a total of 3 rules in 43 ms. Remains 274 /274 variables (removed 0) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 274/274 places, 216/217 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 831374 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{}
Probabilistic random walk after 831374 steps, saw 115136 distinct states, run finished after 3002 ms. (steps per millisecond=276 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 05:24:39] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 05:24:39] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 05:24:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:24:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 82 ms returned sat
[2023-03-08 05:24:41] [INFO ] After 2105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 05:24:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:24:43] [INFO ] After 1514ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-08 05:24:43] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-08 05:24:43] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-08 05:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-08 05:24:44] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-08 05:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 05:24:44] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-08 05:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-08 05:24:45] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-08 05:24:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 05:24:45] [INFO ] After 3767ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1521 ms.
[2023-03-08 05:24:46] [INFO ] After 7839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
FORMULA DES-PT-40a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 299 ms.
Support contains 73 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 216/216 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 274 transition count 216
Applied a total of 1 rules in 21 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 274/274 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 1029634 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1029634 steps, saw 137860 distinct states, run finished after 3002 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 05:24:50] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:24:50] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2023-03-08 05:24:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:24:50] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 05:24:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:24:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 49 ms returned sat
[2023-03-08 05:24:51] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 05:24:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:24:53] [INFO ] After 1286ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 05:24:54] [INFO ] After 2506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 686 ms.
[2023-03-08 05:24:55] [INFO ] After 4283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA DES-PT-40a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 187 ms.
Support contains 67 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 274/274 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 05:24:55] [INFO ] Invariant cache hit.
[2023-03-08 05:24:55] [INFO ] Implicit Places using invariants in 179 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 273/274 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 200 ms. Remains : 273/274 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1122677 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :{}
Probabilistic random walk after 1122677 steps, saw 150857 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 216 rows 273 cols
[2023-03-08 05:24:58] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-08 05:24:58] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:24:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 05:24:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 89 ms returned sat
[2023-03-08 05:25:03] [INFO ] After 4382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:25:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:25:07] [INFO ] After 3442ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:25:07] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-08 05:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-08 05:25:10] [INFO ] After 6875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3164 ms.
[2023-03-08 05:25:13] [INFO ] After 14828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 207 ms.
Support contains 67 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 273/273 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 05:25:13] [INFO ] Invariant cache hit.
[2023-03-08 05:25:14] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-08 05:25:14] [INFO ] Invariant cache hit.
[2023-03-08 05:25:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:25:14] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-08 05:25:14] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 05:25:14] [INFO ] Invariant cache hit.
[2023-03-08 05:25:14] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 273/273 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 273 /273 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-08 05:25:14] [INFO ] Invariant cache hit.
[2023-03-08 05:25:14] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:25:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 05:25:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:25:15] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:25:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-08 05:25:16] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-08 05:25:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2023-03-08 05:25:16] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-03-08 05:25:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-08 05:25:16] [INFO ] After 1884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 780 ms.
[2023-03-08 05:25:17] [INFO ] After 2833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:25:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-08 05:25:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 216 transitions and 1066 arcs took 1 ms.
[2023-03-08 05:25:17] [INFO ] Flatten gal took : 49 ms
Total runtime 58675 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40a
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityCardinality

FORMULA DES-PT-40a-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678253119372

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type EXCL) for 3 DES-PT-40a-ReachabilityCardinality-08
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 DES-PT-40a-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 DES-PT-40a-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 16 (type SRCH) for 3 DES-PT-40a-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 16 (type SRCH) for DES-PT-40a-ReachabilityCardinality-08
lola: result : true
lola: markings : 1135
lola: fired transitions : 1134
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for DES-PT-40a-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 14 (type EQUN) for DES-PT-40a-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 17 (type EXCL) for DES-PT-40a-ReachabilityCardinality-08 (obsolete)
lola: LAUNCH task # 24 (type EXCL) for 9 DES-PT-40a-ReachabilityCardinality-14
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 20 (type FNDP) for 9 DES-PT-40a-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type EQUN) for 9 DES-PT-40a-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type SRCH) for 9 DES-PT-40a-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 23 (type SRCH) for DES-PT-40a-ReachabilityCardinality-14
lola: result : true
lola: markings : 1724
lola: fired transitions : 1781
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 20 (type FNDP) for DES-PT-40a-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 21 (type EQUN) for DES-PT-40a-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 24 (type EXCL) for DES-PT-40a-ReachabilityCardinality-14 (obsolete)
lola: LAUNCH task # 31 (type EXCL) for 6 DES-PT-40a-ReachabilityCardinality-11
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 34 (type FNDP) for 0 DES-PT-40a-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 0 DES-PT-40a-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 37 (type SRCH) for 0 DES-PT-40a-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 13 (type FNDP) for DES-PT-40a-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 1606
lola: tried executions : 6
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 37 (type SRCH) for DES-PT-40a-ReachabilityCardinality-07
lola: result : true
lola: markings : 1172
lola: fired transitions : 1171
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 34 (type FNDP) for DES-PT-40a-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 35 (type EQUN) for DES-PT-40a-ReachabilityCardinality-07 (obsolete)
lola: LAUNCH task # 27 (type FNDP) for 6 DES-PT-40a-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 6 DES-PT-40a-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 6 DES-PT-40a-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 34 (type FNDP) for DES-PT-40a-ReachabilityCardinality-07
lola: result : true
lola: fired transitions : 1890
lola: tried executions : 8
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/375/ReachabilityCardinality-21.sara.
sara: try reading problem file /home/mcc/execution/375/ReachabilityCardinality-35.sara.
sara: try reading problem file /home/mcc/execution/375/ReachabilityCardinality-28.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 30 (type SRCH) for DES-PT-40a-ReachabilityCardinality-11
lola: result : true
lola: markings : 29711
lola: fired transitions : 35307
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 27 (type FNDP) for DES-PT-40a-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 28 (type EQUN) for DES-PT-40a-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 31 (type EXCL) for DES-PT-40a-ReachabilityCardinality-11 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40a-ReachabilityCardinality-07: AG false tandem / insertion
DES-PT-40a-ReachabilityCardinality-08: AG false tandem / insertion
DES-PT-40a-ReachabilityCardinality-11: AG false tandem / insertion
DES-PT-40a-ReachabilityCardinality-14: AG false tandem / insertion


Time elapsed: 0 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="DES-PT-40a"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-40a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478300462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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