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

About the Execution of LoLa+red for AutonomousCar-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1082.304 42278.00 67205.00 53.40 FFTTTFFTTTTTTTTF 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-167813595800663.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-09a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595800663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 781K 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-09a-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678353343955

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-09a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 09:15:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 09:15:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:15:46] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-09 09:15:46] [INFO ] Transformed 89 places.
[2023-03-09 09:15:46] [INFO ] Transformed 1249 transitions.
[2023-03-09 09:15:46] [INFO ] Found NUPN structural information;
[2023-03-09 09:15:46] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
Incomplete random walk after 10000 steps, including 500 resets, run finished after 493 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 392527 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{0=1, 3=1, 10=1, 11=1}
Probabilistic random walk after 392527 steps, saw 54667 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :4
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 12 properties.
[2023-03-09 09:15:50] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2023-03-09 09:15:50] [INFO ] Computed 14 place invariants in 16 ms
[2023-03-09 09:15:51] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 09:15:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-09 09:15:54] [INFO ] After 2569ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2023-03-09 09:15:54] [INFO ] State equation strengthened by 327 read => feed constraints.
[2023-03-09 09:15:56] [INFO ] After 2332ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :3 sat :9
[2023-03-09 09:15:59] [INFO ] After 5130ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 2475 ms.
[2023-03-09 09:16:01] [INFO ] After 10382ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 9 different solutions.
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1004 ms.
Support contains 50 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 87 transition count 899
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 86 transition count 895
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 82 transition count 895
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 82 transition count 894
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 81 transition count 894
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 80 transition count 884
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 80 transition count 884
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 80 transition count 878
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 38 place count 74 transition count 869
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 74 transition count 869
Applied a total of 39 rules in 250 ms. Remains 74 /89 variables (removed 15) and now considering 869/904 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 74/89 places, 869/904 transitions.
Incomplete random walk after 10000 steps, including 254 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :2
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :2
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 869 rows 74 cols
[2023-03-09 09:16:03] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-09 09:16:03] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 09:16:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-09 09:16:05] [INFO ] After 1429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 09:16:05] [INFO ] State equation strengthened by 309 read => feed constraints.
[2023-03-09 09:16:06] [INFO ] After 1078ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 09:16:07] [INFO ] After 2145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1115 ms.
[2023-03-09 09:16:08] [INFO ] After 4778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 224 ms.
Support contains 43 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 869/869 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 74 transition count 868
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 868
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 867
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 72 transition count 862
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 41 place count 67 transition count 835
Applied a total of 41 rules in 85 ms. Remains 67 /74 variables (removed 7) and now considering 835/869 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 67/74 places, 835/869 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 835 rows 67 cols
[2023-03-09 09:16:09] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-09 09:16:09] [INFO ] [Real]Absence check using 14 positive place invariants in 33 ms returned sat
[2023-03-09 09:16:09] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:16:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-09 09:16:10] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:10] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-09 09:16:10] [INFO ] After 258ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:10] [INFO ] After 638ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 315 ms.
[2023-03-09 09:16:11] [INFO ] After 1513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 209 ms.
Support contains 20 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 835/835 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 66 transition count 834
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 65 transition count 824
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 65 transition count 824
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 65 transition count 820
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 48 place count 61 transition count 784
Applied a total of 48 rules in 92 ms. Remains 61 /67 variables (removed 6) and now considering 784/835 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 61/67 places, 784/835 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 755565 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 755565 steps, saw 100068 distinct states, run finished after 3002 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 784 rows 61 cols
[2023-03-09 09:16:14] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-09 09:16:14] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-09 09:16:14] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:16:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-09 09:16:15] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:15] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-09 09:16:15] [INFO ] After 308ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:15] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-03-09 09:16:16] [INFO ] After 1371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 784/784 transitions.
Applied a total of 0 rules in 36 ms. Remains 61 /61 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 61/61 places, 784/784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 784/784 transitions.
Applied a total of 0 rules in 36 ms. Remains 61 /61 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-09 09:16:16] [INFO ] Invariant cache hit.
[2023-03-09 09:16:16] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 09:16:16] [INFO ] Invariant cache hit.
[2023-03-09 09:16:16] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-09 09:16:16] [INFO ] Implicit Places using invariants and state equation in 402 ms returned [57, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 684 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/61 places, 784/784 transitions.
Applied a total of 0 rules in 53 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 786 ms. Remains : 59/61 places, 784/784 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 763599 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :{}
Probabilistic random walk after 763599 steps, saw 101155 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 784 rows 59 cols
[2023-03-09 09:16:20] [INFO ] Computed 12 place invariants in 18 ms
[2023-03-09 09:16:20] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:16:20] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:16:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:16:20] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:20] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-09 09:16:21] [INFO ] After 325ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:21] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-09 09:16:21] [INFO ] After 1555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 198 ms.
Support contains 20 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 784/784 transitions.
Applied a total of 0 rules in 30 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 59/59 places, 784/784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 784/784 transitions.
Applied a total of 0 rules in 30 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-09 09:16:22] [INFO ] Invariant cache hit.
[2023-03-09 09:16:22] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-09 09:16:22] [INFO ] Invariant cache hit.
[2023-03-09 09:16:22] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-09 09:16:22] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-03-09 09:16:22] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-09 09:16:22] [INFO ] Invariant cache hit.
[2023-03-09 09:16:23] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1257 ms. Remains : 59/59 places, 784/784 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 59 transition count 783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 59 transition count 782
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 58 transition count 782
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 57 transition count 781
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 57 transition count 781
Applied a total of 5 rules in 42 ms. Remains 57 /59 variables (removed 2) and now considering 781/784 (removed 3) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 781 rows 57 cols
[2023-03-09 09:16:23] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-09 09:16:23] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-09 09:16:23] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:16:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:16:23] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:24] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-09 09:16:24] [INFO ] After 1080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:16:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-09 09:16:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 784 transitions and 12212 arcs took 25 ms.
[2023-03-09 09:16:25] [INFO ] Flatten gal took : 248 ms
Total runtime 38852 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-09a
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
ReachabilityFireability

FORMULA AutonomousCar-PT-09a-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09a-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678353386233

--------------------
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/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/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: 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 3 AutonomousCar-PT-09a-ReachabilityFireability-05
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 AutonomousCar-PT-09a-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 AutonomousCar-PT-09a-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 3 AutonomousCar-PT-09a-ReachabilityFireability-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: FINISHED task # 10 (type SRCH) for AutonomousCar-PT-09a-ReachabilityFireability-05
lola: result : true
lola: markings : 45
lola: fired transitions : 44
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for AutonomousCar-PT-09a-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 8 (type EQUN) for AutonomousCar-PT-09a-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 11 (type EXCL) for AutonomousCar-PT-09a-ReachabilityFireability-05 (obsolete)
lola: FINISHED task # 7 (type FNDP) for AutonomousCar-PT-09a-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 43
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/381/ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
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 # 17 (type EXCL) for 0 AutonomousCar-PT-09a-ReachabilityFireability-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 AutonomousCar-PT-09a-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 AutonomousCar-PT-09a-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 AutonomousCar-PT-09a-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 13 (type FNDP) for AutonomousCar-PT-09a-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 68
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for AutonomousCar-PT-09a-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 16 (type SRCH) for AutonomousCar-PT-09a-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 17 (type EXCL) for AutonomousCar-PT-09a-ReachabilityFireability-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09a-ReachabilityFireability-02: EF true findpath
AutonomousCar-PT-09a-ReachabilityFireability-05: 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="AutonomousCar-PT-09a"
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-09a, 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-167813595800663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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