About the Execution of Marcie+red for Eratosthenes-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6303.787 | 14481.00 | 17601.00 | 364.20 | FFFTTFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r170-tall-167838856800170.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 Eratosthenes-PT-200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800170
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 311K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-00
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-01
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-02
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-03
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-04
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-05
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-06
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-07
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-08
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-09
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-10
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-11
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-12
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-13
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-14
FORMULA_NAME Eratosthenes-PT-200-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678493601050
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=Eratosthenes-PT-200
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:13:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:13:22] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-11 00:13:22] [INFO ] Transformed 199 places.
[2023-03-11 00:13:22] [INFO ] Transformed 699 transitions.
[2023-03-11 00:13:22] [INFO ] Parsed PT model containing 199 places and 699 transitions and 2097 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
Support contains 104 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 529/529 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 516
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 516
Drop transitions removed 376 transitions
Redundant transition composition rules discarded 376 transitions
Iterating global reduction 0 with 376 rules applied. Total rules applied 402 place count 140 transition count 140
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 437 place count 105 transition count 105
Iterating global reduction 0 with 35 rules applied. Total rules applied 472 place count 105 transition count 105
Applied a total of 472 rules in 22 ms. Remains 105 /153 variables (removed 48) and now considering 105/529 (removed 424) transitions.
// Phase 1: matrix 105 rows 105 cols
[2023-03-11 00:13:22] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-11 00:13:22] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-11 00:13:22] [INFO ] Invariant cache hit.
[2023-03-11 00:13:23] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-11 00:13:23] [INFO ] Invariant cache hit.
[2023-03-11 00:13:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 105/529 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 105/153 places, 105/529 transitions.
Support contains 104 out of 105 places after structural reductions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 22 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 7 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 105 transitions.
Finished random walk after 272 steps, including 1 resets, run visited all 101 properties in 46 ms. (steps per millisecond=5 )
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 6 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 105 transitions.
Computed a total of 105 stabilizing places and 105 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 105 transition count 105
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Eratosthenes-PT-200-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Graph (complete) has 0 edges and 105 vertex of which 2 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.0 ms
Discarding 103 places :
Also discarding 103 output transitions
Drop transitions removed 103 transitions
Applied a total of 1 rules in 4 ms. Remains 2 /105 variables (removed 103) and now considering 2/105 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 2/105 places, 2/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 93 place count 12 transition count 12
Iterating global reduction 0 with 93 rules applied. Total rules applied 186 place count 12 transition count 12
Applied a total of 186 rules in 2 ms. Remains 12 /105 variables (removed 93) and now considering 12/105 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 12/105 places, 12/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Graph (complete) has 0 edges and 105 vertex of which 2 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.0 ms
Discarding 103 places :
Also discarding 103 output transitions
Drop transitions removed 103 transitions
Applied a total of 1 rules in 3 ms. Remains 2 /105 variables (removed 103) and now considering 2/105 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 2/105 places, 2/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 101 place count 4 transition count 4
Iterating global reduction 0 with 101 rules applied. Total rules applied 202 place count 4 transition count 4
Applied a total of 202 rules in 2 ms. Remains 4 /105 variables (removed 101) and now considering 4/105 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 4/105 places, 4/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 18 transition count 18
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 18 transition count 18
Applied a total of 174 rules in 2 ms. Remains 18 /105 variables (removed 87) and now considering 18/105 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 18/105 places, 18/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 15 transition count 15
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 15 transition count 15
Applied a total of 180 rules in 2 ms. Remains 15 /105 variables (removed 90) and now considering 15/105 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 15/105 places, 15/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 14 transition count 14
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 14 transition count 14
Applied a total of 182 rules in 1 ms. Remains 14 /105 variables (removed 91) and now considering 14/105 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/105 places, 14/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 8 transition count 8
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 8 transition count 8
Applied a total of 194 rules in 1 ms. Remains 8 /105 variables (removed 97) and now considering 8/105 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 8/105 places, 8/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 18 transition count 18
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 18 transition count 18
Applied a total of 174 rules in 1 ms. Remains 18 /105 variables (removed 87) and now considering 18/105 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/105 places, 18/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 15 transition count 15
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 15 transition count 15
Applied a total of 180 rules in 1 ms. Remains 15 /105 variables (removed 90) and now considering 15/105 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/105 places, 15/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 14 transition count 14
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 14 transition count 14
Applied a total of 182 rules in 1 ms. Remains 14 /105 variables (removed 91) and now considering 14/105 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/105 places, 14/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 37 transition count 37
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 37 transition count 37
Applied a total of 136 rules in 2 ms. Remains 37 /105 variables (removed 68) and now considering 37/105 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 37/105 places, 37/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 92 place count 13 transition count 13
Iterating global reduction 0 with 92 rules applied. Total rules applied 184 place count 13 transition count 13
Applied a total of 184 rules in 2 ms. Remains 13 /105 variables (removed 92) and now considering 13/105 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 13/105 places, 13/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 19 transition count 19
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 19 transition count 19
Applied a total of 172 rules in 1 ms. Remains 19 /105 variables (removed 86) and now considering 19/105 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/105 places, 19/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 105/105 transitions.
Graph (complete) has 0 edges and 105 vertex of which 10 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.0 ms
Discarding 95 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Applied a total of 1 rules in 2 ms. Remains 10 /105 variables (removed 95) and now considering 10/105 (removed 95) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 10/105 places, 10/105 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:13:23] [INFO ] Input system was already deterministic with 10 transitions.
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:13:23] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:13:23] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 00:13:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 105 transitions and 105 arcs took 1 ms.
Total runtime 1162 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: 105 NrTr: 105 NrArc: 105)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.742sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 105 (1.0e+02) #states 1,014,120,480,182,583,521,197,362,564,300,800 (33)
starting MCC model checker
--------------------------
checking: EG [[1<=p99 & 1<=p78]]
normalized: EG [[1<=p99 & 1<=p78]]
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p99)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.........................................................................................................................................................
EG iterations: 153
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.323sec
checking: EG [[1<=p3 & 1<=p77]]
normalized: EG [[1<=p3 & 1<=p77]]
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p3)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.........................................................................................................................................................
EG iterations: 153
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.334sec
checking: AF [~ [A [AX [[1<=p14 & 1<=p58]] U 1<=p70]]]
normalized: ~ [EG [[~ [EG [~ [1<=p70]]] & ~ [E [~ [1<=p70] U [~ [1<=p70] & EX [~ [[1<=p14 & 1<=p58]]]]]]]]]
abstracting: (1<=p58)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p14)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p70)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p70)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p70)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
..........................................................................................................................................................
EG iterations: 154
-> the formula is TRUE
FORMULA Eratosthenes-PT-200-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.232sec
checking: AF [EG [[EX [1<=p102] & [E [1<=p30 U 1<=p49] | [[1<=p42 & 1<=p44] | [1<=p58 & 1<=p78]]]]]]
normalized: ~ [EG [~ [EG [[[[[1<=p42 & 1<=p44] | [1<=p58 & 1<=p78]] | E [1<=p30 U 1<=p49]] & EX [1<=p102]]]]]]
abstracting: (1<=p102)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p49)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p30)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p58)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p44)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p42)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.........................................................................................................................................................
EG iterations: 153
EG iterations: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.409sec
checking: AF [[AF [EG [A [1<=p84 U 1<=p41]]] & [p68<=0 & [AF [[[1<=p24 & 1<=p80] | [[1<=p8 & 1<=p77] | p13<=0]]] | EF [[1<=p19 & 1<=p40]]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [EG [[~ [EG [~ [1<=p41]]] & ~ [E [~ [1<=p41] U [~ [1<=p84] & ~ [1<=p41]]]]]]]]] & [[~ [EG [~ [[[1<=p24 & 1<=p80] | [[1<=p8 & 1<=p77] | p13<=0]]]]] | E [true U [1<=p19 & 1<=p40]]] & p68<=0]]]]]
abstracting: (p68<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p13<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p8)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p80)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p24)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p41)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p84)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p41)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p41)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
..........................................................................................................................................................
EG iterations: 154
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.115sec
checking: AG [[EF [[EX [[[1<=p12 & 1<=p14] & [1<=p18 & 1<=p51]]] & [1<=p15 & 1<=p25]]] | AG [EF [[1<=p19 | [[1<=p7 & 1<=p59] & [1<=p20 & 1<=p92]]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [E [true U [[[1<=p7 & 1<=p59] & [1<=p20 & 1<=p92]] | 1<=p19]]]]] | E [true U [[1<=p15 & 1<=p25] & EX [[[1<=p18 & 1<=p51] & [1<=p12 & 1<=p14]]]]]]]]]
abstracting: (1<=p14)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p12)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p51)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p18)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p25)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p15)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p92)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p20)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p59)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p7)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: [AF [AG [[[[AX [1<=p37] | p24<=0] | [p36<=0 | p87<=0]] & AF [[p4<=0 | p73<=0]]]]] & A [~ [A [EX [p55<=0] U AF [[[1<=p0 & 1<=p38] | [1<=p15 & 1<=p46]]]]] U [1<=p16 & 1<=p92]]]
normalized: [[~ [EG [~ [[1<=p16 & 1<=p92]]]] & ~ [E [~ [[1<=p16 & 1<=p92]] U [[~ [EG [EG [~ [[[1<=p15 & 1<=p46] | [1<=p0 & 1<=p38]]]]]] & ~ [E [EG [~ [[[1<=p15 & 1<=p46] | [1<=p0 & 1<=p38]]]] U [~ [EX [p55<=0]] & EG [~ [[[1<=p15 & 1<=p46] | [1<=p0 & 1<=p38]]]]]]]] & ~ [[1<=p16 & 1<=p92]]]]]] & ~ [EG [E [true U ~ [[~ [EG [~ [[p4<=0 | p73<=0]]]] & [[p36<=0 | p87<=0] | [~ [EX [~ [1<=p37]]] | p24<=0]]]]]]]]
abstracting: (p24<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p37)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (p87<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p36<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p73<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p4<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.........................................................................................................................................................
EG iterations: 153
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p92)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p38)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p46)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p15)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (p55<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p38)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p46)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p15)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p38)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p46)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p15)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p92)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p92)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Eratosthenes-PT-200-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.716sec
checking: [AF [[p2<=0 & [AG [AX [1<=p28]] | EX [[1<=p80 & 1<=p101]]]]] & EG [[EX [[AF [p80<=0] & [p20<=0 | p92<=0]]] & EF [[~ [A [1<=p27 U 1<=p16]] & [[p4<=0 | p73<=0] | [p22<=0 | p79<=0]]]]]]]
normalized: [EG [[E [true U [~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p16] & ~ [1<=p27]]]]]] & [[p4<=0 | p73<=0] | [p22<=0 | p79<=0]]]] & EX [[[p20<=0 | p92<=0] & ~ [EG [~ [p80<=0]]]]]]] & ~ [EG [~ [[[EX [[1<=p80 & 1<=p101]] | ~ [E [true U EX [~ [1<=p28]]]]] & p2<=0]]]]]
abstracting: (p2<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p28)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p101)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p80)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
...........................................................................................................................................................
EG iterations: 154
abstracting: (p80<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
..........................................................................................................................................................
EG iterations: 154
abstracting: (p92<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p20<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (p79<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p22<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p73<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p4<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p27)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
..........................................................................................................................................................
EG iterations: 154
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.779sec
checking: A [EX [~ [[[[1<=p46 & 1<=p77] & [1<=p26 & 1<=p76]] | [E [[1<=p58 & 1<=p86] U [1<=p12 & 1<=p14]] | [E [[1<=p4 & 1<=p25] U 1<=p39] & ~ [[1<=p13 & 1<=p85]]]]]]] U EX [AF [AG [1<=p35]]]]
normalized: [~ [EG [~ [EX [~ [EG [E [true U ~ [1<=p35]]]]]]]] & ~ [E [~ [EX [~ [EG [E [true U ~ [1<=p35]]]]]] U [~ [EX [~ [[[[~ [[1<=p13 & 1<=p85]] & E [[1<=p4 & 1<=p25] U 1<=p39]] | E [[1<=p58 & 1<=p86] U [1<=p12 & 1<=p14]]] | [[1<=p26 & 1<=p76] & [1<=p46 & 1<=p77]]]]]] & ~ [EX [~ [EG [E [true U ~ [1<=p35]]]]]]]]]]
abstracting: (1<=p35)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
EG iterations: 0
.abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p46)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p76)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p26)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p14)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p12)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p86)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p58)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p39)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p25)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p4)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p85)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p13)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p35)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
EG iterations: 0
.abstracting: (1<=p35)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
EG iterations: 0
.
EG iterations: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: E [AG [A [[EX [[1<=p67 & 1<=p71]] | [EG [[1<=p57 & 1<=p88]] | [[A [[1<=p10 & 1<=p104] U 1<=p51] & 1<=p92] & [1<=p38 & 1<=p78]]]] U 1<=p95]] U AG [~ [[1<=p63 | [1<=p50 & 1<=p91]]]]]
normalized: E [~ [E [true U ~ [[~ [EG [~ [1<=p95]]] & ~ [E [~ [1<=p95] U [~ [[[[[1<=p38 & 1<=p78] & [1<=p92 & [~ [EG [~ [1<=p51]]] & ~ [E [~ [1<=p51] U [~ [[1<=p10 & 1<=p104]] & ~ [1<=p51]]]]]]] | EG [[1<=p57 & 1<=p88]]] | EX [[1<=p67 & 1<=p71]]]] & ~ [1<=p95]]]]]]]] U ~ [E [true U [1<=p63 | [1<=p50 & 1<=p91]]]]]
abstracting: (1<=p91)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p50)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p63)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p95)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p71)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p67)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p88)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p57)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.........................................................................................................................................................
EG iterations: 153
abstracting: (1<=p51)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p104)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p10)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p51)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p51)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p92)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p38)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p95)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p95)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.305sec
checking: [EX [[[1<=p17 & 1<=p82] | [[AF [[1<=p69 | [1<=p54 & 1<=p78]]] & 1<=p16] & [1<=p80 & [[1<=p97 & AG [p51<=0]] | AG [[1<=p46 | [1<=p16 & 1<=p80]]]]]]]] & [AG [AX [AF [[1<=p74 | [1<=p12 & 1<=p17]]]]] & EF [1<=p89]]]
normalized: [[E [true U 1<=p89] & ~ [E [true U EX [EG [~ [[1<=p74 | [1<=p12 & 1<=p17]]]]]]]] & EX [[[[1<=p80 & [~ [E [true U ~ [[1<=p46 | [1<=p16 & 1<=p80]]]]] | [1<=p97 & ~ [E [true U ~ [p51<=0]]]]]] & [1<=p16 & ~ [EG [~ [[1<=p69 | [1<=p54 & 1<=p78]]]]]]] | [1<=p17 & 1<=p82]]]]
abstracting: (1<=p82)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p17)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p54)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p69)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p51<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p97)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p80)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p16)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p46)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p80)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p17)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p12)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p74)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
.abstracting: (1<=p89)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: [[EX [[[AG [[1<=p29 & 1<=p78]] | [E [1<=p67 U [1<=p23 & 1<=p61]] & p72<=0]] & [EF [[p98<=0 | [p4<=0 | p21<=0]]] & E [[1<=p13 & 1<=p33] U 1<=p92]]]] | AF [AG [1<=p45]]] | [EF [AG [[1<=p3 & 1<=p14]]] | AG [AF [[AX [p96<=0] & EF [p52<=0]]]]]]
normalized: [[~ [E [true U EG [~ [[E [true U p52<=0] & ~ [EX [~ [p96<=0]]]]]]]] | E [true U ~ [E [true U ~ [[1<=p3 & 1<=p14]]]]]] | [~ [EG [E [true U ~ [1<=p45]]]] | EX [[[E [[1<=p13 & 1<=p33] U 1<=p92] & E [true U [p98<=0 | [p4<=0 | p21<=0]]]] & [[p72<=0 & E [1<=p67 U [1<=p23 & 1<=p61]]] | ~ [E [true U ~ [[1<=p29 & 1<=p78]]]]]]]]]
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p29)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p61)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p23)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p67)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p72<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p21<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p4<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p98<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p92)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p33)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p13)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p45)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
EG iterations: 0
abstracting: (1<=p14)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p3)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p96<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (p52<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.........................................................................................................................................................
EG iterations: 153
-> the formula is TRUE
FORMULA Eratosthenes-PT-200-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.111sec
checking: [EG [EF [EX [[1<=p79 & 1<=p94]]]] & EF [[[[[[1<=p58 & 1<=p77] | AF [AG [[1<=p0 & 1<=p60]]]] & EG [[[[1<=p22 & 1<=p79] | 1<=p101] | [[1<=p4 & 1<=p21] | 1<=p96]]]] | ~ [A [p28<=0 U [1<=p17 & 1<=p48]]]] | [EX [[1<=p47 & [1<=p81 & 1<=p103]]] | AF [EG [1<=p53]]]]]]
normalized: [E [true U [[~ [EG [~ [EG [1<=p53]]]] | EX [[1<=p47 & [1<=p81 & 1<=p103]]]] | [~ [[~ [EG [~ [[1<=p17 & 1<=p48]]]] & ~ [E [~ [[1<=p17 & 1<=p48]] U [~ [p28<=0] & ~ [[1<=p17 & 1<=p48]]]]]]] | [EG [[[1<=p96 | [1<=p4 & 1<=p21]] | [1<=p101 | [1<=p22 & 1<=p79]]]] & [~ [EG [E [true U ~ [[1<=p0 & 1<=p60]]]]] | [1<=p58 & 1<=p77]]]]]] & EG [E [true U EX [[1<=p79 & 1<=p94]]]]]
abstracting: (1<=p94)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p79)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p58)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p60)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
EG iterations: 0
abstracting: (1<=p79)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p22)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p101)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p21)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p4)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p96)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
..........................................................................................................................................................
EG iterations: 154
abstracting: (1<=p48)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p17)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p28<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p48)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p17)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p48)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p17)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p103)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p81)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p47)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p53)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
..........................................................................................................................................................
EG iterations: 154
EG iterations: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.006sec
checking: [AX [E [[[[[1<=p77 & 1<=p90] | [[1<=p56 & 1<=p78] | [1<=p45 & 1<=p77]]] & AF [1<=p65]] | ~ [[AX [1<=p93] | ~ [[1<=p43 & 1<=p62]]]]] U EF [[1<=p24 & 1<=p85]]]] & EG [[[EX [AX [[p58<=0 | p86<=0]]] & AG [[1<=p65 & 1<=p72]]] | AG [E [1<=p87 U [[1<=p5 & 1<=p76] | [1<=p24 & 1<=p77]]]]]]]
normalized: [EG [[[EX [~ [EX [~ [[p58<=0 | p86<=0]]]]] & ~ [E [true U ~ [[1<=p65 & 1<=p72]]]]] | ~ [E [true U ~ [E [1<=p87 U [[1<=p5 & 1<=p76] | [1<=p24 & 1<=p77]]]]]]]] & ~ [EX [~ [E [[[~ [EG [~ [1<=p65]]] & [[[1<=p45 & 1<=p77] | [1<=p56 & 1<=p78]] | [1<=p77 & 1<=p90]]] | ~ [[~ [[1<=p43 & 1<=p62]] | ~ [EX [~ [1<=p93]]]]]] U E [true U [1<=p24 & 1<=p85]]]]]]]
abstracting: (1<=p85)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p24)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p93)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p62)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p43)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p90)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p56)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p45)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p65)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
.abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p24)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p76)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p5)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p87)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p72)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p65)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p86<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p58<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
...
EG iterations: 1
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: [EX [EX [[1<=p6 & [1<=p78 & EG [p66<=0]]]]] & [~ [A [[[[[[1<=p78 & 1<=p82] | [1<=p17 & 1<=p82]] & EF [[1<=p21 & 1<=p76]]] | p99<=0] & ~ [[1<=p14 & 1<=p76]]] U [[[~ [[1<=p42 & 1<=p101]] & A [[1<=p76 & 1<=p96] U [1<=p19 & 1<=p40]]] | ~ [[1<=p15 & 1<=p73]]] & [[1<=p34 | [1<=p29 & 1<=p77]] | [AF [[1<=p64 & 1<=p73]] | [A [[1<=p6 & 1<=p78] U 1<=p31] & AF [1<=p83]]]]]]] & ~ [A [[~ [[[1<=p13 & 1<=p54] | [[1<=p25 & 1<=p64] | [1<=p32 & 1<=p78]]]] | [~ [[AF [1<=p75] & A [1<=p41 U [1<=p77 & 1<=p82]]]] | ~ [[[[[1<=p57 | [1<=p42 & 1<=p44]] & EX [1<=p11]] | 1<=p37] | [[1<=p54 & 1<=p78] | E [[1<=p9 & 1<=p100] U [1<=p23 & 1<=p81]]]]]]] U ~ [EG [1<=p34]]]]]]
normalized: [[~ [[~ [EG [EG [1<=p34]]] & ~ [E [EG [1<=p34] U [~ [[[~ [[[E [[1<=p9 & 1<=p100] U [1<=p23 & 1<=p81]] | [1<=p54 & 1<=p78]] | [1<=p37 | [EX [1<=p11] & [1<=p57 | [1<=p42 & 1<=p44]]]]]] | ~ [[[~ [EG [~ [[1<=p77 & 1<=p82]]]] & ~ [E [~ [[1<=p77 & 1<=p82]] U [~ [1<=p41] & ~ [[1<=p77 & 1<=p82]]]]]] & ~ [EG [~ [1<=p75]]]]]] | ~ [[[[1<=p32 & 1<=p78] | [1<=p25 & 1<=p64]] | [1<=p13 & 1<=p54]]]]] & EG [1<=p34]]]]]] & ~ [[~ [EG [~ [[[[[~ [EG [~ [1<=p83]]] & [~ [EG [~ [1<=p31]]] & ~ [E [~ [1<=p31] U [~ [[1<=p6 & 1<=p78]] & ~ [1<=p31]]]]]] | ~ [EG [~ [[1<=p64 & 1<=p73]]]]] | [1<=p34 | [1<=p29 & 1<=p77]]] & [~ [[1<=p15 & 1<=p73]] | [[~ [EG [~ [[1<=p19 & 1<=p40]]]] & ~ [E [~ [[1<=p19 & 1<=p40]] U [~ [[1<=p76 & 1<=p96]] & ~ [[1<=p19 & 1<=p40]]]]]] & ~ [[1<=p42 & 1<=p101]]]]]]]] & ~ [E [~ [[[[[~ [EG [~ [1<=p83]]] & [~ [EG [~ [1<=p31]]] & ~ [E [~ [1<=p31] U [~ [[1<=p6 & 1<=p78]] & ~ [1<=p31]]]]]] | ~ [EG [~ [[1<=p64 & 1<=p73]]]]] | [1<=p34 | [1<=p29 & 1<=p77]]] & [~ [[1<=p15 & 1<=p73]] | [[~ [EG [~ [[1<=p19 & 1<=p40]]]] & ~ [E [~ [[1<=p19 & 1<=p40]] U [~ [[1<=p76 & 1<=p96]] & ~ [[1<=p19 & 1<=p40]]]]]] & ~ [[1<=p42 & 1<=p101]]]]]] U [~ [[~ [[1<=p14 & 1<=p76]] & [p99<=0 | [E [true U [1<=p21 & 1<=p76]] & [[1<=p17 & 1<=p82] | [1<=p78 & 1<=p82]]]]]] & ~ [[[[[~ [EG [~ [1<=p83]]] & [~ [EG [~ [1<=p31]]] & ~ [E [~ [1<=p31] U [~ [[1<=p6 & 1<=p78]] & ~ [1<=p31]]]]]] | ~ [EG [~ [[1<=p64 & 1<=p73]]]]] | [1<=p34 | [1<=p29 & 1<=p77]]] & [~ [[1<=p15 & 1<=p73]] | [[~ [EG [~ [[1<=p19 & 1<=p40]]]] & ~ [E [~ [[1<=p19 & 1<=p40]] U [~ [[1<=p76 & 1<=p96]] & ~ [[1<=p19 & 1<=p40]]]]]] & ~ [[1<=p42 & 1<=p101]]]]]]]]]]]] & EX [EX [[1<=p6 & [1<=p78 & EG [p66<=0]]]]]]
abstracting: (p66<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p6)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
..abstracting: (1<=p101)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p42)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p96)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p76)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p73)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p15)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p29)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p34)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p73)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p64)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p6)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p83)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p82)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p82)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p17)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p76)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p21)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (p99<=0)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p76)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p14)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p101)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p42)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p96)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p76)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p73)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p15)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p29)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p34)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p73)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p64)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p6)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p83)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p101)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p42)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p96)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p76)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p40)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p19)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p73)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p15)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p29)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p34)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p73)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p64)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p6)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p31)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p83)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p34)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
..........................................................................................................................................................
EG iterations: 154
abstracting: (1<=p54)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p13)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p64)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p25)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p32)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p75)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p82)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p41)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p82)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p82)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p77)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.
EG iterations: 1
abstracting: (1<=p44)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p42)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p57)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p11)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
.abstracting: (1<=p37)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p78)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p54)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p81)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p23)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p100)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p9)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
abstracting: (1<=p34)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
..........................................................................................................................................................
EG iterations: 154
abstracting: (1<=p34)
states: 507,060,240,091,291,760,598,681,282,150,400 (32)
..........................................................................................................................................................
EG iterations: 154
.
EG iterations: 1
-> the formula is FALSE
FORMULA Eratosthenes-PT-200-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.436sec
totally nodes used: 11088109 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 10113282 10904497 21017779
used/not used/entry size/cache size: 18474748 48634116 16 1024MB
basic ops cache: hits/miss/sum: 728464 1050619 1779083
used/not used/entry size/cache size: 1868683 14908533 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: 298 6451 6749
used/not used/entry size/cache size: 6446 8382162 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 56927627
1 9331228
2 796874
3 49901
4 2993
5 205
6 28
7 3
8 0
9 0
>= 10 5
Total processing time: 0m10.881sec
BK_STOP 1678493615531
--------------------
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
iterations count:258 (2), effective:153 (1)
initing FirstDep: 0m 0.000sec
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:107 (1), effective:2 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:258 (2), effective:153 (1)
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:107 (1), effective:2 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:258 (2), effective:153 (1)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:221 (2), effective:116 (1)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:107 (1), effective:2 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:105 (1), effective:0 (0)
iterations count:107 (1), effective:2 (0)
iterations count:106 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (1), effective:0 (0)
iterations count:106 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:107 (1), effective:2 (0)
iterations count:106 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:106 (1), effective:1 (0)
iterations count:105 (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="Eratosthenes-PT-200"
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 Eratosthenes-PT-200, 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 r170-tall-167838856800170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 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 '
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 ;