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.r519-tall-167987245000246.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 EisenbergMcGuire-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245000246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K Mar 31 16:48 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 EisenbergMcGuire-PT-06-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680818966879

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=EisenbergMcGuire-PT-06
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 22:09:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 22:09:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:09:28] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-04-06 22:09:28] [INFO ] Transformed 414 places.
[2023-04-06 22:09:28] [INFO ] Transformed 1296 transitions.
[2023-04-06 22:09:28] [INFO ] Found NUPN structural information;
[2023-04-06 22:09:28] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 12) seen :8
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-06 22:09:29] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-06 22:09:29] [INFO ] Computed 19 invariants in 14 ms
[2023-04-06 22:09:29] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:09:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-04-06 22:09:29] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 19 ms returned sat
[2023-04-06 22:09:30] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-04-06 22:09:30] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-06 22:09:30] [INFO ] After 184ms SMT Verify possible using 314 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-04-06 22:09:30] [INFO ] Deduced a trap composed of 3 places in 362 ms of which 7 ms to minimize.
[2023-04-06 22:09:31] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-04-06 22:09:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2023-04-06 22:09:31] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2023-04-06 22:09:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-04-06 22:09:31] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 1 ms to minimize.
[2023-04-06 22:09:31] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2023-04-06 22:09:31] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:09:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 432 ms
[2023-04-06 22:09:31] [INFO ] After 1539ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-04-06 22:09:31] [INFO ] After 2418ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 43 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 12 place count 408 transition count 1197
Deduced a syphon composed of 93 places in 5 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 198 place count 315 transition count 1197
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 226 place count 287 transition count 1029
Iterating global reduction 2 with 28 rules applied. Total rules applied 254 place count 287 transition count 1029
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 308 place count 260 transition count 1002
Applied a total of 308 rules in 184 ms. Remains 260 /414 variables (removed 154) and now considering 1002/1296 (removed 294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 260/414 places, 1002/1296 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 520030 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{0=1}
Probabilistic random walk after 520030 steps, saw 167543 distinct states, run finished after 3004 ms. (steps per millisecond=173 ) properties seen :1
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-04-06 22:09:35] [INFO ] Flow matrix only has 408 transitions (discarded 594 similar events)
// Phase 1: matrix 408 rows 260 cols
[2023-04-06 22:09:35] [INFO ] Computed 19 invariants in 5 ms
[2023-04-06 22:09:35] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:09:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 22:09:35] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:09:35] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:35] [INFO ] State equation strengthened by 174 read => feed constraints.
[2023-04-06 22:09:35] [INFO ] After 68ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 811 ms
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:09:36] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:09:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2023-04-06 22:09:37] [INFO ] After 1159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-04-06 22:09:37] [INFO ] After 1440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 34 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 1002/1002 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 260 transition count 998
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 256 transition count 998
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 255 transition count 992
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 255 transition count 992
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 253 transition count 990
Applied a total of 14 rules in 49 ms. Remains 253 /260 variables (removed 7) and now considering 990/1002 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 253/260 places, 990/1002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 568603 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568603 steps, saw 166990 distinct states, run finished after 3002 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 22:09:40] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
// Phase 1: matrix 396 rows 253 cols
[2023-04-06 22:09:40] [INFO ] Computed 19 invariants in 11 ms
[2023-04-06 22:09:40] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:09:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 22:09:40] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 22:09:40] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:40] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 22:09:40] [INFO ] After 71ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:40] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-04-06 22:09:40] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:09:40] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:09:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 255 ms
[2023-04-06 22:09:40] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:09:41] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:09:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2023-04-06 22:09:41] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-04-06 22:09:41] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 990/990 transitions.
Applied a total of 0 rules in 24 ms. Remains 253 /253 variables (removed 0) and now considering 990/990 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 253/253 places, 990/990 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 990/990 transitions.
Applied a total of 0 rules in 23 ms. Remains 253 /253 variables (removed 0) and now considering 990/990 (removed 0) transitions.
[2023-04-06 22:09:41] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
[2023-04-06 22:09:41] [INFO ] Invariant cache hit.
[2023-04-06 22:09:41] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-04-06 22:09:41] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
[2023-04-06 22:09:41] [INFO ] Invariant cache hit.
[2023-04-06 22:09:41] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 22:09:42] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2023-04-06 22:09:42] [INFO ] Redundant transitions in 57 ms returned []
[2023-04-06 22:09:42] [INFO ] Flow matrix only has 396 transitions (discarded 594 similar events)
[2023-04-06 22:09:42] [INFO ] Invariant cache hit.
[2023-04-06 22:09:42] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1256 ms. Remains : 253/253 places, 990/990 transitions.
Graph (trivial) has 759 edges and 253 vertex of which 32 / 253 are part of one of the 6 SCC in 3 ms
Free SCC test removed 26 places
Drop transitions removed 97 transitions
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 676 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 227 transition count 277
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 190 transition count 274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 187 transition count 274
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 81 place count 187 transition count 269
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 92 place count 181 transition count 269
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 186 place count 134 transition count 222
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 201 place count 134 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 130 transition count 218
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 213 place count 130 transition count 214
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 224 place count 130 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 129 transition count 204
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 243 place count 129 transition count 187
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 260 place count 112 transition count 187
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 268 place count 112 transition count 187
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 112 transition count 187
Applied a total of 269 rules in 49 ms. Remains 112 /253 variables (removed 141) and now considering 187/990 (removed 803) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 187 rows 112 cols
[2023-04-06 22:09:42] [INFO ] Computed 18 invariants in 1 ms
[2023-04-06 22:09:42] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 22:09:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 22:09:42] [INFO ] [Nat]Absence check using 13 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:09:42] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-06 22:09:42] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-04-06 22:09:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-04-06 22:09:42] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 22:09:42] [INFO ] After 263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-06 22:09:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-06 22:09:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 253 places, 990 transitions and 5016 arcs took 11 ms.
[2023-04-06 22:09:42] [INFO ] Flatten gal took : 98 ms
Total runtime 14607 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-06
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality

FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680818984747

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 11 (type EXCL) for 0 EisenbergMcGuire-PT-06-ReachabilityCardinality-05
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 EisenbergMcGuire-PT-06-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 EisenbergMcGuire-PT-06-ReachabilityCardinality-05
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 # 10 (type SRCH) for 0 EisenbergMcGuire-PT-06-ReachabilityCardinality-05
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 # 10 (type SRCH) for EisenbergMcGuire-PT-06-ReachabilityCardinality-05
lola: result : true
lola: markings : 20526
lola: fired transitions : 32831
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for EisenbergMcGuire-PT-06-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 8 (type EQUN) for EisenbergMcGuire-PT-06-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 11 (type EXCL) for EisenbergMcGuire-PT-06-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 18 (type EXCL) for 3 EisenbergMcGuire-PT-06-ReachabilityCardinality-15
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 14 (type FNDP) for 3 EisenbergMcGuire-PT-06-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 3 EisenbergMcGuire-PT-06-ReachabilityCardinality-15
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 # 17 (type SRCH) for 3 EisenbergMcGuire-PT-06-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 8 (type EQUN) for EisenbergMcGuire-PT-06-ReachabilityCardinality-05
lola: result : unknown
lola: FINISHED task # 7 (type FNDP) for EisenbergMcGuire-PT-06-ReachabilityCardinality-05
lola: result : unknown
lola: fired transitions : 31162
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 17 (type SRCH) for EisenbergMcGuire-PT-06-ReachabilityCardinality-15
lola: result : true
lola: markings : 18477
lola: fired transitions : 32178
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for EisenbergMcGuire-PT-06-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 15 (type EQUN) for EisenbergMcGuire-PT-06-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 18 (type EXCL) for EisenbergMcGuire-PT-06-ReachabilityCardinality-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-06-ReachabilityCardinality-05: AG false tandem / insertion
EisenbergMcGuire-PT-06-ReachabilityCardinality-15: AG false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

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="EisenbergMcGuire-PT-06"
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 EisenbergMcGuire-PT-06, 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 r519-tall-167987245000246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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