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-167912708600418.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-a06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 12K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:59 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-a06-CTLFireability-00
FORMULA_NAME Szymanski-PT-a06-CTLFireability-01
FORMULA_NAME Szymanski-PT-a06-CTLFireability-02
FORMULA_NAME Szymanski-PT-a06-CTLFireability-03
FORMULA_NAME Szymanski-PT-a06-CTLFireability-04
FORMULA_NAME Szymanski-PT-a06-CTLFireability-05
FORMULA_NAME Szymanski-PT-a06-CTLFireability-06
FORMULA_NAME Szymanski-PT-a06-CTLFireability-07
FORMULA_NAME Szymanski-PT-a06-CTLFireability-08
FORMULA_NAME Szymanski-PT-a06-CTLFireability-09
FORMULA_NAME Szymanski-PT-a06-CTLFireability-10
FORMULA_NAME Szymanski-PT-a06-CTLFireability-11
FORMULA_NAME Szymanski-PT-a06-CTLFireability-12
FORMULA_NAME Szymanski-PT-a06-CTLFireability-13
FORMULA_NAME Szymanski-PT-a06-CTLFireability-14
FORMULA_NAME Szymanski-PT-a06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679254289699

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-a06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:31:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 19:31:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:31:31] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-19 19:31:31] [INFO ] Transformed 61 places.
[2023-03-19 19:31:31] [INFO ] Transformed 224 transitions.
[2023-03-19 19:31:31] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 8 transitions.
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 14 ms. Remains 47 /49 variables (removed 2) and now considering 216/216 (removed 0) transitions.
[2023-03-19 19:31:31] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 47 cols
[2023-03-19 19:31:31] [INFO ] Computed 1 place invariants in 13 ms
[2023-03-19 19:31:31] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-19 19:31:31] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:31:31] [INFO ] Invariant cache hit.
[2023-03-19 19:31:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:31:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-19 19:31:31] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:31:31] [INFO ] Invariant cache hit.
[2023-03-19 19:31:31] [INFO ] Dead Transitions using invariants and state equation in 90 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 386 ms. Remains : 47/49 places, 216/216 transitions.
Support contains 42 out of 47 places after structural reductions.
[2023-03-19 19:31:31] [INFO ] Flatten gal took : 34 ms
[2023-03-19 19:31:31] [INFO ] Flatten gal took : 15 ms
[2023-03-19 19:31:31] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 76) seen :41
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) 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 35) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-19 19:31:32] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:31:32] [INFO ] Invariant cache hit.
[2023-03-19 19:31:32] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:31:32] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :3 sat :3 real:16
[2023-03-19 19:31:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:31:32] [INFO ] After 16ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :3 sat :0 real:19
[2023-03-19 19:31:32] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:19
[2023-03-19 19:31:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:31:32] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :18
[2023-03-19 19:31:32] [INFO ] After 65ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :4 sat :18
[2023-03-19 19:31:32] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :18
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-19 19:31:32] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :18
Fused 22 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 19 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 216/216 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 45 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 45 transition count 207
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 21 place count 45 transition count 191
Applied a total of 21 rules in 23 ms. Remains 45 /47 variables (removed 2) and now considering 191/216 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 45/47 places, 191/216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Probabilistic random walk after 1000001 steps, saw 449383 distinct states, run finished after 1662 ms. (steps per millisecond=601 ) properties seen :17
Running SMT prover for 1 properties.
[2023-03-19 19:31:34] [INFO ] Flow matrix only has 72 transitions (discarded 119 similar events)
// Phase 1: matrix 72 rows 45 cols
[2023-03-19 19:31:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 19:31:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:31:34] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:31:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:31:34] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:31:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:31:34] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 19:31:34] [INFO ] After 11ms 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:31:34] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 191/191 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 190
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 41 transition count 174
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 41 transition count 174
Applied a total of 9 rules in 11 ms. Remains 41 /45 variables (removed 4) and now considering 174/191 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 41/45 places, 174/191 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 115285 steps, run visited all 1 properties in 150 ms. (steps per millisecond=768 )
Probabilistic random walk after 115285 steps, saw 55751 distinct states, run finished after 150 ms. (steps per millisecond=768 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 13 ms
[2023-03-19 19:31:35] [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 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 4 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 4 ms. Remains : 45/47 places, 208/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:31:35] [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 17 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 17 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 172 transitions.
Incomplete random walk after 10001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 485 steps, run visited all 1 properties in 4 ms. (steps per millisecond=121 )
Probabilistic random walk after 485 steps, saw 344 distinct states, run finished after 4 ms. (steps per millisecond=121 ) properties seen :1
FORMULA Szymanski-PT-a06-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 20 place count 43 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 184
Applied a total of 22 rules in 16 ms. Remains 42 /47 variables (removed 5) and now considering 184/216 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 42/47 places, 184/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 184 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 13 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 13 ms. Remains : 41/47 places, 180/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [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 2 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 196 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 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:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [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 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
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 45 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 44 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 44 transition count 188
Applied a total of 22 rules in 11 ms. Remains 44 /47 variables (removed 3) and now considering 188/216 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 44/47 places, 188/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 188 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:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 208 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:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 208 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 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:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 200 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:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 204 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
Applied a total of 24 rules in 10 ms. Remains 43 /47 variables (removed 4) and now considering 184/216 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 43/47 places, 184/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 184 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 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 3 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [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 11 ms. Remains : 41/47 places, 180/216 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 180 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 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:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [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 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:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:31:35] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:31:35] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:31:35] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-19 19:31:35] [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 4744 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.736sec


RS generation: 0m 3.709sec


-> reachability set: #nodes 3294 (3.3e+03) #states 29,158,928,706 (10)



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

checking: EF [[AG [[p2<=0 | p17<=0]] & [1<=p2 & 1<=p30]]]
normalized: E [true U [~ [E [true U ~ [[p2<=0 | p17<=0]]]] & [1<=p2 & 1<=p30]]]

abstracting: (1<=p30)
states: 7,118,388,092 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (p17<=0)
states: 21,714,414,343 (10)
abstracting: (p2<=0)
states: 19,170,488,557 (10)
-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.687sec

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

abstracting: (1<=p34)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p43)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.297sec

checking: AG [[AG [EF [[1<=p3 & 1<=p18]]] | [1<=p2 & 1<=p25]]]
normalized: ~ [E [true U ~ [[[1<=p2 & 1<=p25] | ~ [E [true U ~ [E [true U [1<=p3 & 1<=p18]]]]]]]]]

abstracting: (1<=p18)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
-> the formula is FALSE

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

MC time: 0m 1.133sec

checking: EF [[EF [[1<=p1 & 1<=p29]] & [AF [[1<=p1 & 1<=p25]] & EX [[1<=p1 & 1<=p42]]]]]
normalized: E [true U [[EX [[1<=p1 & 1<=p42]] & ~ [EG [~ [[1<=p1 & 1<=p25]]]]] & E [true U [1<=p1 & 1<=p29]]]]

abstracting: (1<=p29)
states: 7,118,083,565 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
..
EG iterations: 2
abstracting: (1<=p42)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
.-> the formula is TRUE

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

MC time: 0m 4.355sec

checking: EX [[EG [AX [E [[1<=p3 & 1<=p46] U [1<=p0 & 1<=p36]]]] & EX [AF [AG [[1<=p3 & 1<=p25]]]]]]
normalized: EX [[EG [~ [EX [~ [E [[1<=p3 & 1<=p46] U [1<=p0 & 1<=p36]]]]]] & EX [~ [EG [E [true U ~ [[1<=p3 & 1<=p25]]]]]]]]

abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)

EG iterations: 0
.abstracting: (1<=p36)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p46)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
...
EG iterations: 2
.-> the formula is FALSE

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

MC time: 0m 0.153sec

checking: AG [[[p3<=0 | p43<=0] & [EF [[p0<=0 | [p24<=0 | [1<=p3 & 1<=p28]]]] | AG [[AX [[p3<=0 | p16<=0]] & [1<=p2 & 1<=p13]]]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U ~ [[[1<=p2 & 1<=p13] & ~ [EX [~ [[p3<=0 | p16<=0]]]]]]]] | E [true U [p0<=0 | [p24<=0 | [1<=p3 & 1<=p28]]]]] & [p3<=0 | p43<=0]]]]]

abstracting: (p43<=0)
states: 22,040,540,614 (10)
abstracting: (p3<=0)
states: 27,865,773,976 (10)
abstracting: (1<=p28)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (p24<=0)
states: 21,714,414,343 (10)
abstracting: (p0<=0)
states: 27,865,731,471 (10)
abstracting: (p16<=0)
states: 21,714,414,343 (10)
abstracting: (p3<=0)
states: 27,865,773,976 (10)
.abstracting: (1<=p13)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
-> the formula is FALSE

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

MC time: 0m 1.928sec

checking: AG [[[EF [[1<=p3 & 1<=p34]] | p1<=0] | [p26<=0 | [AX [[p1<=0 | p42<=0]] & [EX [[1<=p1 & 1<=p32]] | [1<=p2 & 1<=p45]]]]]]
normalized: ~ [E [true U ~ [[[p26<=0 | [[[1<=p2 & 1<=p45] | EX [[1<=p1 & 1<=p32]]] & ~ [EX [~ [[p1<=0 | p42<=0]]]]]] | [p1<=0 | E [true U [1<=p3 & 1<=p34]]]]]]]

abstracting: (1<=p34)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (p1<=0)
states: 19,170,665,656 (10)
abstracting: (p42<=0)
states: 22,040,540,614 (10)
abstracting: (p1<=0)
states: 19,170,665,656 (10)
.abstracting: (1<=p32)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
.abstracting: (1<=p45)
states: 7,118,388,092 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (p26<=0)
states: 21,714,414,343 (10)
-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.006sec

checking: A [AX [[A [~ [EG [[1<=p3 & 1<=p40]]] U [~ [[1<=p3 & 1<=p25]] & ~ [[1<=p2 & 1<=p25]]]] & [~ [AX [[1<=p1 & 1<=p28]]] | A [[[1<=p1 & 1<=p30] | [1<=p2 & 1<=p14]] U AG [[1<=p3 & 1<=p25]]]]]] U EF [~ [EF [[1<=p3 & 1<=p46]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U [1<=p3 & 1<=p46]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [1<=p3 & 1<=p46]]]]] U [EX [~ [[[[~ [EG [E [true U ~ [[1<=p3 & 1<=p25]]]]] & ~ [E [E [true U ~ [[1<=p3 & 1<=p25]]] U [~ [[[1<=p2 & 1<=p14] | [1<=p1 & 1<=p30]]] & E [true U ~ [[1<=p3 & 1<=p25]]]]]]] | EX [~ [[1<=p1 & 1<=p28]]]] & [~ [EG [~ [[~ [[1<=p2 & 1<=p25]] & ~ [[1<=p3 & 1<=p25]]]]]] & ~ [E [~ [[~ [[1<=p2 & 1<=p25]] & ~ [[1<=p3 & 1<=p25]]]] U [EG [[1<=p3 & 1<=p40]] & ~ [[~ [[1<=p2 & 1<=p25]] & ~ [[1<=p3 & 1<=p25]]]]]]]]]]] & ~ [E [true U ~ [E [true U [1<=p3 & 1<=p46]]]]]]]]]

abstracting: (1<=p46)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p40)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
...........
EG iterations: 11
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
.................
EG iterations: 17
abstracting: (1<=p28)
states: 7,444,514,363 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
.abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p30)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p14)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p25)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)

EG iterations: 0
.abstracting: (1<=p46)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p46)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 2.675sec

checking: AG [[[~ [A [~ [[AF [[1<=p3 & 1<=p36]] & [1<=p3 & 1<=p16]]] U ~ [EF [[1<=p3 & 1<=p11]]]]] | p2<=0] | [p24<=0 | [p8<=0 | [E [[1<=p3 & 1<=p8] U [1<=p2 & 1<=p45]] & [p2<=0 | [p12<=0 | [1<=p0 & 1<=p34]]]]]]]]
normalized: ~ [E [true U ~ [[[p24<=0 | [p8<=0 | [[p2<=0 | [p12<=0 | [1<=p0 & 1<=p34]]] & E [[1<=p3 & 1<=p8] U [1<=p2 & 1<=p45]]]]] | [p2<=0 | ~ [[~ [EG [E [true U [1<=p3 & 1<=p11]]]] & ~ [E [E [true U [1<=p3 & 1<=p11]] U [[[1<=p3 & 1<=p16] & ~ [EG [~ [[1<=p3 & 1<=p36]]]]] & E [true U [1<=p3 & 1<=p11]]]]]]]]]]]]

abstracting: (1<=p11)
states: 3,216,456,057 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p36)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
..
EG iterations: 2
abstracting: (1<=p16)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p11)
states: 3,216,456,057 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p11)
states: 3,216,456,057 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
..
EG iterations: 2
abstracting: (p2<=0)
states: 19,170,488,557 (10)
abstracting: (1<=p45)
states: 7,118,388,092 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p8)
states: 1,829,468,095 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p34)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (p12<=0)
states: 20,586,176,071 (10)
abstracting: (p2<=0)
states: 19,170,488,557 (10)
abstracting: (p8<=0)
states: 27,329,460,611 (10)
abstracting: (p24<=0)
states: 21,714,414,343 (10)
-> the formula is FALSE

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

MC time: 0m 2.266sec

checking: AG [EX [[A [AG [[1<=p0 & 1<=p13]] U ~ [[[1<=p2 & 1<=p23] | [1<=p0 & 1<=p35]]]] | [E [[[1<=p3 & 1<=p16] | [1<=p0 & 1<=p10]] U EF [[1<=p1 & 1<=p37]]] | [AF [[1<=p3 & 1<=p43]] & A [[1<=p0 & 1<=p18] U [1<=p0 & 1<=p17]]]]]]]
normalized: ~ [E [true U ~ [EX [[[[[~ [EG [~ [[1<=p0 & 1<=p17]]]] & ~ [E [~ [[1<=p0 & 1<=p17]] U [~ [[1<=p0 & 1<=p18]] & ~ [[1<=p0 & 1<=p17]]]]]] & ~ [EG [~ [[1<=p3 & 1<=p43]]]]] | E [[[1<=p0 & 1<=p10] | [1<=p3 & 1<=p16]] U E [true U [1<=p1 & 1<=p37]]]] | [~ [EG [[[1<=p0 & 1<=p35] | [1<=p2 & 1<=p23]]]] & ~ [E [[[1<=p0 & 1<=p35] | [1<=p2 & 1<=p23]] U [E [true U ~ [[1<=p0 & 1<=p13]]] & [[1<=p0 & 1<=p35] | [1<=p2 & 1<=p23]]]]]]]]]]]

abstracting: (1<=p23)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p35)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p13)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p23)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p35)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p23)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p35)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
.................
EG iterations: 17
abstracting: (1<=p37)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p16)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p10)
states: 3,086,680,658 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p43)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
..
EG iterations: 2
abstracting: (1<=p17)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p18)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p17)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p17)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.993sec

checking: EF [[A [[[EX [[1<=p0 & 1<=p39]] | AG [[1<=p1 & 1<=p45]]] & [[[1<=p1 & 1<=p46] & [1<=p1 & [1<=p18 & ~ [[1<=p1 & 1<=p26]]]]] | [~ [[1<=p0 & 1<=p8]] & EX [[1<=p3 & 1<=p19]]]]] U [1<=p0 & 1<=p34]] & [1<=p3 & 1<=p38]]]
normalized: E [true U [[~ [EG [~ [[1<=p0 & 1<=p34]]]] & ~ [E [~ [[1<=p0 & 1<=p34]] U [~ [[[[EX [[1<=p3 & 1<=p19]] & ~ [[1<=p0 & 1<=p8]]] | [[1<=p1 & [1<=p18 & ~ [[1<=p1 & 1<=p26]]]] & [1<=p1 & 1<=p46]]] & [~ [E [true U ~ [[1<=p1 & 1<=p45]]]] | EX [[1<=p0 & 1<=p39]]]]] & ~ [[1<=p0 & 1<=p34]]]]]] & [1<=p3 & 1<=p38]]]

abstracting: (1<=p38)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p34)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p39)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
.abstracting: (1<=p45)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p46)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p26)
states: 7,444,514,363 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p18)
states: 7,444,514,363 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p8)
states: 1,829,468,095 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p19)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
.abstracting: (1<=p34)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p34)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.278sec

checking: AX [E [[[~ [EF [[1<=p1 & 1<=p40]]] | E [[1<=p3 & 1<=p31] U [1<=p0 & 1<=p8]]] | [AF [[1<=p0 & 1<=p16]] | [[1<=p0 & 1<=p35] | [E [[1<=p3 & 1<=p13] U [1<=p0 & 1<=p21]] & [1<=p3 & 1<=p16]]]]] U AG [EX [[1<=p0 & 1<=p33]]]]]
normalized: ~ [EX [~ [E [[[[[[1<=p3 & 1<=p16] & E [[1<=p3 & 1<=p13] U [1<=p0 & 1<=p21]]] | [1<=p0 & 1<=p35]] | ~ [EG [~ [[1<=p0 & 1<=p16]]]]] | [E [[1<=p3 & 1<=p31] U [1<=p0 & 1<=p8]] | ~ [E [true U [1<=p1 & 1<=p40]]]]] U ~ [E [true U ~ [EX [[1<=p0 & 1<=p33]]]]]]]]]

abstracting: (1<=p33)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
.abstracting: (1<=p40)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p8)
states: 1,829,468,095 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p31)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p16)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
..
EG iterations: 2
abstracting: (1<=p35)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p21)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p13)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p16)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
.-> the formula is FALSE

FORMULA Szymanski-PT-a06-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.535sec

checking: [AG [[[E [[1<=p2 & 1<=p16] U [1<=p3 & 1<=p19]] | AX [[1<=p2 & 1<=p14]]] | [AG [EX [[p2<=0 | p31<=0]]] | [p3<=0 | p9<=0]]]] | AG [[[[EF [[p2<=0 | p33<=0]] & [p1<=0 | p32<=0]] | [EG [[1<=p6 & 1<=p11]] & EX [[1<=p0 & 1<=p34]]]] | [p3<=0 | p19<=0]]]]
normalized: [~ [E [true U ~ [[[p3<=0 | p19<=0] | [[EX [[1<=p0 & 1<=p34]] & EG [[1<=p6 & 1<=p11]]] | [[p1<=0 | p32<=0] & E [true U [p2<=0 | p33<=0]]]]]]]] | ~ [E [true U ~ [[[[p3<=0 | p9<=0] | ~ [E [true U ~ [EX [[p2<=0 | p31<=0]]]]]] | [~ [EX [~ [[1<=p2 & 1<=p14]]]] | E [[1<=p2 & 1<=p16] U [1<=p3 & 1<=p19]]]]]]]]

abstracting: (1<=p19)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p16)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p14)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
.abstracting: (p31<=0)
states: 22,040,540,614 (10)
abstracting: (p2<=0)
states: 19,170,488,557 (10)
.abstracting: (p9<=0)
states: 26,072,350,766 (10)
abstracting: (p3<=0)
states: 27,865,773,976 (10)
abstracting: (p33<=0)
states: 22,040,540,614 (10)
abstracting: (p2<=0)
states: 19,170,488,557 (10)
abstracting: (p32<=0)
states: 22,040,540,614 (10)
abstracting: (p1<=0)
states: 19,170,665,656 (10)
abstracting: (1<=p11)
states: 3,216,456,057 (9)
abstracting: (1<=p6)
states: 663,440,492 (8)
..
EG iterations: 2
abstracting: (1<=p34)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
.abstracting: (p19<=0)
states: 21,714,414,343 (10)
abstracting: (p3<=0)
states: 27,865,773,976 (10)
-> the formula is TRUE

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

MC time: 0m 2.039sec

checking: EG [[EF [[E [[1<=p0 & 1<=p35] U [1<=p1 & 1<=p20]] & EX [[1<=p3 & 1<=p23]]]] & [EG [[[AG [[1<=p1 & 1<=p40]] | AG [[1<=p1 & 1<=p12]]] | [p2<=0 | p19<=0]]] | [1<=p2 & [1<=p40 & [[EF [[p2<=0 | p24<=0]] | p1<=0] | [p13<=0 | [AF [[p5<=0 | p11<=0]] & AX [[p0<=0 | p44<=0]]]]]]]]]]
normalized: EG [[[[1<=p2 & [1<=p40 & [[p13<=0 | [~ [EX [~ [[p0<=0 | p44<=0]]]] & ~ [EG [~ [[p5<=0 | p11<=0]]]]]] | [p1<=0 | E [true U [p2<=0 | p24<=0]]]]]] | EG [[[p2<=0 | p19<=0] | [~ [E [true U ~ [[1<=p1 & 1<=p12]]]] | ~ [E [true U ~ [[1<=p1 & 1<=p40]]]]]]]] & E [true U [EX [[1<=p3 & 1<=p23]] & E [[1<=p0 & 1<=p35] U [1<=p1 & 1<=p20]]]]]]

abstracting: (1<=p20)
states: 7,444,514,363 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p35)
states: 7,118,388,092 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
abstracting: (1<=p23)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
.abstracting: (1<=p40)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p12)
states: 8,572,752,635 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (p19<=0)
states: 21,714,414,343 (10)
abstracting: (p2<=0)
states: 19,170,488,557 (10)
..
EG iterations: 2
abstracting: (p24<=0)
states: 21,714,414,343 (10)
abstracting: (p2<=0)
states: 19,170,488,557 (10)
abstracting: (p1<=0)
states: 19,170,665,656 (10)
abstracting: (p11<=0)
states: 25,942,472,649 (10)
abstracting: (p5<=0)
states: 28,495,530,718 (10)
..
EG iterations: 2
abstracting: (p44<=0)
states: 22,040,540,614 (10)
abstracting: (p0<=0)
states: 27,865,731,471 (10)
.abstracting: (p13<=0)
states: 21,714,414,343 (10)
abstracting: (1<=p40)
states: 7,118,388,092 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a06-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.367sec

checking: E [~ [E [[[1<=p2 & 1<=p42] | AG [~ [[1<=p3 & 1<=p11]]]] U ~ [[~ [AF [[1<=p2 & 1<=p15]]] | A [[1<=p2 & 1<=p31] U [1<=p3 & 1<=p20]]]]]] U EG [[1<=p0 & [1<=p21 & [[~ [[1<=p3 & 1<=p13]] | [1<=p3 & 1<=p32]] | [[[1<=p2 & 1<=p28] & [1<=p1 & 1<=p38]] | [[1<=p2 & 1<=p29] & [1<=p3 & [1<=p18 & 1<=p8]]]]]]]]]
normalized: E [~ [E [[~ [E [true U [1<=p3 & 1<=p11]]] | [1<=p2 & 1<=p42]] U ~ [[[~ [EG [~ [[1<=p3 & 1<=p20]]]] & ~ [E [~ [[1<=p3 & 1<=p20]] U [~ [[1<=p2 & 1<=p31]] & ~ [[1<=p3 & 1<=p20]]]]]] | EG [~ [[1<=p2 & 1<=p15]]]]]]] U EG [[1<=p0 & [1<=p21 & [[[[1<=p3 & [1<=p18 & 1<=p8]] & [1<=p2 & 1<=p29]] | [[1<=p1 & 1<=p38] & [1<=p2 & 1<=p28]]] | [[1<=p3 & 1<=p32] | ~ [[1<=p3 & 1<=p13]]]]]]]]

abstracting: (1<=p13)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p32)
states: 7,118,388,092 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p28)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p38)
states: 7,118,388,092 (9)
abstracting: (1<=p1)
states: 9,988,263,050 (9)
abstracting: (1<=p29)
states: 7,118,083,565 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p8)
states: 1,829,468,095 (9)
abstracting: (1<=p18)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p21)
states: 7,444,514,363 (9)
abstracting: (1<=p0)
states: 1,293,197,235 (9)
...........
EG iterations: 11
abstracting: (1<=p15)
states: 7,444,514,363 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
..
EG iterations: 2
abstracting: (1<=p20)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p31)
states: 7,118,388,092 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p20)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
abstracting: (1<=p20)
states: 7,444,514,363 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
..
EG iterations: 2
abstracting: (1<=p42)
states: 7,118,388,092 (9)
abstracting: (1<=p2)
states: 9,988,440,149 (9)
abstracting: (1<=p11)
states: 3,216,456,057 (9)
abstracting: (1<=p3)
states: 1,293,154,730 (9)
-> the formula is TRUE

FORMULA Szymanski-PT-a06-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.044sec

totally nodes used: 6072443 (6.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 185575599 78765076 264340675
used/not used/entry size/cache size: 46740067 20368797 16 1024MB
basic ops cache: hits/miss/sum: 14411269 5435898 19847167
used/not used/entry size/cache size: 7562323 9214893 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: 118627 52352 170979
used/not used/entry size/cache size: 52221 8336387 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 61419330
1 5388629
2 277006
3 15669
4 2192
5 1076
6 870
7 759
8 411
9 284
>= 10 2638

Total processing time: 0m35.446sec


BK_STOP 1679254343246

--------------------
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

3051 5188 4129
iterations count:315055 (1458), effective:8279 (38)

initing FirstDep: 0m 0.000sec


iterations count:5099 (23), effective:82 (0)

iterations count:3250 (15), effective:21 (0)

iterations count:8979 (41), effective:168 (0)

iterations count:1303 (6), effective:29 (0)

iterations count:436 (2), effective:10 (0)

iterations count:14465 (66), effective:230 (1)

iterations count:58196 (269), effective:934 (4)

iterations count:446 (2), effective:3 (0)

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

iterations count:290 (1), effective:6 (0)

iterations count:387 (1), effective:8 (0)

iterations count:59749 (276), effective:688 (3)

iterations count:45450 (210), effective:515 (2)

iterations count:40210 (186), effective:670 (3)

iterations count:60127 (278), effective:698 (3)

iterations count:1303 (6), effective:29 (0)

iterations count:18346 (84), effective:237 (1)

iterations count:446 (2), effective:3 (0)

iterations count:446 (2), effective:3 (0)

iterations count:3412 (15), effective:28 (0)

iterations count:446 (2), effective:3 (0)

iterations count:60127 (278), effective:698 (3)

iterations count:1303 (6), effective:29 (0)

iterations count:60127 (278), effective:698 (3)

iterations count:1303 (6), effective:29 (0)

iterations count:4760 (22), effective:63 (0)

iterations count:4760 (22), effective:63 (0)

iterations count:55102 (255), effective:694 (3)

iterations count:4760 (22), effective:63 (0)

iterations count:733 (3), effective:7 (0)

iterations count:7116 (32), effective:189 (0)

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

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

iterations count:45298 (209), effective:582 (2)

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

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

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

iterations count:3250 (15), effective:21 (0)

iterations count:1598 (7), effective:13 (0)

iterations count:630 (2), effective:22 (0)

iterations count:28495 (131), effective:332 (1)

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

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

iterations count:747 (3), effective:18 (0)

iterations count:29754 (137), effective:359 (1)

iterations count:10432 (48), effective:145 (0)

iterations count:958 (4), effective:10 (0)

iterations count:3084 (14), effective:47 (0)

iterations count:35531 (164), effective:598 (2)

iterations count:3250 (15), effective:21 (0)

iterations count:1561 (7), effective:9 (0)

iterations count:430 (1), effective:10 (0)

iterations count:910 (4), effective:10 (0)

iterations count:4760 (22), effective:63 (0)

iterations count:4912 (22), effective:75 (0)

iterations count:49002 (226), effective:627 (2)

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

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