About the Execution of LTSMin+red for AutonomousCar-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1872.628 | 89228.00 | 332687.00 | 40.60 | TFTTTTFFFFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813598100610.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 ltsminxred
Input is AutonomousCar-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100610
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:54 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 177K 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-06a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678637778350
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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:16:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:16:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:16:21] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-12 16:16:21] [INFO ] Transformed 65 places.
[2023-03-12 16:16:21] [INFO ] Transformed 417 transitions.
[2023-03-12 16:16:21] [INFO ] Found NUPN structural information;
[2023-03-12 16:16:21] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
Support contains 54 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 257
Applied a total of 2 rules in 16 ms. Remains 64 /65 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 64 cols
[2023-03-12 16:16:21] [INFO ] Computed 10 place invariants in 26 ms
[2023-03-12 16:16:22] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 16:16:22] [INFO ] Invariant cache hit.
[2023-03-12 16:16:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-12 16:16:22] [INFO ] Implicit Places using invariants and state equation in 271 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 651 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 257/258 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 684 ms. Remains : 63/65 places, 257/258 transitions.
Support contains 54 out of 63 places after structural reductions.
[2023-03-12 16:16:22] [INFO ] Flatten gal took : 97 ms
[2023-03-12 16:16:22] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:16:22] [INFO ] Input system was already deterministic with 257 transitions.
Incomplete random walk after 10000 steps, including 525 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 90) seen :69
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :1
Running SMT prover for 16 properties.
// Phase 1: matrix 257 rows 63 cols
[2023-03-12 16:16:23] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-12 16:16:24] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:16:24] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:14
[2023-03-12 16:16:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:16:25] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-12 16:16:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-12 16:16:25] [INFO ] After 508ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :3 sat :13
[2023-03-12 16:16:26] [INFO ] After 1218ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 571 ms.
[2023-03-12 16:16:26] [INFO ] After 2497ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 30 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 257/257 transitions.
Graph (complete) has 524 edges and 63 vertex of which 62 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 62 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 60 transition count 253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 60 transition count 251
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 58 transition count 251
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 56 transition count 237
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 56 transition count 237
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 2 with 2 rules applied. Total rules applied 16 place count 55 transition count 236
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 55 transition count 232
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 36 place count 51 transition count 220
Applied a total of 36 rules in 52 ms. Remains 51 /63 variables (removed 12) and now considering 220/257 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 51/63 places, 220/257 transitions.
Incomplete random walk after 10000 steps, including 486 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 220 rows 51 cols
[2023-03-12 16:16:27] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:16:27] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 16:16:27] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:16:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:16:28] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 16:16:28] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-12 16:16:28] [INFO ] After 270ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 16:16:28] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-12 16:16:29] [INFO ] After 1238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 152 ms.
Support contains 22 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 220/220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 213
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 48 transition count 211
Applied a total of 6 rules in 19 ms. Remains 48 /51 variables (removed 3) and now considering 211/220 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 48/51 places, 211/220 transitions.
Incomplete random walk after 10000 steps, including 457 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 211 rows 48 cols
[2023-03-12 16:16:29] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 16:16:29] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:16:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 16:16:29] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:16:29] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-12 16:16:29] [INFO ] After 156ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:16:30] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 16:16:30] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 211/211 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 46 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 45 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 45 transition count 202
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 2 with 2 rules applied. Total rules applied 8 place count 44 transition count 201
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 44 transition count 199
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 24 place count 42 transition count 187
Applied a total of 24 rules in 31 ms. Remains 42 /48 variables (removed 6) and now considering 187/211 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 42/48 places, 187/211 transitions.
Incomplete random walk after 10000 steps, including 290 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Finished Best-First random walk after 635 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=317 )
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-06a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 257 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 222
Applied a total of 10 rules in 3 ms. Remains 58 /63 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 58/63 places, 222/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 63 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 58 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 58 transition count 250
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 56 transition count 250
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 51 transition count 215
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 51 transition count 215
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 2 with 2 rules applied. Total rules applied 26 place count 50 transition count 214
Applied a total of 26 rules in 15 ms. Remains 50 /63 variables (removed 13) and now considering 214/257 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 50/63 places, 214/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 243
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 243/257 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/63 places, 243/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 222
Applied a total of 10 rules in 2 ms. Remains 58 /63 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/63 places, 222/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 229
Applied a total of 8 rules in 2 ms. Remains 59 /63 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/63 places, 229/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 229
Applied a total of 8 rules in 2 ms. Remains 59 /63 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/63 places, 229/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 63 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 58 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 58 transition count 251
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 12 place count 57 transition count 251
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 54 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 54 transition count 230
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 2 with 2 rules applied. Total rules applied 20 place count 53 transition count 229
Applied a total of 20 rules in 19 ms. Remains 53 /63 variables (removed 10) and now considering 229/257 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 53/63 places, 229/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 16 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 63/63 places, 257/257 transitions.
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 32 ms
[2023-03-12 16:16:30] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:16:30] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 257/257 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 7 rules applied. Total rules applied 7 place count 63 transition count 250
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 56 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 56 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 55 transition count 249
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 52 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 52 transition count 228
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 2 with 2 rules applied. Total rules applied 24 place count 51 transition count 227
Applied a total of 24 rules in 16 ms. Remains 51 /63 variables (removed 12) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 51/63 places, 227/257 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:16:31] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 215
Applied a total of 12 rules in 7 ms. Remains 57 /63 variables (removed 6) and now considering 215/257 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 57/63 places, 215/257 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 32 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:16:31] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 243
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 243/257 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 61/63 places, 243/257 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 26 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 28 ms
[2023-03-12 16:16:31] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 236
Applied a total of 6 rules in 4 ms. Remains 60 /63 variables (removed 3) and now considering 236/257 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 60/63 places, 236/257 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:16:31] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 249
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 55 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 55 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 54 transition count 248
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 49 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 49 transition count 213
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 2 with 4 rules applied. Total rules applied 32 place count 47 transition count 211
Applied a total of 32 rules in 16 ms. Remains 47 /63 variables (removed 16) and now considering 211/257 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 47/63 places, 211/257 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:16:31] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 257/257 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 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 251
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 57 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 57 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 55 transition count 249
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 49 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 49 transition count 207
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 2 with 2 rules applied. Total rules applied 30 place count 48 transition count 206
Applied a total of 30 rules in 14 ms. Remains 48 /63 variables (removed 15) and now considering 206/257 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 48/63 places, 206/257 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:16:31] [INFO ] Input system was already deterministic with 206 transitions.
Finished random walk after 985 steps, including 77 resets, run visited all 1 properties in 6 ms. (steps per millisecond=164 )
FORMULA AutonomousCar-PT-06a-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 257/257 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 63 transition count 253
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 59 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 57 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 57 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 55 transition count 249
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 52 transition count 228
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 52 transition count 228
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 3 with 2 rules applied. Total rules applied 24 place count 51 transition count 227
Applied a total of 24 rules in 14 ms. Remains 51 /63 variables (removed 12) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 51/63 places, 227/257 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:16:31] [INFO ] Input system was already deterministic with 227 transitions.
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 14 ms
[2023-03-12 16:16:31] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:16:31] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-12 16:16:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 257 transitions and 2169 arcs took 2 ms.
Total runtime 10378 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/503/ctl_0_ --ctl=/tmp/503/ctl_1_ --ctl=/tmp/503/ctl_2_ --ctl=/tmp/503/ctl_3_ --ctl=/tmp/503/ctl_4_ --ctl=/tmp/503/ctl_5_ --ctl=/tmp/503/ctl_6_ --ctl=/tmp/503/ctl_7_ --ctl=/tmp/503/ctl_8_ --ctl=/tmp/503/ctl_9_ --ctl=/tmp/503/ctl_10_ --ctl=/tmp/503/ctl_11_ --ctl=/tmp/503/ctl_12_ --ctl=/tmp/503/ctl_13_ --mu-par --mu-opt
FORMULA AutonomousCar-PT-06a-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678637867578
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name AutonomousCar-PT-06a-CTLFireability-00
ctl formula formula --ctl=/tmp/503/ctl_0_
ctl formula name AutonomousCar-PT-06a-CTLFireability-01
ctl formula formula --ctl=/tmp/503/ctl_1_
ctl formula name AutonomousCar-PT-06a-CTLFireability-02
ctl formula formula --ctl=/tmp/503/ctl_2_
ctl formula name AutonomousCar-PT-06a-CTLFireability-03
ctl formula formula --ctl=/tmp/503/ctl_3_
ctl formula name AutonomousCar-PT-06a-CTLFireability-04
ctl formula formula --ctl=/tmp/503/ctl_4_
ctl formula name AutonomousCar-PT-06a-CTLFireability-05
ctl formula formula --ctl=/tmp/503/ctl_5_
ctl formula name AutonomousCar-PT-06a-CTLFireability-06
ctl formula formula --ctl=/tmp/503/ctl_6_
ctl formula name AutonomousCar-PT-06a-CTLFireability-07
ctl formula formula --ctl=/tmp/503/ctl_7_
ctl formula name AutonomousCar-PT-06a-CTLFireability-08
ctl formula formula --ctl=/tmp/503/ctl_8_
ctl formula name AutonomousCar-PT-06a-CTLFireability-09
ctl formula formula --ctl=/tmp/503/ctl_9_
ctl formula name AutonomousCar-PT-06a-CTLFireability-10
ctl formula formula --ctl=/tmp/503/ctl_10_
ctl formula name AutonomousCar-PT-06a-CTLFireability-11
ctl formula formula --ctl=/tmp/503/ctl_11_
ctl formula name AutonomousCar-PT-06a-CTLFireability-12
ctl formula formula --ctl=/tmp/503/ctl_12_
ctl formula name AutonomousCar-PT-06a-CTLFireability-14
ctl formula formula --ctl=/tmp/503/ctl_13_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 63 places, 257 transitions and 2169 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 257->237 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 63; there are 237 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 636423 group checks and 0 next state calls
pnml2lts-sym: reachability took 9.260 real 36.890 user 0.030 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 15168174 states, 21040 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/503/ctl_0_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/503/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/503/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_4_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/503/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/503/ctl_7_ does not hold for the initial state
pnml2lts-sym: group_next: 4751 nodes total
pnml2lts-sym: group_explored: 6684 nodes, 144499 short vectors total
pnml2lts-sym: max token count: 1
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-06a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-06a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813598100610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;