About the Execution of LoLa+red for AutonomousCar-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
620.243 | 18490.00 | 33985.00 | 33.00 | TTFTTTFTTTTTFTFT | 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.r007-oct2-167813595700591.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is AutonomousCar-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595700591
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 110K 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 AutonomousCar-PT-04b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-04b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678351636670
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=AutonomousCar-PT-04b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:47:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:47:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:47:19] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-09 08:47:19] [INFO ] Transformed 221 places.
[2023-03-09 08:47:19] [INFO ] Transformed 368 transitions.
[2023-03-09 08:47:19] [INFO ] Found NUPN structural information;
[2023-03-09 08:47:19] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 16) seen :6
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :4
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 368 rows 221 cols
[2023-03-09 08:47:20] [INFO ] Computed 9 place invariants in 16 ms
[2023-03-09 08:47:21] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:47:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2023-03-09 08:47:21] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-09 08:47:22] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 6 ms to minimize.
[2023-03-09 08:47:22] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-09 08:47:22] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2023-03-09 08:47:22] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 0 ms to minimize.
[2023-03-09 08:47:22] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2023-03-09 08:47:22] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 0 ms to minimize.
[2023-03-09 08:47:22] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 0 ms to minimize.
[2023-03-09 08:47:23] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2023-03-09 08:47:23] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2023-03-09 08:47:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1553 ms
[2023-03-09 08:47:23] [INFO ] After 2180ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-09 08:47:23] [INFO ] After 2564ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 61 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 368/368 transitions.
Graph (trivial) has 106 edges and 221 vertex of which 2 / 221 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 586 edges and 220 vertex of which 216 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 216 transition count 313
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 109 place count 166 transition count 306
Reduce places removed 4 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 14 rules applied. Total rules applied 123 place count 162 transition count 296
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 135 place count 152 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 151 transition count 294
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 136 place count 151 transition count 282
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 160 place count 139 transition count 282
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 176 place count 123 transition count 266
Iterating global reduction 5 with 16 rules applied. Total rules applied 192 place count 123 transition count 266
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 5 with 68 rules applied. Total rules applied 260 place count 123 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 260 place count 123 transition count 197
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 262 place count 122 transition count 197
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 282 place count 112 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 284 place count 111 transition count 187
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 111 transition count 186
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 290 place count 111 transition count 181
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 295 place count 106 transition count 181
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 297 place count 106 transition count 179
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 299 place count 106 transition count 179
Applied a total of 299 rules in 84 ms. Remains 106 /221 variables (removed 115) and now considering 179/368 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 106/221 places, 179/368 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 179 rows 106 cols
[2023-03-09 08:47:23] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-09 08:47:23] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:47:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 08:47:24] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:47:24] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:24] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-09 08:47:24] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 60 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 179/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 178
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 178
Applied a total of 2 rules in 34 ms. Remains 105 /106 variables (removed 1) and now considering 178/179 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 105/106 places, 178/179 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2629409 steps, run timeout after 3001 ms. (steps per millisecond=876 ) properties seen :{}
Probabilistic random walk after 2629409 steps, saw 437607 distinct states, run finished after 3004 ms. (steps per millisecond=875 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 105 cols
[2023-03-09 08:47:27] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 08:47:27] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:47:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 39 ms returned sat
[2023-03-09 08:47:27] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:47:28] [INFO ] After 78ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:28] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2023-03-09 08:47:28] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-09 08:47:28] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2023-03-09 08:47:28] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2023-03-09 08:47:28] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-09 08:47:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 535 ms
[2023-03-09 08:47:28] [INFO ] After 709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 08:47:28] [INFO ] After 1121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 60 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/105 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-09 08:47:28] [INFO ] Invariant cache hit.
[2023-03-09 08:47:28] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 08:47:28] [INFO ] Invariant cache hit.
[2023-03-09 08:47:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:47:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/105 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 206 ms. Remains : 104/105 places, 178/178 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2655529 steps, run timeout after 3001 ms. (steps per millisecond=884 ) properties seen :{}
Probabilistic random walk after 2655529 steps, saw 441994 distinct states, run finished after 3001 ms. (steps per millisecond=884 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 104 cols
[2023-03-09 08:47:32] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-09 08:47:32] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:47:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 08:47:32] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:47:32] [INFO ] After 93ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:32] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 1 ms to minimize.
[2023-03-09 08:47:32] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-09 08:47:32] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2023-03-09 08:47:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-09 08:47:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
[2023-03-09 08:47:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 428 ms
[2023-03-09 08:47:33] [INFO ] After 648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-09 08:47:33] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 60 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 178/178 transitions.
Applied a total of 0 rules in 17 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 104/104 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-09 08:47:33] [INFO ] Invariant cache hit.
[2023-03-09 08:47:33] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 08:47:33] [INFO ] Invariant cache hit.
[2023-03-09 08:47:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:47:33] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-09 08:47:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 08:47:33] [INFO ] Invariant cache hit.
[2023-03-09 08:47:33] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 104/104 places, 178/178 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 178
Applied a total of 1 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 104 cols
[2023-03-09 08:47:33] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-09 08:47:33] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:47:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-09 08:47:33] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:34] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2023-03-09 08:47:34] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-03-09 08:47:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2023-03-09 08:47:34] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-09 08:47:34] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:47:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-09 08:47:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 178 transitions and 902 arcs took 1 ms.
[2023-03-09 08:47:34] [INFO ] Flatten gal took : 46 ms
Total runtime 15556 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-04b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
ReachabilityFireability
FORMULA AutonomousCar-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678351655160
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
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: LAUNCH task # 7 (type EXCL) for 0 AutonomousCar-PT-04b-ReachabilityFireability-05
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 AutonomousCar-PT-04b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 AutonomousCar-PT-04b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 AutonomousCar-PT-04b-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for AutonomousCar-PT-04b-ReachabilityFireability-05
lola: result : true
lola: markings : 686
lola: fired transitions : 755
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for AutonomousCar-PT-04b-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 4 (type EQUN) for AutonomousCar-PT-04b-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 7 (type EXCL) for AutonomousCar-PT-04b-ReachabilityFireability-05 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-04b-ReachabilityFireability-05: 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="AutonomousCar-PT-04b"
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 AutonomousCar-PT-04b, 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 r007-oct2-167813595700591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b 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 '
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 ;