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

About the Execution of LTSMin+red for AutonomousCar-PT-07a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7351.256 670311.00 2639465.00 73.50 FFTFFTTFTFFTTFTF 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-167813598200626.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-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200626
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 276K 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-07a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678638492912

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-07a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:28:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:28:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:28:16] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-12 16:28:16] [INFO ] Transformed 73 places.
[2023-03-12 16:28:16] [INFO ] Transformed 593 transitions.
[2023-03-12 16:28:16] [INFO ] Found NUPN structural information;
[2023-03-12 16:28:16] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
Support contains 51 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 379
Applied a total of 2 rules in 47 ms. Remains 72 /73 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 72 cols
[2023-03-12 16:28:16] [INFO ] Computed 11 place invariants in 25 ms
[2023-03-12 16:28:17] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 16:28:17] [INFO ] Invariant cache hit.
[2023-03-12 16:28:17] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-12 16:28:17] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [68, 70]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 758 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/73 places, 379/380 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 812 ms. Remains : 70/73 places, 379/380 transitions.
Support contains 51 out of 70 places after structural reductions.
[2023-03-12 16:28:17] [INFO ] Flatten gal took : 167 ms
[2023-03-12 16:28:17] [INFO ] Flatten gal took : 49 ms
[2023-03-12 16:28:18] [INFO ] Input system was already deterministic with 379 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 69) seen :41
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :4
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 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 379 rows 70 cols
[2023-03-12 16:28:19] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-12 16:28:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:28:20] [INFO ] After 766ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:15
[2023-03-12 16:28:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:28:21] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :15
[2023-03-12 16:28:21] [INFO ] State equation strengthened by 199 read => feed constraints.
[2023-03-12 16:28:22] [INFO ] After 858ms SMT Verify possible using 199 Read/Feed constraints in natural domain returned unsat :4 sat :15
[2023-03-12 16:28:23] [INFO ] After 1891ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :15
Attempting to minimize the solution found.
Minimization took 850 ms.
[2023-03-12 16:28:24] [INFO ] After 4083ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :15
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 1 properties in 167 ms.
Support contains 30 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 379/379 transitions.
Graph (complete) has 670 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 69 transition count 371
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 65 transition count 371
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 65 transition count 368
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 62 transition count 368
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 59 transition count 351
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 59 transition count 351
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 58 transition count 350
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 58 transition count 343
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 68 place count 51 transition count 315
Applied a total of 68 rules in 85 ms. Remains 51 /70 variables (removed 19) and now considering 315/379 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 51/70 places, 315/379 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 315 rows 51 cols
[2023-03-12 16:28:25] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:28:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:28:25] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:28:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-12 16:28:25] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:28:25] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-12 16:28:26] [INFO ] After 300ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:28:26] [INFO ] After 658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-12 16:28:26] [INFO ] After 1396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 60 ms.
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 315/315 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 313
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 49 transition count 310
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 24 place count 46 transition count 296
Applied a total of 24 rules in 36 ms. Remains 46 /51 variables (removed 5) and now considering 296/315 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 46/51 places, 296/315 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 46 cols
[2023-03-12 16:28:27] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:28:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-12 16:28:27] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:28:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:28:27] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:28:27] [INFO ] State equation strengthened by 141 read => feed constraints.
[2023-03-12 16:28:28] [INFO ] After 161ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:28:28] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-12 16:28:28] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 59 ms.
Support contains 8 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 296/296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 288
Applied a total of 2 rules in 30 ms. Remains 45 /46 variables (removed 1) and now considering 288/296 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 45/46 places, 288/296 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1025272 steps, run visited all 4 properties in 2215 ms. (steps per millisecond=462 )
Probabilistic random walk after 1025272 steps, saw 136545 distinct states, run finished after 2227 ms. (steps per millisecond=460 ) properties seen :4
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 62 ms
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 37 ms
[2023-03-12 16:28:31] [INFO ] Input system was already deterministic with 379 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 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 70 transition count 374
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 65 transition count 372
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 63 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 63 transition count 370
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 61 transition count 370
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 56 transition count 330
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 56 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 55 transition count 329
Applied a total of 30 rules in 41 ms. Remains 55 /70 variables (removed 15) and now considering 329/379 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 55/70 places, 329/379 transitions.
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 33 ms
[2023-03-12 16:28:31] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 42 ms
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 31 ms
[2023-03-12 16:28:31] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 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 70 transition count 373
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 64 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 63 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 63 transition count 370
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 61 transition count 370
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 56 transition count 330
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 56 transition count 330
Applied a total of 28 rules in 41 ms. Remains 56 /70 variables (removed 14) and now considering 330/379 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 56/70 places, 330/379 transitions.
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:28:31] [INFO ] Input system was already deterministic with 330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 323
Applied a total of 14 rules in 4 ms. Remains 63 /70 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/70 places, 323/379 transitions.
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:28:31] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:28:32] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 28 ms
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 34 ms
[2023-03-12 16:28:32] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:28:32] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 9 rules applied. Total rules applied 9 place count 68 transition count 370
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 60 transition count 370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 60 transition count 369
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 19 place count 59 transition count 369
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 52 transition count 313
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 52 transition count 313
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 37 place count 50 transition count 311
Applied a total of 37 rules in 26 ms. Remains 50 /70 variables (removed 20) and now considering 311/379 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 50/70 places, 311/379 transitions.
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:28:32] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 16 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 33 ms
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:28:32] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 379/379 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 70 transition count 372
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 63 transition count 372
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 63 transition count 370
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 18 place count 61 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 56 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 56 transition count 330
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 55 transition count 329
Applied a total of 30 rules in 24 ms. Remains 55 /70 variables (removed 15) and now considering 329/379 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 55/70 places, 329/379 transitions.
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 25 ms
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 27 ms
[2023-03-12 16:28:32] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 29 ms
[2023-03-12 16:28:32] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 66 transition count 347
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 66 transition count 347
Applied a total of 8 rules in 2 ms. Remains 66 /70 variables (removed 4) and now considering 347/379 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/70 places, 347/379 transitions.
[2023-03-12 16:28:32] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:28:33] [INFO ] Input system was already deterministic with 347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 323
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 323
Applied a total of 14 rules in 2 ms. Remains 63 /70 variables (removed 7) and now considering 323/379 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 63/70 places, 323/379 transitions.
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 18 ms
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 43 ms
[2023-03-12 16:28:33] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 339
Applied a total of 10 rules in 2 ms. Remains 65 /70 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/70 places, 339/379 transitions.
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 33 ms
[2023-03-12 16:28:33] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 331
Applied a total of 12 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 331/379 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 64/70 places, 331/379 transitions.
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:28:33] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 339
Applied a total of 10 rules in 2 ms. Remains 65 /70 variables (removed 5) and now considering 339/379 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/70 places, 339/379 transitions.
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:28:33] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 379/379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 355
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 355
Applied a total of 6 rules in 2 ms. Remains 67 /70 variables (removed 3) and now considering 355/379 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/70 places, 355/379 transitions.
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 19 ms
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:28:33] [INFO ] Input system was already deterministic with 355 transitions.
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:28:33] [INFO ] Flatten gal took : 39 ms
[2023-03-12 16:28:33] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 32 ms.
[2023-03-12 16:28:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 379 transitions and 3746 arcs took 3 ms.
Total runtime 17699 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/499/ctl_0_ --ctl=/tmp/499/ctl_1_ --ctl=/tmp/499/ctl_2_ --ctl=/tmp/499/ctl_3_ --ctl=/tmp/499/ctl_4_ --ctl=/tmp/499/ctl_5_ --ctl=/tmp/499/ctl_6_ --ctl=/tmp/499/ctl_7_ --ctl=/tmp/499/ctl_8_ --ctl=/tmp/499/ctl_9_ --ctl=/tmp/499/ctl_10_ --ctl=/tmp/499/ctl_11_ --ctl=/tmp/499/ctl_12_ --ctl=/tmp/499/ctl_13_ --ctl=/tmp/499/ctl_14_ --ctl=/tmp/499/ctl_15_ --mu-par --mu-opt
FORMULA AutonomousCar-PT-07a-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-07a-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639163223

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-07a-CTLFireability-00
ctl formula formula --ctl=/tmp/499/ctl_0_
ctl formula name AutonomousCar-PT-07a-CTLFireability-01
ctl formula formula --ctl=/tmp/499/ctl_1_
ctl formula name AutonomousCar-PT-07a-CTLFireability-02
ctl formula formula --ctl=/tmp/499/ctl_2_
ctl formula name AutonomousCar-PT-07a-CTLFireability-03
ctl formula formula --ctl=/tmp/499/ctl_3_
ctl formula name AutonomousCar-PT-07a-CTLFireability-04
ctl formula formula --ctl=/tmp/499/ctl_4_
ctl formula name AutonomousCar-PT-07a-CTLFireability-05
ctl formula formula --ctl=/tmp/499/ctl_5_
ctl formula name AutonomousCar-PT-07a-CTLFireability-06
ctl formula formula --ctl=/tmp/499/ctl_6_
ctl formula name AutonomousCar-PT-07a-CTLFireability-07
ctl formula formula --ctl=/tmp/499/ctl_7_
ctl formula name AutonomousCar-PT-07a-CTLFireability-08
ctl formula formula --ctl=/tmp/499/ctl_8_
ctl formula name AutonomousCar-PT-07a-CTLFireability-09
ctl formula formula --ctl=/tmp/499/ctl_9_
ctl formula name AutonomousCar-PT-07a-CTLFireability-10
ctl formula formula --ctl=/tmp/499/ctl_10_
ctl formula name AutonomousCar-PT-07a-CTLFireability-11
ctl formula formula --ctl=/tmp/499/ctl_11_
ctl formula name AutonomousCar-PT-07a-CTLFireability-12
ctl formula formula --ctl=/tmp/499/ctl_12_
ctl formula name AutonomousCar-PT-07a-CTLFireability-13
ctl formula formula --ctl=/tmp/499/ctl_13_
ctl formula name AutonomousCar-PT-07a-CTLFireability-14
ctl formula formula --ctl=/tmp/499/ctl_14_
ctl formula name AutonomousCar-PT-07a-CTLFireability-15
ctl formula formula --ctl=/tmp/499/ctl_15_
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 70 places, 379 transitions and 3746 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.020 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: 379->356 groups
pnml2lts-sym: Regrouping took 0.100 real 0.100 user 0.000 sys
pnml2lts-sym: state vector length is 70; there are 356 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: 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 14269806 group checks and 0 next state calls
pnml2lts-sym: reachability took 250.230 real 999.970 user 0.040 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 124045181 states, 54956 nodes
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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_0_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_3_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_1_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_15_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_14_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/499/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/499/ctl_8_ holds for the initial state
pnml2lts-sym: group_next: 8148 nodes total
pnml2lts-sym: group_explored: 11305 nodes, 846227 short vectors total
pnml2lts-sym: max token count: 1
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-sym(+0x9b684) [0x556677ae1684]
1: pnml2lts-sym(+0x9b726) [0x556677ae1726]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5a32282140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x87870) [0x7f5a31fc2870]
4: /lib/x86_64-linux-gnu/libpthread.so.0(+0x7ebf) [0x7f5a32276ebf]
5: /lib/x86_64-linux-gnu/libc.so.6(clone+0x3f) [0x7f5a32037a2f]

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-07a"
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-07a, 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-167813598200626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07a.tgz
mv AutonomousCar-PT-07a 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;