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-167813595800646.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-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595800646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:55 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 448K 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-08a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678352427129

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 09:00:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 09:00:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:00:29] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-09 09:00:29] [INFO ] Transformed 81 places.
[2023-03-09 09:00:29] [INFO ] Transformed 849 transitions.
[2023-03-09 09:00:29] [INFO ] Found NUPN structural information;
[2023-03-09 09:00:29] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 530 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 9) seen :6
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-09 09:00:30] [INFO ] Flow matrix only has 573 transitions (discarded 1 similar events)
// Phase 1: matrix 573 rows 81 cols
[2023-03-09 09:00:30] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-09 09:00:30] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 09:00:31] [INFO ] After 338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-09 09:00:31] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-09 09:00:31] [INFO ] After 40ms SMT Verify possible using 259 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:00:31] [INFO ] After 637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:00:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 09:00:31] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:00:31] [INFO ] After 101ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:00:31] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-09 09:00:31] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 7 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 574/574 transitions.
Graph (complete) has 853 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 80 transition count 564
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 73 transition count 564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 73 transition count 563
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 72 transition count 563
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 25 place count 66 transition count 509
Iterating global reduction 2 with 6 rules applied. Total rules applied 31 place count 66 transition count 509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 64 transition count 507
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 64 transition count 499
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 99 place count 56 transition count 451
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 56 transition count 451
Applied a total of 100 rules in 199 ms. Remains 56 /81 variables (removed 25) and now considering 451/574 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 56/81 places, 451/574 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 451 rows 56 cols
[2023-03-09 09:00:32] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 09:00:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-09 09:00:32] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:00:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 09:00:32] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:32] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-09 09:00:32] [INFO ] After 17ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:32] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 09:00:32] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 451/451 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 56 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 450
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 55 transition count 449
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 12 place count 54 transition count 441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 53 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 52 transition count 440
Applied a total of 14 rules in 82 ms. Remains 52 /56 variables (removed 4) and now considering 440/451 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 52/56 places, 440/451 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1755853 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :{}
Probabilistic random walk after 1755853 steps, saw 220710 distinct states, run finished after 3032 ms. (steps per millisecond=579 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 440 rows 52 cols
[2023-03-09 09:00:35] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-09 09:00:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:00:36] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:00:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-09 09:00:36] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:00:36] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:36] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 09:00:36] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 440/440 transitions.
Applied a total of 0 rules in 54 ms. Remains 52 /52 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 52/52 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 440/440 transitions.
Applied a total of 0 rules in 30 ms. Remains 52 /52 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-09 09:00:36] [INFO ] Invariant cache hit.
[2023-03-09 09:00:36] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-09 09:00:36] [INFO ] Invariant cache hit.
[2023-03-09 09:00:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:00:36] [INFO ] Implicit Places using invariants and state equation in 296 ms returned [47, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 521 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/52 places, 440/440 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 439
Applied a total of 2 rules in 23 ms. Remains 49 /50 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 49 cols
[2023-03-09 09:00:37] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-09 09:00:37] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 09:00:37] [INFO ] Invariant cache hit.
[2023-03-09 09:00:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:00:37] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/52 places, 439/440 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1392 ms. Remains : 49/52 places, 439/440 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1907538 steps, run timeout after 3001 ms. (steps per millisecond=635 ) properties seen :{}
Probabilistic random walk after 1907538 steps, saw 237670 distinct states, run finished after 3002 ms. (steps per millisecond=635 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:00:40] [INFO ] Invariant cache hit.
[2023-03-09 09:00:41] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 09:00:41] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:00:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-09 09:00:41] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:00:41] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:41] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 09:00:41] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 439/439 transitions.
Applied a total of 0 rules in 28 ms. Remains 49 /49 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 49/49 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 439/439 transitions.
Applied a total of 0 rules in 15 ms. Remains 49 /49 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2023-03-09 09:00:41] [INFO ] Invariant cache hit.
[2023-03-09 09:00:41] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-09 09:00:41] [INFO ] Invariant cache hit.
[2023-03-09 09:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:00:42] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-09 09:00:42] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-09 09:00:42] [INFO ] Invariant cache hit.
[2023-03-09 09:00:42] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 960 ms. Remains : 49/49 places, 439/439 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 49 transition count 438
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 49 transition count 437
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 48 transition count 437
Applied a total of 3 rules in 21 ms. Remains 48 /49 variables (removed 1) and now considering 437/439 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 437 rows 48 cols
[2023-03-09 09:00:42] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 09:00:42] [INFO ] [Real]Absence check using 11 positive place invariants in 74 ms returned sat
[2023-03-09 09:00:42] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:00:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:00:42] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:00:42] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:42] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-09 09:00:42] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:00:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-09 09:00:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 439 transitions and 5591 arcs took 13 ms.
[2023-03-09 09:00:43] [INFO ] Flatten gal took : 143 ms
Total runtime 13867 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-08a
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityCardinality

FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678352443769

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityCardinality.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-08a-ReachabilityCardinality-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 AutonomousCar-PT-08a-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 AutonomousCar-PT-08a-ReachabilityCardinality-03
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-08a-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 3 (type FNDP) for AutonomousCar-PT-08a-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 77
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for AutonomousCar-PT-08a-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 6 (type SRCH) for AutonomousCar-PT-08a-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 7 (type EXCL) for AutonomousCar-PT-08a-ReachabilityCardinality-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-08a-ReachabilityCardinality-03: EF true findpath


Time elapsed: 0 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-08a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is AutonomousCar-PT-08a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595800646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08a.tgz
mv AutonomousCar-PT-08a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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