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.r490-tall-167912708600410.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 marciexred
Input is Szymanski-PT-a04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 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 101K 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 Szymanski-PT-a04-CTLFireability-00
FORMULA_NAME Szymanski-PT-a04-CTLFireability-01
FORMULA_NAME Szymanski-PT-a04-CTLFireability-02
FORMULA_NAME Szymanski-PT-a04-CTLFireability-03
FORMULA_NAME Szymanski-PT-a04-CTLFireability-04
FORMULA_NAME Szymanski-PT-a04-CTLFireability-05
FORMULA_NAME Szymanski-PT-a04-CTLFireability-06
FORMULA_NAME Szymanski-PT-a04-CTLFireability-07
FORMULA_NAME Szymanski-PT-a04-CTLFireability-08
FORMULA_NAME Szymanski-PT-a04-CTLFireability-09
FORMULA_NAME Szymanski-PT-a04-CTLFireability-10
FORMULA_NAME Szymanski-PT-a04-CTLFireability-11
FORMULA_NAME Szymanski-PT-a04-CTLFireability-12
FORMULA_NAME Szymanski-PT-a04-CTLFireability-13
FORMULA_NAME Szymanski-PT-a04-CTLFireability-14
FORMULA_NAME Szymanski-PT-a04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679253925151

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:25:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 19:25:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:25:26] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-19 19:25:26] [INFO ] Transformed 61 places.
[2023-03-19 19:25:26] [INFO ] Transformed 224 transitions.
[2023-03-19 19:25:26] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-a04-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Applied a total of 2 rules in 12 ms. Remains 47 /49 variables (removed 2) and now considering 216/216 (removed 0) transitions.
[2023-03-19 19:25:26] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 47 cols
[2023-03-19 19:25:26] [INFO ] Computed 1 place invariants in 8 ms
[2023-03-19 19:25:26] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-19 19:25:26] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:25:27] [INFO ] Invariant cache hit.
[2023-03-19 19:25:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:25:27] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-19 19:25:27] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:25:27] [INFO ] Invariant cache hit.
[2023-03-19 19:25:27] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 47/49 places, 216/216 transitions.
Support contains 42 out of 47 places after structural reductions.
[2023-03-19 19:25:27] [INFO ] Flatten gal took : 36 ms
[2023-03-19 19:25:27] [INFO ] Flatten gal took : 15 ms
[2023-03-19 19:25:27] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 62) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-19 19:25:27] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:25:27] [INFO ] Invariant cache hit.
[2023-03-19 19:25:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:25:28] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:16
[2023-03-19 19:25:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:25:28] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-19 19:25:28] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-19 19:25:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:25:28] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :17
[2023-03-19 19:25:28] [INFO ] After 74ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :3 sat :17
[2023-03-19 19:25:28] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :17
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-19 19:25:28] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :17
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 18 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 42 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 42 transition count 180
Applied a total of 26 rules in 22 ms. Remains 42 /47 variables (removed 5) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 42/47 places, 180/216 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Probabilistic random walk after 1000001 steps, saw 524723 distinct states, run finished after 1322 ms. (steps per millisecond=756 ) properties seen :16
Running SMT prover for 1 properties.
[2023-03-19 19:25:30] [INFO ] Flow matrix only has 70 transitions (discarded 110 similar events)
// Phase 1: matrix 70 rows 42 cols
[2023-03-19 19:25:30] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-19 19:25:30] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:25:30] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 19:25:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:25:30] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:25:30] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:25:30] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:25:30] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:25:30] [INFO ] After 3ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 19:25:30] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 19:25:30] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 180/180 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 41 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 41 transition count 174
Applied a total of 4 rules in 13 ms. Remains 41 /42 variables (removed 1) and now considering 174/180 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 41/42 places, 174/180 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2621320 steps, run timeout after 3001 ms. (steps per millisecond=873 ) properties seen :{}
Probabilistic random walk after 2621320 steps, saw 1205064 distinct states, run finished after 3003 ms. (steps per millisecond=872 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 19:25:33] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
// Phase 1: matrix 67 rows 41 cols
[2023-03-19 19:25:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 19:25:33] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:25:33] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 19:25:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:25:33] [INFO ] After 4ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:25:33] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:25:33] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:25:33] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:25:33] [INFO ] After 3ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 19:25:33] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 19:25:33] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 41/41 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-19 19:25:33] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 19:25:33] [INFO ] Invariant cache hit.
[2023-03-19 19:25:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 19:25:33] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 19:25:33] [INFO ] Invariant cache hit.
[2023-03-19 19:25:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:25:33] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-19 19:25:33] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 19:25:33] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 19:25:33] [INFO ] Invariant cache hit.
[2023-03-19 19:25:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 41/41 places, 174/174 transitions.
Graph (trivial) has 131 edges and 41 vertex of which 22 / 41 are part of one of the 5 SCC in 2 ms
Free SCC test removed 17 places
Drop transitions removed 95 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 132 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 24 transition count 37
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 19 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 18 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 18 transition count 36
Applied a total of 14 rules in 35 ms. Remains 18 /41 variables (removed 23) and now considering 36/174 (removed 138) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 18 cols
[2023-03-19 19:25:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 19:25:33] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:25:33] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 19:25:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 19:25:33] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:25:33] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:25:33] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:25:33] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:25:33] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 19:25:33] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 19:25:33] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 20 ms
[2023-03-19 19:25:33] [INFO ] Input system was already deterministic with 216 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:25:33] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:25:33] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 41 transition count 176
Applied a total of 28 rules in 15 ms. Remains 41 /47 variables (removed 6) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 41/47 places, 176/216 transitions.
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:25:33] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 13 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:33] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:33] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 11 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:25:33] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 172 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4643 steps, run visited all 1 properties in 12 ms. (steps per millisecond=386 )
Probabilistic random walk after 4643 steps, saw 3386 distinct states, run finished after 12 ms. (steps per millisecond=386 ) properties seen :1
FORMULA Szymanski-PT-a04-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 42 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 180
Applied a total of 24 rules in 11 ms. Remains 41 /47 variables (removed 6) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 41/47 places, 180/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 208
Applied a total of 4 rules in 2 ms. Remains 45 /47 variables (removed 2) and now considering 208/216 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/47 places, 208/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 11 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 4 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 204
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/47 places, 204/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 1 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 42 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 42 transition count 180
Applied a total of 26 rules in 10 ms. Remains 42 /47 variables (removed 5) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 42/47 places, 180/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 208
Applied a total of 4 rules in 1 ms. Remains 45 /47 variables (removed 2) and now considering 208/216 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/47 places, 208/216 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:25:34] [INFO ] Input system was already deterministic with 208 transitions.
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:25:34] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-19 19:25:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 216 transitions and 860 arcs took 1 ms.
Total runtime 7971 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 47 NrTr: 216 NrArc: 860)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.685sec


RS generation: 0m 1.286sec


-> reachability set: #nodes 1622 (1.6e+03) #states 87,423,102 (7)



starting MCC model checker
--------------------------

checking: EF [AX [AX [1<=0]]]
normalized: E [true U ~ [EX [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
..-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.914sec

checking: AF [AG [[p0<=0 | p28<=0]]]
normalized: ~ [EG [E [true U ~ [[p0<=0 | p28<=0]]]]]

abstracting: (p28<=0)
states: 71,041,505 (7)
abstracting: (p0<=0)
states: 85,025,714 (7)
....
EG iterations: 4
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.807sec

checking: AG [EF [AG [[1<=p1 & 1<=p13]]]]
normalized: ~ [E [true U ~ [E [true U ~ [E [true U ~ [[1<=p1 & 1<=p13]]]]]]]]

abstracting: (1<=p13)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: AG [EX [EX [[p1<=0 | p15<=0]]]]
normalized: ~ [E [true U ~ [EX [EX [[p1<=0 | p15<=0]]]]]]

abstracting: (p15<=0)
states: 71,041,505 (7)
abstracting: (p1<=0)
states: 53,748,207 (7)
..-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.940sec

checking: AF [[EF [[1<=p2 & 1<=p45]] | [1<=p2 & 1<=p12]]]
normalized: ~ [EG [~ [[E [true U [1<=p2 & 1<=p45]] | [1<=p2 & 1<=p12]]]]]

abstracting: (1<=p12)
states: 18,529,493 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p45)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.568sec

checking: EX [EG [EF [[EG [[1<=p2 & 1<=p43]] | [AX [[1<=p0 & 1<=p24]] | EF [[1<=p3 & 1<=p43]]]]]]]
normalized: EX [EG [E [true U [[E [true U [1<=p3 & 1<=p43]] | ~ [EX [~ [[1<=p0 & 1<=p24]]]]] | EG [[1<=p2 & 1<=p43]]]]]]

abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.
EG iterations: 1
abstracting: (1<=p24)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
.abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)

EG iterations: 0
.-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.349sec

checking: E [EG [~ [A [~ [[1<=p0 & 1<=p16]] U AF [[1<=p2 & 1<=p39]]]]] U [[1<=p2 & 1<=p45] | [1<=p1 & 1<=p38]]]
normalized: E [EG [~ [[~ [EG [EG [~ [[1<=p2 & 1<=p39]]]]] & ~ [E [EG [~ [[1<=p2 & 1<=p39]]] U [[1<=p0 & 1<=p16] & EG [~ [[1<=p2 & 1<=p39]]]]]]]]] U [[1<=p1 & 1<=p38] | [1<=p2 & 1<=p45]]]

abstracting: (1<=p45)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p38)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p39)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
..
EG iterations: 2
abstracting: (1<=p16)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p39)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
..
EG iterations: 2
abstracting: (1<=p39)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.082sec

checking: EF [[~ [E [E [[1<=p1 & 1<=p35] U [1<=p3 & 1<=p23]] U [[1<=p7 & 1<=p11] | ~ [[1<=p1 & 1<=p35]]]]] | AG [[p3<=0 | p36<=0]]]]
normalized: E [true U [~ [E [true U ~ [[p3<=0 | p36<=0]]]] | ~ [E [E [[1<=p1 & 1<=p35] U [1<=p3 & 1<=p23]] U [~ [[1<=p1 & 1<=p35]] | [1<=p7 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 5,426,927 (6)
abstracting: (1<=p7)
states: 54,274 (4)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (p36<=0)
states: 71,816,045 (7)
abstracting: (p3<=0)
states: 85,027,255 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.520sec

checking: AG [[AX [[p3<=0 | p29<=0]] | [~ [E [[1<=p0 & 1<=p42] U [EF [~ [[p2<=0 | p31<=0]]] & EF [[1<=p2 & 1<=p19]]]]] | EX [[p0<=0 | p26<=0]]]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [[p3<=0 | p29<=0]]]] | [~ [E [[1<=p0 & 1<=p42] U [E [true U ~ [[p2<=0 | p31<=0]]] & E [true U [1<=p2 & 1<=p19]]]]] | EX [[p0<=0 | p26<=0]]]]]]]

abstracting: (p26<=0)
states: 71,041,505 (7)
abstracting: (p0<=0)
states: 85,025,714 (7)
.abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (p31<=0)
states: 71,816,045 (7)
abstracting: (p2<=0)
states: 53,739,353 (7)
abstracting: (1<=p42)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (p29<=0)
states: 71,829,479 (7)
abstracting: (p3<=0)
states: 85,027,255 (7)
.-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.337sec

checking: EG [[[1<=p38 & 1<=p1] | [EF [[1<=p2 & 1<=p45]] & E [[AX [[1<=p3 & 1<=p31]] | [AX [[1<=p1 & 1<=p19]] | ~ [[1<=p1 & 1<=p27]]]] U E [EG [[1<=p2 & 1<=p43]] U AX [[1<=p2 & 1<=p42]]]]]]]
normalized: EG [[[E [[[~ [[1<=p1 & 1<=p27]] | ~ [EX [~ [[1<=p1 & 1<=p19]]]]] | ~ [EX [~ [[1<=p3 & 1<=p31]]]]] U E [EG [[1<=p2 & 1<=p43]] U ~ [EX [~ [[1<=p2 & 1<=p42]]]]]] & E [true U [1<=p2 & 1<=p45]]] | [1<=p38 & 1<=p1]]]

abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p38)
states: 15,607,057 (7)
abstracting: (1<=p45)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p42)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.
EG iterations: 1
abstracting: (1<=p31)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
.abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
.abstracting: (1<=p27)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a04-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.187sec

checking: [~ [A [[[1<=p1 & 1<=p13] | ~ [[1<=p1 & 1<=p37]]] U [EF [[1<=p3 & 1<=p43]] | EX [EX [[1<=p3 & 1<=p26]]]]]] & EF [[EG [[p1<=0 | p38<=0]] | [EX [[p2<=0 | p31<=0]] | AG [[p1<=0 | p26<=0]]]]]]
normalized: [E [true U [EG [[p1<=0 | p38<=0]] | [EX [[p2<=0 | p31<=0]] | ~ [E [true U ~ [[p1<=0 | p26<=0]]]]]]] & ~ [[~ [EG [~ [[EX [EX [[1<=p3 & 1<=p26]]] | E [true U [1<=p3 & 1<=p43]]]]]] & ~ [E [~ [[EX [EX [[1<=p3 & 1<=p26]]] | E [true U [1<=p3 & 1<=p43]]]] U [~ [[~ [[1<=p1 & 1<=p37]] | [1<=p1 & 1<=p13]]] & ~ [[EX [EX [[1<=p3 & 1<=p26]]] | E [true U [1<=p3 & 1<=p43]]]]]]]]]]

abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p26)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
..abstracting: (1<=p13)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p37)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p26)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
..abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p26)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
....
EG iterations: 2
abstracting: (p26<=0)
states: 71,041,505 (7)
abstracting: (p1<=0)
states: 53,748,207 (7)
abstracting: (p31<=0)
states: 71,816,045 (7)
abstracting: (p2<=0)
states: 53,739,353 (7)
.abstracting: (p38<=0)
states: 71,816,045 (7)
abstracting: (p1<=0)
states: 53,748,207 (7)
..
EG iterations: 2
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.487sec

checking: E [~ [AG [~ [[p2<=0 | p31<=0]]]] U AG [[~ [EX [[1<=p2 & 1<=p42]]] & [EF [[[1<=p2 & 1<=p14] & [1<=p2 & 1<=p32]]] & A [[1<=p0 & 1<=p29] U [[[1<=p0 & 1<=p26] & [1<=p0 & 1<=p30]] | AX [[1<=p1 & 1<=p16]]]]]]]]
normalized: E [E [true U [p2<=0 | p31<=0]] U ~ [E [true U ~ [[[[~ [EG [~ [[~ [EX [~ [[1<=p1 & 1<=p16]]]] | [[1<=p0 & 1<=p30] & [1<=p0 & 1<=p26]]]]]] & ~ [E [~ [[~ [EX [~ [[1<=p1 & 1<=p16]]]] | [[1<=p0 & 1<=p30] & [1<=p0 & 1<=p26]]]] U [~ [[1<=p0 & 1<=p29]] & ~ [[~ [EX [~ [[1<=p1 & 1<=p16]]]] | [[1<=p0 & 1<=p30] & [1<=p0 & 1<=p26]]]]]]]] & E [true U [[1<=p2 & 1<=p32] & [1<=p2 & 1<=p14]]]] & ~ [EX [[1<=p2 & 1<=p42]]]]]]]]

abstracting: (1<=p42)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p14)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p32)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p26)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p30)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p16)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
.abstracting: (1<=p29)
states: 15,593,623 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p26)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p30)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p16)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
.abstracting: (1<=p26)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p30)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p16)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
...
EG iterations: 2
abstracting: (p31<=0)
states: 71,816,045 (7)
abstracting: (p2<=0)
states: 53,739,353 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.294sec

checking: EF [[[AX [[1<=p0 & 1<=p34]] & 1<=p1] & [1<=p19 & [[[A [AG [[1<=p2 & 1<=p10]] U [1<=p0 & 1<=p35]] | p0<=0] | [p35<=0 | [1<=p3 & 1<=p13]]] | [[[1<=p3 & 1<=p23] | [1<=p0 & 1<=p23]] | [[1<=p3 & 1<=p9] | [[1<=p2 & 1<=p35] | [1<=p2 & 1<=p43]]]]]]]]
normalized: E [true U [[1<=p19 & [[[[[1<=p2 & 1<=p43] | [1<=p2 & 1<=p35]] | [1<=p3 & 1<=p9]] | [[1<=p0 & 1<=p23] | [1<=p3 & 1<=p23]]] | [[p35<=0 | [1<=p3 & 1<=p13]] | [p0<=0 | [~ [EG [~ [[1<=p0 & 1<=p35]]]] & ~ [E [~ [[1<=p0 & 1<=p35]] U [E [true U ~ [[1<=p2 & 1<=p10]]] & ~ [[1<=p0 & 1<=p35]]]]]]]]]] & [1<=p1 & ~ [EX [~ [[1<=p0 & 1<=p34]]]]]]]

abstracting: (1<=p34)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
.abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
..
EG iterations: 2
abstracting: (p0<=0)
states: 85,025,714 (7)
abstracting: (1<=p13)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (p35<=0)
states: 71,816,045 (7)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p9)
states: 5,318,769 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p43)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p19)
states: 16,381,597 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: [A [EX [~ [[[[p3<=0 | p36<=0] & AF [[1<=p1 & 1<=p8]]] | EX [[1<=p3 & 1<=p42]]]]] U [~ [[A [[1<=p2 & 1<=p17] U [[1<=p3 & 1<=p35] & [1<=p3 & 1<=p10]]] & [AX [[1<=p2 & 1<=p42]] | EG [[1<=p3 & 1<=p19]]]]] & [[[[AG [[1<=p0 & 1<=p13]] & [1<=p1 & 1<=p23]] | [AX [[1<=p2 & 1<=p25]] & [1<=p3 & 1<=p17]]] | [AG [[1<=p0 & 1<=p9]] | AX [E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p9]]]]] | [[[1<=p1 & 1<=p21] | [1<=p1 & 1<=p46]] | [[[1<=p3 & 1<=p14] & [1<=p0 & 1<=p27]] | [[1<=p1 & 1<=p19] | [1<=p3 & 1<=p23]]]]]]] & AF [AX [E [E [[1<=p6 & 1<=p11] U [1<=p3 & 1<=p24]] U ~ [[1<=p2 & 1<=p13]]]]]]
normalized: [~ [EG [EX [~ [E [E [[1<=p6 & 1<=p11] U [1<=p3 & 1<=p24]] U ~ [[1<=p2 & 1<=p13]]]]]]] & [~ [EG [~ [[[[[[[1<=p3 & 1<=p23] | [1<=p1 & 1<=p19]] | [[1<=p0 & 1<=p27] & [1<=p3 & 1<=p14]]] | [[1<=p1 & 1<=p46] | [1<=p1 & 1<=p21]]] | [[~ [EX [~ [E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p9]]]]] | ~ [E [true U ~ [[1<=p0 & 1<=p9]]]]] | [[[1<=p3 & 1<=p17] & ~ [EX [~ [[1<=p2 & 1<=p25]]]]] | [[1<=p1 & 1<=p23] & ~ [E [true U ~ [[1<=p0 & 1<=p13]]]]]]]] & ~ [[[EG [[1<=p3 & 1<=p19]] | ~ [EX [~ [[1<=p2 & 1<=p42]]]]] & [~ [EG [~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]]]] & ~ [E [~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]] U [~ [[1<=p2 & 1<=p17]] & ~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]]]]]]]]]]]] & ~ [E [~ [[[[[[[1<=p3 & 1<=p23] | [1<=p1 & 1<=p19]] | [[1<=p0 & 1<=p27] & [1<=p3 & 1<=p14]]] | [[1<=p1 & 1<=p46] | [1<=p1 & 1<=p21]]] | [[~ [EX [~ [E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p9]]]]] | ~ [E [true U ~ [[1<=p0 & 1<=p9]]]]] | [[[1<=p3 & 1<=p17] & ~ [EX [~ [[1<=p2 & 1<=p25]]]]] | [[1<=p1 & 1<=p23] & ~ [E [true U ~ [[1<=p0 & 1<=p13]]]]]]]] & ~ [[[EG [[1<=p3 & 1<=p19]] | ~ [EX [~ [[1<=p2 & 1<=p42]]]]] & [~ [EG [~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]]]] & ~ [E [~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]] U [~ [[1<=p2 & 1<=p17]] & ~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]]]]]]]]]] U [~ [EX [~ [[EX [[1<=p3 & 1<=p42]] | [~ [EG [~ [[1<=p1 & 1<=p8]]]] & [p3<=0 | p36<=0]]]]]] & ~ [[[[[[[1<=p3 & 1<=p23] | [1<=p1 & 1<=p19]] | [[1<=p0 & 1<=p27] & [1<=p3 & 1<=p14]]] | [[1<=p1 & 1<=p46] | [1<=p1 & 1<=p21]]] | [[~ [EX [~ [E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p9]]]]] | ~ [E [true U ~ [[1<=p0 & 1<=p9]]]]] | [[[1<=p3 & 1<=p17] & ~ [EX [~ [[1<=p2 & 1<=p25]]]]] | [[1<=p1 & 1<=p23] & ~ [E [true U ~ [[1<=p0 & 1<=p13]]]]]]]] & ~ [[[EG [[1<=p3 & 1<=p19]] | ~ [EX [~ [[1<=p2 & 1<=p42]]]]] & [~ [EG [~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]]]] & ~ [E [~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]] U [~ [[1<=p2 & 1<=p17]] & ~ [[[1<=p3 & 1<=p10] & [1<=p3 & 1<=p35]]]]]]]]]]]]]]]]

abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p17)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
..
EG iterations: 2
abstracting: (1<=p42)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
.......
EG iterations: 7
abstracting: (1<=p13)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p25)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p17)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p9)
states: 5,318,769 (6)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p9)
states: 5,318,769 (6)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p44)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
.abstracting: (1<=p21)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p46)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p14)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p27)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (p36<=0)
states: 71,816,045 (7)
abstracting: (p3<=0)
states: 85,027,255 (7)
abstracting: (1<=p8)
states: 2,950,727 (6)
abstracting: (1<=p1)
states: 33,674,895 (7)
..
EG iterations: 2
abstracting: (1<=p42)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
..abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p17)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
..
EG iterations: 2
abstracting: (1<=p42)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
.......
EG iterations: 7
abstracting: (1<=p13)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p25)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p17)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p9)
states: 5,318,769 (6)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p9)
states: 5,318,769 (6)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p44)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
.abstracting: (1<=p21)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p46)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p14)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p27)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p17)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p35)
states: 15,607,057 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p10)
states: 5,322,269 (6)
abstracting: (1<=p3)
states: 2,395,847 (6)
..
EG iterations: 2
abstracting: (1<=p42)
states: 15,607,057 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
.......
EG iterations: 7
abstracting: (1<=p13)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p25)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
.abstracting: (1<=p17)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p9)
states: 5,318,769 (6)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p9)
states: 5,318,769 (6)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p44)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
.abstracting: (1<=p21)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p46)
states: 15,607,057 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p14)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p27)
states: 16,381,597 (7)
abstracting: (1<=p0)
states: 2,397,388 (6)
abstracting: (1<=p19)
states: 16,381,597 (7)
abstracting: (1<=p1)
states: 33,674,895 (7)
abstracting: (1<=p23)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
..
EG iterations: 2
abstracting: (1<=p13)
states: 16,381,597 (7)
abstracting: (1<=p2)
states: 33,683,749 (7)
abstracting: (1<=p24)
states: 16,381,597 (7)
abstracting: (1<=p3)
states: 2,395,847 (6)
abstracting: (1<=p11)
states: 5,426,927 (6)
abstracting: (1<=p6)
states: 1,212,392 (6)
...
EG iterations: 2
-> the formula is FALSE

FORMULA Szymanski-PT-a04-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.902sec

totally nodes used: 2417257 (2.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 54051950 31765972 85817922
used/not used/entry size/cache size: 26014158 41094706 16 1024MB
basic ops cache: hits/miss/sum: 4558923 2112851 6671774
used/not used/entry size/cache size: 3528479 13248737 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 29031 19853 48884
used/not used/entry size/cache size: 19838 8368770 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64776500
1 2268863
2 58616
3 2854
4 444
5 179
6 177
7 192
8 88
9 61
>= 10 890

Total processing time: 0m16.514sec


BK_STOP 1679253957833

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

2209
iterations count:168979 (782), effective:4203 (19)

initing FirstDep: 0m 0.000sec


iterations count:31771 (147), effective:360 (1)

iterations count:38683 (179), effective:502 (2)

iterations count:1259 (5), effective:7 (0)

iterations count:216 (1), effective:0 (0)

iterations count:38583 (178), effective:412 (1)

iterations count:28532 (132), effective:313 (1)

iterations count:59729 (276), effective:686 (3)

iterations count:24789 (114), effective:249 (1)

iterations count:32478 (150), effective:391 (1)

iterations count:31048 (143), effective:364 (1)

iterations count:360 (1), effective:1 (0)

iterations count:360 (1), effective:1 (0)

iterations count:47604 (220), effective:547 (2)

iterations count:1543 (7), effective:25 (0)

iterations count:5061 (23), effective:81 (0)

iterations count:16741 (77), effective:156 (0)

iterations count:216 (1), effective:0 (0)

iterations count:28532 (132), effective:313 (1)

iterations count:764 (3), effective:11 (0)

iterations count:31290 (144), effective:391 (1)

iterations count:59729 (276), effective:686 (3)

iterations count:59729 (276), effective:686 (3)

iterations count:22312 (103), effective:211 (0)

iterations count:59729 (276), effective:686 (3)

iterations count:30122 (139), effective:420 (1)

iterations count:216 (1), effective:0 (0)

iterations count:18311 (84), effective:213 (0)

iterations count:265 (1), effective:4 (0)

iterations count:874 (4), effective:9 (0)

iterations count:706 (3), effective:8 (0)

iterations count:318 (1), effective:5 (0)

iterations count:216 (1), effective:0 (0)

iterations count:450 (2), effective:8 (0)

iterations count:228 (1), effective:3 (0)

iterations count:224 (1), effective:4 (0)

iterations count:359 (1), effective:1 (0)

iterations count:450 (2), effective:8 (0)

iterations count:228 (1), effective:3 (0)

iterations count:224 (1), effective:4 (0)

iterations count:359 (1), effective:1 (0)

iterations count:37840 (175), effective:604 (2)

iterations count:450 (2), effective:8 (0)

iterations count:228 (1), effective:3 (0)

iterations count:224 (1), effective:4 (0)

iterations count:359 (1), effective:1 (0)

iterations count:216 (1), effective:0 (0)

iterations count:216 (1), effective:0 (0)

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="Szymanski-PT-a04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Szymanski-PT-a04, 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 r490-tall-167912708600410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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