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.r393-oct2-167903716800218.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 ShieldIIPt-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 50K 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 ShieldIIPt-PT-003B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679432646669

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=ShieldIIPt-PT-003B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:04:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 21:04:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:04:09] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-21 21:04:09] [INFO ] Transformed 213 places.
[2023-03-21 21:04:09] [INFO ] Transformed 198 transitions.
[2023-03-21 21:04:09] [INFO ] Found NUPN structural information;
[2023-03-21 21:04:09] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 123 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 190
Applied a total of 16 rules in 57 ms. Remains 205 /213 variables (removed 8) and now considering 190/198 (removed 8) transitions.
// Phase 1: matrix 190 rows 205 cols
[2023-03-21 21:04:09] [INFO ] Computed 28 place invariants in 8 ms
[2023-03-21 21:04:10] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-21 21:04:10] [INFO ] Invariant cache hit.
[2023-03-21 21:04:10] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2023-03-21 21:04:10] [INFO ] Invariant cache hit.
[2023-03-21 21:04:11] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/213 places, 190/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1396 ms. Remains : 205/213 places, 190/198 transitions.
Support contains 123 out of 205 places after structural reductions.
[2023-03-21 21:04:11] [INFO ] Flatten gal took : 127 ms
[2023-03-21 21:04:11] [INFO ] Flatten gal took : 24 ms
[2023-03-21 21:04:11] [INFO ] Input system was already deterministic with 190 transitions.
Support contains 122 out of 205 places (down from 123) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 100) seen :91
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 21:04:12] [INFO ] Invariant cache hit.
[2023-03-21 21:04:12] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 21:04:12] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2023-03-21 21:04:13] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-21 21:04:13] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 7 ms to minimize.
[2023-03-21 21:04:13] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-21 21:04:13] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1073 ms
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-21 21:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-21 21:04:14] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2023-03-21 21:04:15] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-21 21:04:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2023-03-21 21:04:15] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2023-03-21 21:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-21 21:04:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-21 21:04:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2023-03-21 21:04:15] [INFO ] After 2390ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-21 21:04:15] [INFO ] After 2599ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 14 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 190/190 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 205 transition count 156
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 171 transition count 153
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 169 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 81 place count 165 transition count 149
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 81 place count 165 transition count 136
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 107 place count 152 transition count 136
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 123 place count 136 transition count 120
Iterating global reduction 4 with 16 rules applied. Total rules applied 139 place count 136 transition count 120
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 139 place count 136 transition count 112
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 155 place count 128 transition count 112
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 241 place count 85 transition count 69
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 255 place count 78 transition count 73
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 78 transition count 72
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 78 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 77 transition count 71
Applied a total of 259 rules in 62 ms. Remains 77 /205 variables (removed 128) and now considering 71/190 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 77/205 places, 71/190 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 244586 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244586 steps, saw 149682 distinct states, run finished after 3005 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 71 rows 77 cols
[2023-03-21 21:04:19] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-21 21:04:19] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 21:04:19] [INFO ] [Nat]Absence check using 28 positive place invariants in 52 ms returned sat
[2023-03-21 21:04:19] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 21:04:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-21 21:04:19] [INFO ] After 102ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 21:04:19] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-21 21:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2023-03-21 21:04:19] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2023-03-21 21:04:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-21 21:04:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2023-03-21 21:04:19] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2023-03-21 21:04:19] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 12 ms to minimize.
[2023-03-21 21:04:19] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 3 ms to minimize.
[2023-03-21 21:04:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 196 ms
[2023-03-21 21:04:19] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-21 21:04:19] [INFO ] After 885ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 9 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 71/71 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 77 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 75 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 75 transition count 68
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 74 transition count 68
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 71 transition count 65
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 14 place count 70 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 69 transition count 65
Applied a total of 15 rules in 25 ms. Remains 69 /77 variables (removed 8) and now considering 65/71 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 69/77 places, 65/71 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 251816 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251816 steps, saw 144885 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 65 rows 69 cols
[2023-03-21 21:04:23] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-21 21:04:23] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 21:04:23] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2023-03-21 21:04:23] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 21:04:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-21 21:04:23] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 21:04:23] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-21 21:04:23] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-21 21:04:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-21 21:04:23] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-21 21:04:23] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 69/69 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 21:04:23] [INFO ] Invariant cache hit.
[2023-03-21 21:04:23] [INFO ] Implicit Places using invariants in 133 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/69 places, 65/65 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 68 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 64
Applied a total of 2 rules in 4 ms. Remains 67 /68 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 67 cols
[2023-03-21 21:04:23] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-21 21:04:23] [INFO ] Implicit Places using invariants in 128 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/69 places, 64/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 277 ms. Remains : 66/69 places, 64/65 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 220969 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220969 steps, saw 131261 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 64 rows 66 cols
[2023-03-21 21:04:27] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-21 21:04:27] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 21:04:27] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-21 21:04:27] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 21:04:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 21:04:27] [INFO ] After 53ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 21:04:27] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-21 21:04:27] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-21 21:04:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-21 21:04:27] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-21 21:04:27] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 66/66 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-21 21:04:27] [INFO ] Invariant cache hit.
[2023-03-21 21:04:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-21 21:04:27] [INFO ] Invariant cache hit.
[2023-03-21 21:04:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 21:04:28] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-21 21:04:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 21:04:28] [INFO ] Invariant cache hit.
[2023-03-21 21:04:28] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 517 ms. Remains : 66/66 places, 64/64 transitions.
Graph (complete) has 165 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 65 transition count 64
Applied a total of 9 rules in 12 ms. Remains 65 /66 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 64 rows 65 cols
[2023-03-21 21:04:28] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-21 21:04:28] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 21:04:28] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-21 21:04:28] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 21:04:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 21:04:28] [INFO ] After 87ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 21:04:28] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-21 21:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-21 21:04:28] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-21 21:04:28] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA ShieldIIPt-PT-003B-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 21:04:28] [INFO ] Flatten gal took : 10 ms
[2023-03-21 21:04:28] [INFO ] Flatten gal took : 28 ms
[2023-03-21 21:04:28] [INFO ] Input system was already deterministic with 190 transitions.
Computed a total of 55 stabilizing places and 55 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Applied a total of 44 rules in 7 ms. Remains 183 /205 variables (removed 22) and now considering 168/190 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 183/205 places, 168/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 8 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 165
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 178 transition count 163
Applied a total of 54 rules in 11 ms. Remains 178 /205 variables (removed 27) and now considering 163/190 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 178/205 places, 163/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 7 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 167
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Applied a total of 50 rules in 10 ms. Remains 180 /205 variables (removed 25) and now considering 165/190 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 180/205 places, 165/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 7 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 166
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 179 transition count 164
Applied a total of 52 rules in 13 ms. Remains 179 /205 variables (removed 26) and now considering 164/190 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 179/205 places, 164/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 204 transition count 151
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 79 place count 166 transition count 148
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 164 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 163 transition count 147
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 83 place count 163 transition count 134
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 109 place count 150 transition count 134
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 127 place count 132 transition count 116
Iterating global reduction 4 with 18 rules applied. Total rules applied 145 place count 132 transition count 116
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 145 place count 132 transition count 105
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 167 place count 121 transition count 105
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 243 place count 83 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 81 transition count 65
Applied a total of 245 rules in 24 ms. Remains 81 /205 variables (removed 124) and now considering 65/190 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 81/205 places, 65/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 167
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Applied a total of 50 rules in 12 ms. Remains 180 /205 variables (removed 25) and now considering 165/190 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 180/205 places, 165/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 182 transition count 167
Applied a total of 46 rules in 7 ms. Remains 182 /205 variables (removed 23) and now considering 167/190 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 182/205 places, 167/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 167
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Applied a total of 50 rules in 11 ms. Remains 180 /205 variables (removed 25) and now considering 165/190 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 180/205 places, 165/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 204 transition count 147
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 87 place count 162 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 160 transition count 144
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 89 place count 160 transition count 130
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 117 place count 146 transition count 130
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 135 place count 128 transition count 112
Iterating global reduction 3 with 18 rules applied. Total rules applied 153 place count 128 transition count 112
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 153 place count 128 transition count 101
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 175 place count 117 transition count 101
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 267 place count 71 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 69 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 67 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 271 place count 67 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 66 transition count 52
Applied a total of 273 rules in 37 ms. Remains 66 /205 variables (removed 139) and now considering 52/190 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 66/205 places, 52/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 52 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA ShieldIIPt-PT-003B-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 204 transition count 145
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 160 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 158 transition count 142
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 129
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 119 place count 145 transition count 129
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 135 place count 129 transition count 113
Iterating global reduction 3 with 16 rules applied. Total rules applied 151 place count 129 transition count 113
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 151 place count 129 transition count 102
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 173 place count 118 transition count 102
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 267 place count 71 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 69 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 67 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 271 place count 67 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 66 transition count 52
Applied a total of 273 rules in 20 ms. Remains 66 /205 variables (removed 139) and now considering 52/190 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 66/205 places, 52/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 2 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 9 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 52 transitions.
Finished random walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
FORMULA ShieldIIPt-PT-003B-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 204 transition count 150
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 165 transition count 147
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 163 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 161 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 87 place count 161 transition count 131
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 115 place count 147 transition count 131
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 131 place count 131 transition count 115
Iterating global reduction 4 with 16 rules applied. Total rules applied 147 place count 131 transition count 115
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 147 place count 131 transition count 106
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 165 place count 122 transition count 106
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 249 place count 80 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 80 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 78 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 76 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 254 place count 76 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 75 transition count 61
Applied a total of 256 rules in 21 ms. Remains 75 /205 variables (removed 130) and now considering 61/190 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 75/205 places, 61/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Applied a total of 44 rules in 5 ms. Remains 183 /205 variables (removed 22) and now considering 168/190 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 183/205 places, 168/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 204 transition count 152
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 167 transition count 149
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 82 place count 165 transition count 146
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 162 transition count 146
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 85 place count 162 transition count 133
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 111 place count 149 transition count 133
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 126 place count 134 transition count 118
Iterating global reduction 4 with 15 rules applied. Total rules applied 141 place count 134 transition count 118
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 141 place count 134 transition count 108
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 161 place count 124 transition count 108
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 249 place count 80 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 80 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 78 transition count 62
Applied a total of 252 rules in 17 ms. Remains 78 /205 variables (removed 127) and now considering 62/190 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 78/205 places, 62/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 3 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 190 transition count 175
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 190 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 189 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 189 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 188 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 188 transition count 173
Applied a total of 34 rules in 7 ms. Remains 188 /205 variables (removed 17) and now considering 173/190 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 188/205 places, 173/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 6 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Applied a total of 44 rules in 5 ms. Remains 183 /205 variables (removed 22) and now considering 168/190 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 183/205 places, 168/190 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 5 ms
[2023-03-21 21:04:29] [INFO ] Input system was already deterministic with 168 transitions.
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 7 ms
[2023-03-21 21:04:29] [INFO ] Flatten gal took : 8 ms
[2023-03-21 21:04:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-21 21:04:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 190 transitions and 476 arcs took 14 ms.
Total runtime 20254 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/622/ctl_0_ --ctl=/tmp/622/ctl_1_ --ctl=/tmp/622/ctl_2_ --ctl=/tmp/622/ctl_3_ --ctl=/tmp/622/ctl_4_ --ctl=/tmp/622/ctl_5_ --ctl=/tmp/622/ctl_6_ --ctl=/tmp/622/ctl_7_ --ctl=/tmp/622/ctl_8_ --ctl=/tmp/622/ctl_9_ --ctl=/tmp/622/ctl_10_ --ctl=/tmp/622/ctl_11_ --ctl=/tmp/622/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393220 kB
MemFree: 278692 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16091636 kB
FORMULA ShieldIIPt-PT-003B-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-003B-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-02
FORMULA ShieldIIPt-PT-003B-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-04
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-05
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-07
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-08
Could not compute solution for formula : ShieldIIPt-PT-003B-CTLFireability-11
FORMULA ShieldIIPt-PT-003B-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-003B-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-003B-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-003B-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679436241326

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ShieldIIPt-PT-003B-CTLFireability-00
ctl formula formula --ctl=/tmp/622/ctl_0_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-01
ctl formula formula --ctl=/tmp/622/ctl_1_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-02
ctl formula formula --ctl=/tmp/622/ctl_2_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-03
ctl formula formula --ctl=/tmp/622/ctl_3_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-04
ctl formula formula --ctl=/tmp/622/ctl_4_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-05
ctl formula formula --ctl=/tmp/622/ctl_5_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-07
ctl formula formula --ctl=/tmp/622/ctl_6_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-08
ctl formula formula --ctl=/tmp/622/ctl_7_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-11
ctl formula formula --ctl=/tmp/622/ctl_8_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-12
ctl formula formula --ctl=/tmp/622/ctl_9_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-13
ctl formula formula --ctl=/tmp/622/ctl_10_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-14
ctl formula formula --ctl=/tmp/622/ctl_11_
ctl formula name ShieldIIPt-PT-003B-CTLFireability-15
ctl formula formula --ctl=/tmp/622/ctl_12_
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 205 places, 190 transitions and 476 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 190->190 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 205; there are 190 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: Exploration took 174921 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.060 real 4.240 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 2.51187446278079e+18 states, 8044 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/622/ctl_1_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: 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: 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/622/ctl_3_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/622/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/622/ctl_11_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/622/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: 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/622/ctl_10_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: 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: 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: 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: 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: 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/622/ctl_9_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: 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: 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
Killing (15) : 628
Killing (9) : 628

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="ShieldIIPt-PT-003B"
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 ShieldIIPt-PT-003B, 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 r393-oct2-167903716800218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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