fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r103-tall-167814478300463
Last Updated
May 14, 2023

About the Execution of LoLa+red for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
389.983 59371.00 82188.00 333.60 TTTFFTFFTTTTTFTT normal

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-167814478300463.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300463
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME DES-PT-40a-ReachabilityFireability-01
FORMULA_NAME DES-PT-40a-ReachabilityFireability-02
FORMULA_NAME DES-PT-40a-ReachabilityFireability-03
FORMULA_NAME DES-PT-40a-ReachabilityFireability-04
FORMULA_NAME DES-PT-40a-ReachabilityFireability-05
FORMULA_NAME DES-PT-40a-ReachabilityFireability-06
FORMULA_NAME DES-PT-40a-ReachabilityFireability-07
FORMULA_NAME DES-PT-40a-ReachabilityFireability-08
FORMULA_NAME DES-PT-40a-ReachabilityFireability-09
FORMULA_NAME DES-PT-40a-ReachabilityFireability-10
FORMULA_NAME DES-PT-40a-ReachabilityFireability-11
FORMULA_NAME DES-PT-40a-ReachabilityFireability-12
FORMULA_NAME DES-PT-40a-ReachabilityFireability-13
FORMULA_NAME DES-PT-40a-ReachabilityFireability-14
FORMULA_NAME DES-PT-40a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678253116049

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:25:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:25:17] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-08 05:25:17] [INFO ] Transformed 274 places.
[2023-03-08 05:25:17] [INFO ] Transformed 231 transitions.
[2023-03-08 05:25:17] [INFO ] Found NUPN structural information;
[2023-03-08 05:25:17] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 16) seen :2
FORMULA DES-PT-40a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :1
FORMULA DES-PT-40a-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 217 rows 274 cols
[2023-03-08 05:25:19] [INFO ] Computed 59 place invariants in 27 ms
[2023-03-08 05:25:19] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 05:25:19] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 05:25:19] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 05:25:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-08 05:25:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 193 ms returned sat
[2023-03-08 05:25:26] [INFO ] After 6323ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-08 05:25:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 05:25:30] [INFO ] After 3483ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :12
[2023-03-08 05:25:30] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 5 ms to minimize.
[2023-03-08 05:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-08 05:25:33] [INFO ] After 6724ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 2480 ms.
[2023-03-08 05:25:35] [INFO ] After 16270ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
FORMULA DES-PT-40a-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 12 different solutions.
FORMULA DES-PT-40a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 6 properties in 579 ms.
Support contains 84 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 48 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 48 ms. Remains : 274/274 places, 216/217 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 744036 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 744036 steps, saw 108430 distinct states, run finished after 3002 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 05:25:39] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 05:25:40] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:25:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 05:25:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 131 ms returned sat
[2023-03-08 05:25:44] [INFO ] After 3607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 05:25:47] [INFO ] After 2867ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-08 05:25:48] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-08 05:25:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2023-03-08 05:25:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2023-03-08 05:25:48] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2023-03-08 05:25:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-08 05:25:48] [INFO ] After 4485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2177 ms.
[2023-03-08 05:25:50] [INFO ] After 10745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA DES-PT-40a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 286 ms.
Support contains 82 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 11 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 11 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 11 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-08 05:25:51] [INFO ] Invariant cache hit.
[2023-03-08 05:25:51] [INFO ] Implicit Places using invariants in 166 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 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 19 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 208 ms. Remains : 273/274 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 840353 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 840353 steps, saw 120781 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 216 rows 273 cols
[2023-03-08 05:25:54] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 05:25:55] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:25:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:25:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 90 ms returned sat
[2023-03-08 05:25:56] [INFO ] After 1015ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:25:56] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-03-08 05:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 05:25:57] [INFO ] After 1684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1995 ms.
[2023-03-08 05:25:59] [INFO ] After 4027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA DES-PT-40a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 163 ms.
Support contains 68 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 216/216 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 273 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 273 transition count 215
Applied a total of 2 rules in 23 ms. Remains 273 /273 variables (removed 0) and now considering 215/216 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 273/273 places, 215/216 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 864488 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 864488 steps, saw 123129 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 215 rows 273 cols
[2023-03-08 05:26:02] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:26:02] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:26:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2023-03-08 05:26:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-08 05:26:04] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:26:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 05:26:05] [INFO ] After 1440ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:26:06] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-08 05:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-08 05:26:06] [INFO ] After 2831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2203 ms.
[2023-03-08 05:26:09] [INFO ] After 6343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 59 ms.
Support contains 68 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 273/273 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-08 05:26:09] [INFO ] Invariant cache hit.
[2023-03-08 05:26:09] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-08 05:26:09] [INFO ] Invariant cache hit.
[2023-03-08 05:26:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 05:26:09] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2023-03-08 05:26:10] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 05:26:10] [INFO ] Invariant cache hit.
[2023-03-08 05:26:10] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 939 ms. Remains : 273/273 places, 215/215 transitions.
Applied a total of 0 rules in 7 ms. Remains 273 /273 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-08 05:26:10] [INFO ] Invariant cache hit.
[2023-03-08 05:26:10] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:26:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:26:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 150 ms returned sat
[2023-03-08 05:26:11] [INFO ] After 1064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:26:12] [INFO ] After 1759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 969 ms.
[2023-03-08 05:26:13] [INFO ] After 3088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-08 05:26:13] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-08 05:26:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 215 transitions and 1058 arcs took 1 ms.
[2023-03-08 05:26:13] [INFO ] Flatten gal took : 49 ms
Total runtime 56189 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40a
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityFireability

FORMULA DES-PT-40a-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-40a-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678253175420

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 22 (type EXCL) for 9 DES-PT-40a-ReachabilityFireability-15
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 DES-PT-40a-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 DES-PT-40a-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 DES-PT-40a-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for DES-PT-40a-ReachabilityFireability-08
lola: result : true
lola: markings : 492
lola: fired transitions : 491
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for DES-PT-40a-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 13 (type EQUN) for DES-PT-40a-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 24 (type FNDP) for 6 DES-PT-40a-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 6 DES-PT-40a-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 6 DES-PT-40a-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 27 (type SRCH) for DES-PT-40a-ReachabilityFireability-14
lola: result : true
lola: markings : 743
lola: fired transitions : 742
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 24 (type FNDP) for DES-PT-40a-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 25 (type EQUN) for DES-PT-40a-ReachabilityFireability-14 (obsolete)
lola: LAUNCH task # 18 (type FNDP) for 9 DES-PT-40a-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 9 DES-PT-40a-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 9 DES-PT-40a-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 12 (type FNDP) for DES-PT-40a-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 490
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-25.sara.
lola: FINISHED task # 24 (type FNDP) for DES-PT-40a-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 741
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-19.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 21 (type SRCH) for DES-PT-40a-ReachabilityFireability-15
lola: result : true
lola: markings : 59502
lola: fired transitions : 81639
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for DES-PT-40a-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 19 (type EQUN) for DES-PT-40a-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 22 (type EXCL) for DES-PT-40a-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 34 (type EXCL) for 0 DES-PT-40a-ReachabilityFireability-01
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 30 (type FNDP) for 0 DES-PT-40a-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type EQUN) for 0 DES-PT-40a-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type SRCH) for 0 DES-PT-40a-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 19 (type EQUN) for DES-PT-40a-ReachabilityFireability-15
lola: result : unknown
lola: FINISHED task # 18 (type FNDP) for DES-PT-40a-ReachabilityFireability-15
lola: result : unknown
lola: fired transitions : 270830
lola: tried executions : 6425
lola: time used : 1.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 33 (type SRCH) for DES-PT-40a-ReachabilityFireability-01
lola: result : true
lola: markings : 1141
lola: fired transitions : 1178
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 30 (type FNDP) for DES-PT-40a-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 31 (type EQUN) for DES-PT-40a-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 34 (type EXCL) for DES-PT-40a-ReachabilityFireability-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-40a-ReachabilityFireability-01: EF true tandem / insertion
DES-PT-40a-ReachabilityFireability-08: EF true tandem / insertion
DES-PT-40a-ReachabilityFireability-14: EF true tandem / insertion
DES-PT-40a-ReachabilityFireability-15: EF true 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="DES-PT-40a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-40a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478300463"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;