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.r265-smll-167863540000418.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Parking-PT-208, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540000418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:23 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 Parking-PT-208-CTLFireability-00
FORMULA_NAME Parking-PT-208-CTLFireability-01
FORMULA_NAME Parking-PT-208-CTLFireability-02
FORMULA_NAME Parking-PT-208-CTLFireability-03
FORMULA_NAME Parking-PT-208-CTLFireability-04
FORMULA_NAME Parking-PT-208-CTLFireability-05
FORMULA_NAME Parking-PT-208-CTLFireability-06
FORMULA_NAME Parking-PT-208-CTLFireability-07
FORMULA_NAME Parking-PT-208-CTLFireability-08
FORMULA_NAME Parking-PT-208-CTLFireability-09
FORMULA_NAME Parking-PT-208-CTLFireability-10
FORMULA_NAME Parking-PT-208-CTLFireability-11
FORMULA_NAME Parking-PT-208-CTLFireability-12
FORMULA_NAME Parking-PT-208-CTLFireability-13
FORMULA_NAME Parking-PT-208-CTLFireability-14
FORMULA_NAME Parking-PT-208-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678996230505

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=Parking-PT-208
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 19:50:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 19:50:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:50:33] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-16 19:50:33] [INFO ] Transformed 137 places.
[2023-03-16 19:50:33] [INFO ] Transformed 201 transitions.
[2023-03-16 19:50:33] [INFO ] Found NUPN structural information;
[2023-03-16 19:50:33] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Support contains 74 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 30 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2023-03-16 19:50:33] [INFO ] Computed 34 place invariants in 27 ms
[2023-03-16 19:50:33] [INFO ] Implicit Places using invariants in 383 ms returned [28, 36, 44, 64, 94, 110, 130]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 431 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/137 places, 116/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 112
Applied a total of 8 rules in 8 ms. Remains 125 /129 variables (removed 4) and now considering 112/116 (removed 4) transitions.
// Phase 1: matrix 112 rows 125 cols
[2023-03-16 19:50:33] [INFO ] Computed 27 place invariants in 9 ms
[2023-03-16 19:50:33] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-16 19:50:33] [INFO ] Invariant cache hit.
[2023-03-16 19:50:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:50:34] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/137 places, 112/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 883 ms. Remains : 125/137 places, 112/117 transitions.
Support contains 74 out of 125 places after structural reductions.
[2023-03-16 19:50:34] [INFO ] Flatten gal took : 46 ms
[2023-03-16 19:50:34] [INFO ] Flatten gal took : 19 ms
[2023-03-16 19:50:34] [INFO ] Input system was already deterministic with 112 transitions.
Incomplete random walk after 10000 steps, including 292 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 56) seen :43
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-16 19:50:35] [INFO ] Invariant cache hit.
[2023-03-16 19:50:35] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-16 19:50:36] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-16 19:50:36] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2023-03-16 19:50:36] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-16 19:50:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-16 19:50:36] [INFO ] After 96ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-16 19:50:36] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 6 ms to minimize.
[2023-03-16 19:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-16 19:50:36] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-16 19:50:36] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 2 properties in 41 ms.
Support contains 13 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 109
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 122 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 121 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 121 transition count 105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 118 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 117 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 117 transition count 104
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 112 transition count 99
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 112 transition count 83
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 58 place count 96 transition count 83
Applied a total of 58 rules in 51 ms. Remains 96 /125 variables (removed 29) and now considering 83/112 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 96/125 places, 83/112 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 83 rows 96 cols
[2023-03-16 19:50:37] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-16 19:50:37] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-16 19:50:37] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 19:50:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-16 19:50:37] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 19:50:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-16 19:50:37] [INFO ] After 22ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 19:50:37] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 19:50:37] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 54 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:50:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Parking-PT-208-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 12 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 72 out of 125 places (down from 74) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 14 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 11 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 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 2 rules applied. Total rules applied 2 place count 125 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 123 transition count 108
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 8 place count 121 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 119 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 119 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 117 transition count 104
Applied a total of 16 rules in 24 ms. Remains 117 /125 variables (removed 8) and now considering 104/112 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 117/125 places, 104/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 125 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 124 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 124 transition count 110
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 4 place count 123 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 121 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 121 transition count 108
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 10 place count 120 transition count 107
Applied a total of 10 rules in 19 ms. Remains 120 /125 variables (removed 5) and now considering 107/112 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 120/125 places, 107/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 10 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 122 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 122 transition count 106
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 119 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 117 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 117 transition count 104
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 20 place count 115 transition count 102
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 115 transition count 102
Applied a total of 22 rules in 23 ms. Remains 115 /125 variables (removed 10) and now considering 102/112 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 115/125 places, 102/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 108
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 105
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 12 place count 118 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 116 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 116 transition count 103
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 20 place count 114 transition count 101
Applied a total of 20 rules in 18 ms. Remains 114 /125 variables (removed 11) and now considering 101/112 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 114/125 places, 101/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 101 transitions.
Finished random walk after 850 steps, including 25 resets, run visited all 1 properties in 5 ms. (steps per millisecond=170 )
FORMULA Parking-PT-208-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 4 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 5 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:37] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 3 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:37] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 111
Applied a total of 2 rules in 4 ms. Remains 124 /125 variables (removed 1) and now considering 111/112 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/125 places, 111/112 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 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 2 rules applied. Total rules applied 2 place count 125 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 123 transition count 108
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 8 place count 121 transition count 108
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 10 place count 120 transition count 107
Applied a total of 10 rules in 14 ms. Remains 120 /125 variables (removed 5) and now considering 107/112 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 120/125 places, 107/112 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 112/112 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 125 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 121 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 121 transition count 104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 117 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 115 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 115 transition count 102
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 22 place count 114 transition count 101
Applied a total of 22 rules in 17 ms. Remains 114 /125 variables (removed 11) and now considering 101/112 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 114/125 places, 101/112 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 111
Applied a total of 2 rules in 3 ms. Remains 124 /125 variables (removed 1) and now considering 111/112 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/125 places, 111/112 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 17 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 9 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 4 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 4 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 110
Applied a total of 4 rules in 4 ms. Remains 123 /125 variables (removed 2) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/125 places, 110/112 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:50:38] [INFO ] Input system was already deterministic with 110 transitions.
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 8 ms
[2023-03-16 19:50:38] [INFO ] Flatten gal took : 7 ms
[2023-03-16 19:50:38] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-16 19:50:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 125 places, 112 transitions and 382 arcs took 2 ms.
Total runtime 5374 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/478/ctl_0_ --ctl=/tmp/478/ctl_1_ --ctl=/tmp/478/ctl_2_ --ctl=/tmp/478/ctl_3_ --ctl=/tmp/478/ctl_4_ --ctl=/tmp/478/ctl_5_ --ctl=/tmp/478/ctl_6_ --ctl=/tmp/478/ctl_7_ --ctl=/tmp/478/ctl_8_ --ctl=/tmp/478/ctl_9_ --ctl=/tmp/478/ctl_10_ --ctl=/tmp/478/ctl_11_ --ctl=/tmp/478/ctl_12_ --ctl=/tmp/478/ctl_13_ --mu-par --mu-opt
FORMULA Parking-PT-208-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Parking-PT-208-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678996470973

--------------------
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 Parking-PT-208-CTLFireability-00
ctl formula formula --ctl=/tmp/478/ctl_0_
ctl formula name Parking-PT-208-CTLFireability-01
ctl formula formula --ctl=/tmp/478/ctl_1_
ctl formula name Parking-PT-208-CTLFireability-02
ctl formula formula --ctl=/tmp/478/ctl_2_
ctl formula name Parking-PT-208-CTLFireability-03
ctl formula formula --ctl=/tmp/478/ctl_3_
ctl formula name Parking-PT-208-CTLFireability-05
ctl formula formula --ctl=/tmp/478/ctl_4_
ctl formula name Parking-PT-208-CTLFireability-06
ctl formula formula --ctl=/tmp/478/ctl_5_
ctl formula name Parking-PT-208-CTLFireability-07
ctl formula formula --ctl=/tmp/478/ctl_6_
ctl formula name Parking-PT-208-CTLFireability-08
ctl formula formula --ctl=/tmp/478/ctl_7_
ctl formula name Parking-PT-208-CTLFireability-09
ctl formula formula --ctl=/tmp/478/ctl_8_
ctl formula name Parking-PT-208-CTLFireability-10
ctl formula formula --ctl=/tmp/478/ctl_9_
ctl formula name Parking-PT-208-CTLFireability-11
ctl formula formula --ctl=/tmp/478/ctl_10_
ctl formula name Parking-PT-208-CTLFireability-12
ctl formula formula --ctl=/tmp/478/ctl_11_
ctl formula name Parking-PT-208-CTLFireability-13
ctl formula formula --ctl=/tmp/478/ctl_12_
ctl formula name Parking-PT-208-CTLFireability-14
ctl formula formula --ctl=/tmp/478/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 125 places, 112 transitions and 382 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 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: 112->89 groups
pnml2lts-sym: Regrouping took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 125; there are 89 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 12702 group checks and 0 next state calls
pnml2lts-sym: reachability took 53.670 real 214.210 user 0.060 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 3514564609 states, 9084 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: 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/478/ctl_1_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/478/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_5_ 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/478/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/478/ctl_8_ does not hold for the initial state
pnml2lts-sym: group_next: 1033 nodes total
pnml2lts-sym: group_explored: 876 nodes, 12583409 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) [0x55bf2e049684]
1: pnml2lts-sym(+0x9b726) [0x55bf2e049726]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2373a89140]
3: /lib/x86_64-linux-gnu/libc.so.6(+0x87870) [0x7f23737c9870]
4: /lib/x86_64-linux-gnu/libpthread.so.0(+0x7ebf) [0x7f2373a7debf]
5: /lib/x86_64-linux-gnu/libc.so.6(clone+0x3f) [0x7f237383ea2f]

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="Parking-PT-208"
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 Parking-PT-208, 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 r265-smll-167863540000418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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