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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 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.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 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 865K 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-09b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678353595195

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-09b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 09:19:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 09:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:19:57] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-09 09:19:57] [INFO ] Transformed 391 places.
[2023-03-09 09:19:57] [INFO ] Transformed 1554 transitions.
[2023-03-09 09:19:57] [INFO ] Found NUPN structural information;
[2023-03-09 09:19:57] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 14) seen :7
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 1554 rows 391 cols
[2023-03-09 09:19:58] [INFO ] Computed 14 place invariants in 24 ms
[2023-03-09 09:19:59] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 09:19:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-09 09:20:01] [INFO ] After 1338ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-09 09:20:02] [INFO ] Deduced a trap composed of 29 places in 1107 ms of which 40 ms to minimize.
[2023-03-09 09:20:03] [INFO ] Deduced a trap composed of 25 places in 885 ms of which 2 ms to minimize.
[2023-03-09 09:20:04] [INFO ] Deduced a trap composed of 75 places in 1005 ms of which 15 ms to minimize.
[2023-03-09 09:20:05] [INFO ] Deduced a trap composed of 41 places in 580 ms of which 9 ms to minimize.
[2023-03-09 09:20:05] [INFO ] Deduced a trap composed of 46 places in 689 ms of which 13 ms to minimize.
[2023-03-09 09:20:06] [INFO ] Deduced a trap composed of 47 places in 790 ms of which 2 ms to minimize.
[2023-03-09 09:20:07] [INFO ] Deduced a trap composed of 51 places in 601 ms of which 0 ms to minimize.
[2023-03-09 09:20:07] [INFO ] Deduced a trap composed of 47 places in 577 ms of which 3 ms to minimize.
[2023-03-09 09:20:08] [INFO ] Deduced a trap composed of 53 places in 523 ms of which 1 ms to minimize.
[2023-03-09 09:20:09] [INFO ] Deduced a trap composed of 48 places in 520 ms of which 0 ms to minimize.
[2023-03-09 09:20:09] [INFO ] Deduced a trap composed of 47 places in 680 ms of which 1 ms to minimize.
[2023-03-09 09:20:10] [INFO ] Deduced a trap composed of 52 places in 493 ms of which 1 ms to minimize.
[2023-03-09 09:20:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9094 ms
[2023-03-09 09:20:11] [INFO ] Deduced a trap composed of 55 places in 757 ms of which 1 ms to minimize.
[2023-03-09 09:20:11] [INFO ] Deduced a trap composed of 38 places in 507 ms of which 1 ms to minimize.
[2023-03-09 09:20:12] [INFO ] Deduced a trap composed of 50 places in 452 ms of which 0 ms to minimize.
[2023-03-09 09:20:12] [INFO ] Deduced a trap composed of 38 places in 386 ms of which 1 ms to minimize.
[2023-03-09 09:20:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2354 ms
[2023-03-09 09:20:13] [INFO ] Deduced a trap composed of 22 places in 676 ms of which 1 ms to minimize.
[2023-03-09 09:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 759 ms
[2023-03-09 09:20:13] [INFO ] After 14206ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 591 ms.
[2023-03-09 09:20:14] [INFO ] After 14980ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 62 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 274 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 385 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.16 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 385 transition count 1447
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 114 rules applied. Total rules applied 217 place count 284 transition count 1434
Reduce places removed 6 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 27 rules applied. Total rules applied 244 place count 278 transition count 1413
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 266 place count 257 transition count 1412
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 266 place count 257 transition count 1394
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 302 place count 239 transition count 1394
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 326 place count 215 transition count 1370
Iterating global reduction 4 with 24 rules applied. Total rules applied 350 place count 215 transition count 1370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 350 place count 215 transition count 1369
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 352 place count 214 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 355 place count 211 transition count 1315
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 211 transition count 1315
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 436 place count 172 transition count 1276
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 443 place count 165 transition count 1143
Iterating global reduction 4 with 7 rules applied. Total rules applied 450 place count 165 transition count 1143
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 456 place count 162 transition count 1143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 458 place count 162 transition count 1141
Drop transitions removed 243 transitions
Redundant transition composition rules discarded 243 transitions
Iterating global reduction 5 with 243 rules applied. Total rules applied 701 place count 162 transition count 898
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 715 place count 162 transition count 884
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 729 place count 148 transition count 884
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 740 place count 148 transition count 873
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 743 place count 148 transition count 873
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 744 place count 147 transition count 872
Applied a total of 744 rules in 575 ms. Remains 147 /391 variables (removed 244) and now considering 872/1554 (removed 682) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 575 ms. Remains : 147/391 places, 872/1554 transitions.
Incomplete random walk after 10000 steps, including 217 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 5) seen :2
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 872 rows 147 cols
[2023-03-09 09:20:15] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 09:20:15] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 09:20:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:20:16] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 09:20:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:20:16] [INFO ] After 241ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 09:20:16] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-09 09:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-09 09:20:17] [INFO ] Deduced a trap composed of 14 places in 585 ms of which 0 ms to minimize.
[2023-03-09 09:20:17] [INFO ] Deduced a trap composed of 26 places in 499 ms of which 1 ms to minimize.
[2023-03-09 09:20:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1255 ms
[2023-03-09 09:20:18] [INFO ] After 2004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-09 09:20:18] [INFO ] After 2649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 116 ms.
Support contains 29 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 872/872 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 147 transition count 851
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 47 place count 126 transition count 846
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 53 place count 121 transition count 845
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 53 place count 121 transition count 842
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 118 transition count 842
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 116 transition count 832
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 116 transition count 832
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 92 place count 101 transition count 818
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 100 transition count 817
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 100 transition count 817
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 100 transition count 815
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 100 transition count 807
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 112 place count 92 transition count 807
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 122 place count 92 transition count 797
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 91 transition count 796
Applied a total of 123 rules in 283 ms. Remains 91 /147 variables (removed 56) and now considering 796/872 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 91/147 places, 796/872 transitions.
Incomplete random walk after 10000 steps, including 420 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 796 rows 91 cols
[2023-03-09 09:20:18] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-09 09:20:18] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:20:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:20:19] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:20:19] [INFO ] After 271ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:20:20] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 2 ms to minimize.
[2023-03-09 09:20:20] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-09 09:20:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-03-09 09:20:20] [INFO ] After 909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-09 09:20:20] [INFO ] After 1468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 57 ms.
Support contains 27 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 796/796 transitions.
Graph (complete) has 903 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 3 place count 90 transition count 793
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 89 transition count 792
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 88 transition count 791
Applied a total of 7 rules in 62 ms. Remains 88 /91 variables (removed 3) and now considering 791/796 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 88/91 places, 791/796 transitions.
Incomplete random walk after 10000 steps, including 441 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 842663 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 842663 steps, saw 118062 distinct states, run finished after 3004 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 791 rows 88 cols
[2023-03-09 09:20:23] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-09 09:20:23] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 09:20:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 09:20:24] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 09:20:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:20:24] [INFO ] After 142ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 09:20:24] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 0 ms to minimize.
[2023-03-09 09:20:25] [INFO ] Deduced a trap composed of 7 places in 490 ms of which 0 ms to minimize.
[2023-03-09 09:20:26] [INFO ] Deduced a trap composed of 7 places in 674 ms of which 1 ms to minimize.
[2023-03-09 09:20:26] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-09 09:20:26] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2023-03-09 09:20:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2210 ms
[2023-03-09 09:20:26] [INFO ] After 2580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-09 09:20:26] [INFO ] After 3200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 52 ms.
Support contains 27 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 791/791 transitions.
Applied a total of 0 rules in 57 ms. Remains 88 /88 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 88/88 places, 791/791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 791/791 transitions.
Applied a total of 0 rules in 38 ms. Remains 88 /88 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2023-03-09 09:20:27] [INFO ] Invariant cache hit.
[2023-03-09 09:20:27] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-09 09:20:27] [INFO ] Invariant cache hit.
[2023-03-09 09:20:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:20:28] [INFO ] Implicit Places using invariants and state equation in 680 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1111 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/88 places, 791/791 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 791
Applied a total of 1 rules in 83 ms. Remains 87 /87 variables (removed 0) and now considering 791/791 (removed 0) transitions.
// Phase 1: matrix 791 rows 87 cols
[2023-03-09 09:20:28] [INFO ] Computed 11 place invariants in 19 ms
[2023-03-09 09:20:28] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-09 09:20:28] [INFO ] Invariant cache hit.
[2023-03-09 09:20:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:20:29] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/88 places, 791/791 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2450 ms. Remains : 87/88 places, 791/791 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 09:20:29] [INFO ] Invariant cache hit.
[2023-03-09 09:20:29] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 09:20:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-09 09:20:30] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 09:20:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:20:30] [INFO ] After 44ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 09:20:30] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-09 09:20:30] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 7 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 791/791 transitions.
Graph (complete) has 893 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 86 transition count 779
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 1 with 12 rules applied. Total rules applied 24 place count 76 transition count 777
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 75 transition count 777
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 71 transition count 773
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 71 transition count 772
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 38 place count 69 transition count 770
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 43 place count 69 transition count 765
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 57 place count 64 transition count 756
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 66 place count 64 transition count 747
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 64 transition count 747
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 68 place count 63 transition count 746
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 63 transition count 746
Applied a total of 69 rules in 214 ms. Remains 63 /87 variables (removed 24) and now considering 746/791 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 63/87 places, 746/791 transitions.
Finished random walk after 760 steps, including 7 resets, run visited all 1 properties in 15 ms. (steps per millisecond=50 )
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32826 ms.
starting LoLA
BK_INPUT AutonomousCar-PT-09b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678353639836

--------------------
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/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k: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 # 53 (type EXCL) for 9 AutonomousCar-PT-09b-ReachabilityCardinality-03
lola: time limit : 224 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 9 AutonomousCar-PT-09b-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 9 AutonomousCar-PT-09b-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 9 AutonomousCar-PT-09b-ReachabilityCardinality-03
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
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-50.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: 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: 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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k: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: 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: 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
sara: place or transition ordering is non-deterministic
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 49 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 10010
lola: tried executions : 171
lola: time used : 2.000000
lola: memory pages used : 0
lola: CANCELED task # 50 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 52 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 53 (type EXCL) for AutonomousCar-PT-09b-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 120 (type EXCL) for 45 AutonomousCar-PT-09b-ReachabilityCardinality-15
lola: time limit : 239 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 55 (type FNDP) for 6 AutonomousCar-PT-09b-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type EQUN) for 6 AutonomousCar-PT-09b-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 58 (type SRCH) for 6 AutonomousCar-PT-09b-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 50 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-03
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 58 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-02
lola: result : false
lola: markings : 44
lola: fired transitions : 43
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 55 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 56 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-02 (obsolete)
lola: LAUNCH task # 61 (type FNDP) for 21 AutonomousCar-PT-09b-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type EQUN) for 21 AutonomousCar-PT-09b-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type SRCH) for 21 AutonomousCar-PT-09b-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 55 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-02
lola: result : unknown
lola: fired transitions : 195
lola: tried executions : 45
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 120 (type EXCL) for AutonomousCar-PT-09b-ReachabilityCardinality-15
lola: result : true
lola: markings : 8
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 113 (type EXCL) for 18 AutonomousCar-PT-09b-ReachabilityCardinality-06
lola: time limit : 276 sec
lola: memory limit: 32 pages
lola: FINISHED task # 64 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-07
lola: result : true
lola: markings : 113
lola: fired transitions : 112
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 61 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 62 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-07 (obsolete)
lola: LAUNCH task # 75 (type FNDP) for 30 AutonomousCar-PT-09b-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 76 (type EQUN) for 30 AutonomousCar-PT-09b-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 78 (type SRCH) for 30 AutonomousCar-PT-09b-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 61 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-07
lola: result : true
lola: fired transitions : 111
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-62.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-56.sara.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09b-ReachabilityCardinality-02: EF false tandem / insertion
AutonomousCar-PT-09b-ReachabilityCardinality-03: AG false findpath
AutonomousCar-PT-09b-ReachabilityCardinality-07: EF true tandem / insertion
AutonomousCar-PT-09b-ReachabilityCardinality-15: AG false tandem / relaxed

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-09b-ReachabilityCardinality-00: AG 0 0 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-01: EF 0 0 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-04: AG 0 5 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-05: AG 0 5 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-06: AG 0 4 1 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-08: AG 0 5 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-09: AG 0 5 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-10: AG 0 2 3 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-11: AG 0 5 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-12: EF 0 0 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-13: EF 0 5 0 0 1 0 0 0
AutonomousCar-PT-09b-ReachabilityCardinality-14: EF 0 5 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
75 EF FNDP 0/299 0/5 AutonomousCar-PT-09b-ReachabilityCardinality-10 803 t fired, 1 attempts, .
76 EF STEQ 0/299 0/5 AutonomousCar-PT-09b-ReachabilityCardinality-10 sara not yet started (preprocessing).
78 EF SRCH 0/299 1/5 AutonomousCar-PT-09b-ReachabilityCardinality-10 757 m, 151 m/sec, 773 t fired, .
113 EF EXCL 0/299 1/32 AutonomousCar-PT-09b-ReachabilityCardinality-06 1832 m, 366 m/sec, 5316 t fired, .

Time elapsed: 6 secs. Pages in use: 2
# running tasks: 4 of 4 Visible: 16
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-76.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 75 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-10
lola: result : true
lola: fired transitions : 2809
lola: tried executions : 7
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 76 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 78 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-10 (obsolete)
lola: LAUNCH task # 135 (type FNDP) for 3 AutonomousCar-PT-09b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 136 (type EQUN) for 3 AutonomousCar-PT-09b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 138 (type SRCH) for 3 AutonomousCar-PT-09b-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 76 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-10
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 135 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-01
lola: result : true
lola: fired transitions : 19
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 136 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 138 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-01 (obsolete)
lola: LAUNCH task # 141 (type FNDP) for 36 AutonomousCar-PT-09b-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 142 (type EQUN) for 36 AutonomousCar-PT-09b-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 144 (type SRCH) for 36 AutonomousCar-PT-09b-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-142.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-136.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 141 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 1490
lola: tried executions : 9
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 142 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 144 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-12 (obsolete)
lola: LAUNCH task # 88 (type FNDP) for 42 AutonomousCar-PT-09b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 89 (type EQUN) for 42 AutonomousCar-PT-09b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 91 (type SRCH) for 42 AutonomousCar-PT-09b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 142 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-12
lola: result : unknown
lola: FINISHED task # 88 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-14
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 89 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 91 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-14 (obsolete)
lola: LAUNCH task # 129 (type FNDP) for 33 AutonomousCar-PT-09b-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 130 (type EQUN) for 33 AutonomousCar-PT-09b-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 132 (type SRCH) for 33 AutonomousCar-PT-09b-ReachabilityCardinality-11
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 # 132 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-11
lola: result : true
lola: markings : 8
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 129 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 130 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-11 (obsolete)
lola: LAUNCH task # 122 (type FNDP) for 39 AutonomousCar-PT-09b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 123 (type EQUN) for 39 AutonomousCar-PT-09b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 125 (type SRCH) for 39 AutonomousCar-PT-09b-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 129 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-11
lola: result : true
lola: fired transitions : 6
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-89.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-130.sara.
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
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-123.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 123 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-13
lola: result : false
lola: CANCELED task # 122 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 125 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-13 (obsolete)
lola: LAUNCH task # 148 (type FNDP) for 0 AutonomousCar-PT-09b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 149 (type EQUN) for 0 AutonomousCar-PT-09b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 151 (type SRCH) for 0 AutonomousCar-PT-09b-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 122 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-13
lola: result : unknown
lola: fired transitions : 9028
lola: tried executions : 98
lola: time used : 1.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 148 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-00
lola: result : true
lola: fired transitions : 4
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 149 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 151 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 82 (type FNDP) for 12 AutonomousCar-PT-09b-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 83 (type EQUN) for 12 AutonomousCar-PT-09b-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 85 (type SRCH) for 12 AutonomousCar-PT-09b-ReachabilityCardinality-04
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 # 82 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 3
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 83 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 85 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-04 (obsolete)
lola: LAUNCH task # 102 (type FNDP) for 15 AutonomousCar-PT-09b-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 103 (type EQUN) for 15 AutonomousCar-PT-09b-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 105 (type SRCH) for 15 AutonomousCar-PT-09b-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 105 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-05
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 102 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 103 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 95 (type FNDP) for 24 AutonomousCar-PT-09b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 96 (type EQUN) for 24 AutonomousCar-PT-09b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 98 (type SRCH) for 24 AutonomousCar-PT-09b-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 102 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-05
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 98 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-08
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 95 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 96 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-08 (obsolete)
lola: LAUNCH task # 68 (type FNDP) for 27 AutonomousCar-PT-09b-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type EQUN) for 27 AutonomousCar-PT-09b-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 71 (type SRCH) for 27 AutonomousCar-PT-09b-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 95 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-08
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 68 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 218
lola: tried executions : 6
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 69 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 71 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-09 (obsolete)
lola: LAUNCH task # 109 (type FNDP) for 18 AutonomousCar-PT-09b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 110 (type EQUN) for 18 AutonomousCar-PT-09b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 112 (type SRCH) for 18 AutonomousCar-PT-09b-ReachabilityCardinality-06
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
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-149.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-83.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-69.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-103.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-96.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-110.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 96 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-08
lola: result : true
lola: FINISHED task # 103 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-05
lola: result : true

lola: FINISHED task # 110 (type EQUN) for AutonomousCar-PT-09b-ReachabilityCardinality-06
lola: result : false
lola: CANCELED task # 109 (type FNDP) for AutonomousCar-PT-09b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 112 (type SRCH) for AutonomousCar-PT-09b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 113 (type EXCL) for AutonomousCar-PT-09b-ReachabilityCardinality-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-09b-ReachabilityCardinality-00: AG false findpath
AutonomousCar-PT-09b-ReachabilityCardinality-01: EF true findpath
AutonomousCar-PT-09b-ReachabilityCardinality-02: EF false tandem / insertion
AutonomousCar-PT-09b-ReachabilityCardinality-03: AG false findpath
AutonomousCar-PT-09b-ReachabilityCardinality-04: AG false findpath
AutonomousCar-PT-09b-ReachabilityCardinality-05: AG false tandem / insertion
AutonomousCar-PT-09b-ReachabilityCardinality-06: AG true state equation
AutonomousCar-PT-09b-ReachabilityCardinality-07: EF true tandem / insertion
AutonomousCar-PT-09b-ReachabilityCardinality-08: AG false tandem / insertion
AutonomousCar-PT-09b-ReachabilityCardinality-09: AG false findpath
AutonomousCar-PT-09b-ReachabilityCardinality-10: AG false findpath
AutonomousCar-PT-09b-ReachabilityCardinality-11: AG false tandem / insertion
AutonomousCar-PT-09b-ReachabilityCardinality-12: EF true findpath
AutonomousCar-PT-09b-ReachabilityCardinality-13: EF false state equation
AutonomousCar-PT-09b-ReachabilityCardinality-14: EF true findpath
AutonomousCar-PT-09b-ReachabilityCardinality-15: AG false tandem / relaxed


Time elapsed: 9 secs. Pages in use: 3

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-09b"
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-09b, 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-167813595900670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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