fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r490-tall-167912709701258
Last Updated
May 14, 2023

About the Execution of Marcie+red for ViralEpidemic-PT-S03D1C1A02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11405.060 3600000.00 3643723.00 8539.80 ?F???T?????F???? 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.r490-tall-167912709701258.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 ViralEpidemic-PT-S03D1C1A02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709701258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.2K Feb 25 20:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 20:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 20:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 20:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 20:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Feb 25 20:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 34K 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 ViralEpidemic-PT-S03D1C1A02-CTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S03D1C1A02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679408212914

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=ViralEpidemic-PT-S03D1C1A02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 14:16:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 14:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 14:16:54] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-21 14:16:54] [INFO ] Transformed 66 places.
[2023-03-21 14:16:54] [INFO ] Transformed 91 transitions.
[2023-03-21 14:16:54] [INFO ] Parsed PT model containing 66 places and 91 transitions and 208 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 63 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Applied a total of 0 rules in 10 ms. Remains 66 /66 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 66 cols
[2023-03-21 14:16:54] [INFO ] Computed 1 place invariants in 16 ms
[2023-03-21 14:16:54] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-21 14:16:54] [INFO ] Invariant cache hit.
[2023-03-21 14:16:54] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-21 14:16:54] [INFO ] Invariant cache hit.
[2023-03-21 14:16:54] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 66/66 places, 91/91 transitions.
Support contains 63 out of 66 places after structural reductions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 27 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 10 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 91 transitions.
Finished random walk after 3857 steps, including 287 resets, run visited all 73 properties in 95 ms. (steps per millisecond=40 )
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 5 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 12 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 91 transitions.
Computed a total of 66 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 91
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 2 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 43 transition count 49
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 43 transition count 49
Applied a total of 46 rules in 4 ms. Remains 43 /66 variables (removed 23) and now considering 49/91 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 43/66 places, 49/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 38 transition count 40
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 38 transition count 40
Applied a total of 56 rules in 8 ms. Remains 38 /66 variables (removed 28) and now considering 40/91 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 38/66 places, 40/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Graph (complete) has 39 edges and 66 vertex of which 20 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.1 ms
Discarding 46 places :
Also discarding 58 output transitions
Drop transitions removed 58 transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 17 transition count 24
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 17 transition count 24
Applied a total of 7 rules in 6 ms. Remains 17 /66 variables (removed 49) and now considering 24/91 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 17/66 places, 24/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 1 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 1 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 48 transition count 57
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 48 transition count 57
Applied a total of 36 rules in 2 ms. Remains 48 /66 variables (removed 18) and now considering 57/91 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/66 places, 57/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 47 transition count 55
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 47 transition count 55
Applied a total of 38 rules in 2 ms. Remains 47 /66 variables (removed 19) and now considering 55/91 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 47/66 places, 55/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 35 transition count 34
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 35 transition count 34
Applied a total of 62 rules in 2 ms. Remains 35 /66 variables (removed 31) and now considering 34/91 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 35/66 places, 34/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 1 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 1 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 40 transition count 43
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 40 transition count 43
Applied a total of 52 rules in 2 ms. Remains 40 /66 variables (removed 26) and now considering 43/91 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 40/66 places, 43/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 1 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 50 transition count 63
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 50 transition count 63
Applied a total of 32 rules in 2 ms. Remains 50 /66 variables (removed 16) and now considering 63/91 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/66 places, 63/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 49 transition count 59
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 49 transition count 59
Applied a total of 34 rules in 2 ms. Remains 49 /66 variables (removed 17) and now considering 59/91 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/66 places, 59/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 4 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 42 transition count 46
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 42 transition count 46
Applied a total of 48 rules in 1 ms. Remains 42 /66 variables (removed 24) and now considering 46/91 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 42/66 places, 46/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 52 transition count 65
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 52 transition count 65
Applied a total of 28 rules in 2 ms. Remains 52 /66 variables (removed 14) and now considering 65/91 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 52/66 places, 65/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 4 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 45 transition count 54
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 45 transition count 54
Applied a total of 42 rules in 1 ms. Remains 45 /66 variables (removed 21) and now considering 54/91 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 45/66 places, 54/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 47 transition count 56
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 47 transition count 56
Applied a total of 38 rules in 2 ms. Remains 47 /66 variables (removed 19) and now considering 56/91 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/66 places, 56/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Graph (complete) has 39 edges and 66 vertex of which 36 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 29 transition count 38
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 29 transition count 38
Applied a total of 15 rules in 3 ms. Remains 29 /66 variables (removed 37) and now considering 38/91 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 29/66 places, 38/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 2 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 91/91 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 58 transition count 76
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 58 transition count 76
Applied a total of 16 rules in 1 ms. Remains 58 /66 variables (removed 8) and now considering 76/91 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/66 places, 76/91 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 3 ms
[2023-03-21 14:16:55] [INFO ] Input system was already deterministic with 76 transitions.
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 5 ms
[2023-03-21 14:16:55] [INFO ] Flatten gal took : 4 ms
[2023-03-21 14:16:55] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-21 14:16:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 91 transitions and 208 arcs took 0 ms.
Total runtime 1351 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: 66 NrTr: 91 NrArc: 208)

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

net check time: 0m 0.000sec

init dd package: 0m 2.724sec


RS generation: 2m19.609sec


-> reachability set: #nodes 1809533 (1.8e+06) #states 9,168,679,531 (9)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 9,168,679,531 (9)

before gc: list nodes free: 120198

after gc: idd nodes used:12862732, unused:51137268; list nodes free:287007029
.-> the formula is TRUE

FORMULA ViralEpidemic-PT-S03D1C1A02-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m12.265sec

checking: AF [[AX [[AG [p6<=0] & EX [[p40<=0 | p42<=0]]]] & EG [[1<=p47 & 1<=p60]]]]
normalized: ~ [EG [~ [[EG [[1<=p47 & 1<=p60]] & ~ [EX [~ [[EX [[p40<=0 | p42<=0]] & ~ [E [true U ~ [p6<=0]]]]]]]]]]]

abstracting: (p6<=0)
states: 8,441,492,295 (9)

before gc: list nodes free: 1940318

after gc: idd nodes used:3003979, unused:60996021; list nodes free:340219311
abstracting: (p42<=0)
states: 4,805,556,115 (9)
abstracting: (p40<=0)
states: 4,363,123,416 (9)

before gc: list nodes free: 6785811

after gc: idd nodes used:15215854, unused:48784146; list nodes free:277300296

before gc: list nodes free: 1553324

after gc: idd nodes used:23929645, unused:40070355; list nodes free:237550660
.MC time: 4m 0.166sec

checking: EX [EX [[EG [[p24<=0 | [p13<=0 | p15<=0]]] & [AF [[p2<=0 | p24<=0]] & [1<=p6 | [1<=p41 & 1<=p44]]]]]]
normalized: EX [EX [[[[1<=p6 | [1<=p41 & 1<=p44]] & ~ [EG [~ [[p2<=0 | p24<=0]]]]] & EG [[p24<=0 | [p13<=0 | p15<=0]]]]]]

abstracting: (p15<=0)
states: 4,805,556,115 (9)
abstracting: (p13<=0)
states: 4,363,123,416 (9)
abstracting: (p24<=0)
states: 9,164,298,885 (9)

before gc: list nodes free: 2355902

after gc: idd nodes used:11742759, unused:52257241; list nodes free:301523188

before gc: list nodes free: 154260

after gc: idd nodes used:21943430, unused:42056570; list nodes free:251769410
.MC time: 3m42.579sec

checking: AF [EG [A [~ [[[1<=p14 & 1<=p15] | [[1<=p13 & 1<=p15] | EF [[1<=p25 & 1<=p27]]]]] U [p45<=0 & [1<=p13 & 1<=p17]]]]]
normalized: ~ [EG [~ [EG [[~ [EG [~ [[p45<=0 & [1<=p13 & 1<=p17]]]]] & ~ [E [~ [[p45<=0 & [1<=p13 & 1<=p17]]] U [[[E [true U [1<=p25 & 1<=p27]] | [1<=p13 & 1<=p15]] | [1<=p14 & 1<=p15]] & ~ [[p45<=0 & [1<=p13 & 1<=p17]]]]]]]]]]]

abstracting: (1<=p17)
states: 4,363,123,416 (9)
abstracting: (1<=p13)
states: 4,805,556,115 (9)
abstracting: (p45<=0)
states: 9,164,298,885 (9)
abstracting: (1<=p15)
states: 4,363,123,416 (9)
abstracting: (1<=p14)
states: 4,805,556,115 (9)
abstracting: (1<=p15)
states: 4,363,123,416 (9)
abstracting: (1<=p13)
states: 4,805,556,115 (9)
abstracting: (1<=p27)
states: 727,187,236 (8)
abstracting: (1<=p25)
states: 7,433,943,715 (9)

before gc: list nodes free: 28682732

after gc: idd nodes used:9156637, unused:54843363; list nodes free:323638961
abstracting: (1<=p17)
states: 4,363,123,416 (9)
abstracting: (1<=p13)
states: 4,805,556,115 (9)
abstracting: (p45<=0)
states: 9,164,298,885 (9)

before gc: list nodes free: 51726595

after gc: idd nodes used:9424192, unused:54575808; list nodes free:322406144
MC time: 3m25.613sec

checking: AF [[~ [E [1<=p6 U [1<=p34 & 1<=p36]]] & EG [~ [A [A [1<=p1 U [1<=p62 & 1<=p65]] U A [[1<=p26 & 1<=p27] U [1<=p49 & 1<=p52]]]]]]]
normalized: ~ [EG [~ [[EG [~ [[~ [EG [~ [[~ [EG [~ [[1<=p49 & 1<=p52]]]] & ~ [E [~ [[1<=p49 & 1<=p52]] U [~ [[1<=p26 & 1<=p27]] & ~ [[1<=p49 & 1<=p52]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p49 & 1<=p52]]]] & ~ [E [~ [[1<=p49 & 1<=p52]] U [~ [[1<=p26 & 1<=p27]] & ~ [[1<=p49 & 1<=p52]]]]]]] U [~ [[~ [EG [~ [[1<=p62 & 1<=p65]]]] & ~ [E [~ [[1<=p62 & 1<=p65]] U [~ [1<=p1] & ~ [[1<=p62 & 1<=p65]]]]]]] & ~ [[~ [EG [~ [[1<=p49 & 1<=p52]]]] & ~ [E [~ [[1<=p49 & 1<=p52]] U [~ [[1<=p26 & 1<=p27]] & ~ [[1<=p49 & 1<=p52]]]]]]]]]]]]] & ~ [E [1<=p6 U [1<=p34 & 1<=p36]]]]]]]

abstracting: (1<=p36)
states: 4,363,123,416 (9)
abstracting: (1<=p34)
states: 4,805,556,115 (9)
abstracting: (1<=p6)
states: 727,187,236 (8)

before gc: list nodes free: 54628221

after gc: idd nodes used:10839741, unused:53160259; list nodes free:315660172
abstracting: (1<=p52)
states: 4,363,123,416 (9)
abstracting: (1<=p49)
states: 4,805,556,115 (9)
abstracting: (1<=p27)
states: 727,187,236 (8)
abstracting: (1<=p26)
states: 7,433,943,715 (9)
abstracting: (1<=p52)
states: 4,363,123,416 (9)
abstracting: (1<=p49)
states: 4,805,556,115 (9)
MC time: 3m12.177sec

checking: E [~ [EF [1<=p45]] U E [[~ [EG [[1<=p14 & 1<=p17]]] & [AG [[1<=p12 & [1<=p25 & 1<=p33]]] & [~ [[1<=p29 & 1<=p31]] | [EX [1<=p6] | [1<=p62 & 1<=p65]]]]] U AF [[1<=p25 & 1<=p39]]]]
normalized: E [~ [E [true U 1<=p45]] U E [[[[[[1<=p62 & 1<=p65] | EX [1<=p6]] | ~ [[1<=p29 & 1<=p31]]] & ~ [E [true U ~ [[1<=p12 & [1<=p25 & 1<=p33]]]]]] & ~ [EG [[1<=p14 & 1<=p17]]]] U ~ [EG [~ [[1<=p25 & 1<=p39]]]]]]

abstracting: (1<=p39)
states: 727,187,236 (8)
abstracting: (1<=p25)
states: 7,433,943,715 (9)

before gc: list nodes free: 43179008

after gc: idd nodes used:14753504, unused:49246496; list nodes free:295806910

before gc: list nodes free: 18771571

after gc: idd nodes used:22898920, unused:41101080; list nodes free:254144472
MC time: 2m56.111sec

checking: [EG [A [AG [A [[1<=p29 & 1<=p30] U [1<=p61 & 1<=p64]]] U AF [AG [[1<=p13 & 1<=p16]]]]] & EF [[AX [[p8<=0 | p11<=0]] | [[[p26<=0 | p39<=0] & [p20<=0 | p22<=0]] | ~ [A [1<=p33 U [1<=p0 & 1<=p3]]]]]]]
normalized: [E [true U [[~ [[~ [EG [~ [[1<=p0 & 1<=p3]]]] & ~ [E [~ [[1<=p0 & 1<=p3]] U [~ [1<=p33] & ~ [[1<=p0 & 1<=p3]]]]]]] | [[p20<=0 | p22<=0] & [p26<=0 | p39<=0]]] | ~ [EX [~ [[p8<=0 | p11<=0]]]]]] & EG [[~ [EG [EG [E [true U ~ [[1<=p13 & 1<=p16]]]]]] & ~ [E [EG [E [true U ~ [[1<=p13 & 1<=p16]]]] U [E [true U ~ [[~ [EG [~ [[1<=p61 & 1<=p64]]]] & ~ [E [~ [[1<=p61 & 1<=p64]] U [~ [[1<=p29 & 1<=p30]] & ~ [[1<=p61 & 1<=p64]]]]]]]] & EG [E [true U ~ [[1<=p13 & 1<=p16]]]]]]]]]]

abstracting: (1<=p16)
states: 4,363,123,416 (9)
abstracting: (1<=p13)
states: 4,805,556,115 (9)

before gc: list nodes free: 25645213

after gc: idd nodes used:13450107, unused:50549893; list nodes free:303208192
MC time: 2m44.009sec

checking: E [~ [AF [[[A [[1<=p48 & 1<=p46] U [1<=p62 & 1<=p65]] | [E [1<=p1 U 1<=p6] | [[1<=p28 & 1<=p31] & [1<=p55 & 1<=p58]]]] & AX [[[1<=p25 & 1<=p27] | [1<=p46 & 1<=p54]]]]]] U ~ [EF [EG [AX [[1<=p26 & 1<=p27]]]]]]
normalized: E [EG [~ [[~ [EX [~ [[[1<=p46 & 1<=p54] | [1<=p25 & 1<=p27]]]]] & [[[[1<=p55 & 1<=p58] & [1<=p28 & 1<=p31]] | E [1<=p1 U 1<=p6]] | [~ [EG [~ [[1<=p62 & 1<=p65]]]] & ~ [E [~ [[1<=p62 & 1<=p65]] U [~ [[1<=p48 & 1<=p46]] & ~ [[1<=p62 & 1<=p65]]]]]]]]]] U ~ [E [true U EG [~ [EX [~ [[1<=p26 & 1<=p27]]]]]]]]

abstracting: (1<=p27)
states: 727,187,236 (8)
abstracting: (1<=p26)
states: 7,433,943,715 (9)

before gc: list nodes free: 44389670

after gc: idd nodes used:15894412, unused:48105588; list nodes free:290452621

before gc: list nodes free: 21710049

after gc: idd nodes used:25076390, unused:38923610; list nodes free:242927115
MC time: 2m33.980sec

checking: E [[~ [E [AF [[1<=p18 | [1<=p13 & 1<=p17]]] U [EX [[1<=p46 & 1<=p60]] & [[[1<=p8 & 1<=p11] | [1<=p2 & 1<=p24]] & ~ [[1<=p4 & 1<=p6]]]]]] | [1<=p5 & 1<=p6]] U [EG [~ [AF [[[1<=p8 & 1<=p9] & [1<=p49 & 1<=p51]]]]] | 1<=p45]]
normalized: E [[[1<=p5 & 1<=p6] | ~ [E [~ [EG [~ [[1<=p18 | [1<=p13 & 1<=p17]]]]] U [[~ [[1<=p4 & 1<=p6]] & [[1<=p2 & 1<=p24] | [1<=p8 & 1<=p11]]] & EX [[1<=p46 & 1<=p60]]]]]] U [1<=p45 | EG [EG [~ [[[1<=p49 & 1<=p51] & [1<=p8 & 1<=p9]]]]]]]

abstracting: (1<=p9)
states: 4,363,123,416 (9)
abstracting: (1<=p8)
states: 4,805,556,115 (9)
abstracting: (1<=p51)
states: 4,363,123,416 (9)
abstracting: (1<=p49)
states: 4,805,556,115 (9)

before gc: list nodes free: 30877357

after gc: idd nodes used:22256335, unused:41743665; list nodes free:256717959
MC time: 2m23.678sec

checking: AF [[[1<=p14 & 1<=p15] & [EX [[AX [[1<=p46 & 1<=p54]] & [[p28<=0 | p30<=0] | [p8<=0 | p9<=0]]]] & [EG [AF [[1<=p62 & 1<=p64]]] | A [E [[1<=p49 & 1<=p52] U [1<=p25 & 1<=p39]] U [[1<=p25 & 1<=p39] & [1<=p61 & [1<=p65 & AF [1<=p48]]]]]]]]]
normalized: ~ [EG [~ [[[[[~ [EG [~ [[[1<=p61 & [1<=p65 & ~ [EG [~ [1<=p48]]]]] & [1<=p25 & 1<=p39]]]]] & ~ [E [~ [[[1<=p61 & [1<=p65 & ~ [EG [~ [1<=p48]]]]] & [1<=p25 & 1<=p39]]] U [~ [E [[1<=p49 & 1<=p52] U [1<=p25 & 1<=p39]]] & ~ [[[1<=p61 & [1<=p65 & ~ [EG [~ [1<=p48]]]]] & [1<=p25 & 1<=p39]]]]]]] | EG [~ [EG [~ [[1<=p62 & 1<=p64]]]]]] & EX [[[[p8<=0 | p9<=0] | [p28<=0 | p30<=0]] & ~ [EX [~ [[1<=p46 & 1<=p54]]]]]]] & [1<=p14 & 1<=p15]]]]]

abstracting: (1<=p15)
states: 4,363,123,416 (9)
abstracting: (1<=p14)
states: 4,805,556,115 (9)
abstracting: (1<=p54)
states: 727,187,236 (8)
abstracting: (1<=p46)
states: 7,433,943,715 (9)

before gc: list nodes free: 23889978

after gc: idd nodes used:19431833, unused:44568167; list nodes free:272553203
MC time: 2m12.746sec

checking: E [[A [[1<=p8 & 1<=p11] U [[~ [[1<=p35 & 1<=p36]] | ~ [[1<=p49 & 1<=p52]]] & ~ [AG [[1<=p56 & 1<=p58]]]]] | [1<=p4 & 1<=p12]] U [A [AX [~ [EX [[1<=p50 & 1<=p53]]]] U AG [[1<=p19 & 1<=p23]]] & EF [~ [[E [[1<=p4 & 1<=p18] U [1<=p47 & 1<=p48]] | [1<=p19 & 1<=p22]]]]]]
normalized: E [[[1<=p4 & 1<=p12] | [~ [EG [~ [[E [true U ~ [[1<=p56 & 1<=p58]]] & [~ [[1<=p49 & 1<=p52]] | ~ [[1<=p35 & 1<=p36]]]]]]] & ~ [E [~ [[E [true U ~ [[1<=p56 & 1<=p58]]] & [~ [[1<=p49 & 1<=p52]] | ~ [[1<=p35 & 1<=p36]]]]] U [~ [[1<=p8 & 1<=p11]] & ~ [[E [true U ~ [[1<=p56 & 1<=p58]]] & [~ [[1<=p49 & 1<=p52]] | ~ [[1<=p35 & 1<=p36]]]]]]]]]] U [[~ [EG [E [true U ~ [[1<=p19 & 1<=p23]]]]] & ~ [E [E [true U ~ [[1<=p19 & 1<=p23]]] U [E [true U ~ [[1<=p19 & 1<=p23]]] & EX [EX [[1<=p50 & 1<=p53]]]]]]] & E [true U ~ [[[1<=p19 & 1<=p22] | E [[1<=p4 & 1<=p18] U [1<=p47 & 1<=p48]]]]]]]

abstracting: (1<=p48)
states: 727,187,236 (8)
abstracting: (1<=p47)
states: 7,433,943,715 (9)
abstracting: (1<=p18)
states: 727,187,236 (8)
abstracting: (1<=p4)
states: 7,433,943,715 (9)

before gc: list nodes free: 20090203

after gc: idd nodes used:16842717, unused:47157283; list nodes free:286668896
abstracting: (1<=p22)
states: 4,363,123,416 (9)
abstracting: (1<=p19)
states: 4,805,556,115 (9)
MC time: 2m 3.772sec

checking: EF [[1<=p14 & [1<=p17 & E [EF [[AG [1<=p6] | AG [[1<=p49 & 1<=p53]]]] U [[[[[1<=p8 & 1<=p9] | [1<=p25 & 1<=p27]] | [[1<=p4 & 1<=p6] | [1<=p20 & 1<=p23]]] & AX [[1<=p19 & 1<=p22]]] & [AX [[1<=p26 & 1<=p27]] & [AX [[1<=p14 & 1<=p16]] | [1<=p5 & 1<=p18]]]]]]]]
normalized: E [true U [1<=p14 & [1<=p17 & E [E [true U [~ [E [true U ~ [1<=p6]]] | ~ [E [true U ~ [[1<=p49 & 1<=p53]]]]]] U [[[[[1<=p20 & 1<=p23] | [1<=p4 & 1<=p6]] | [[1<=p8 & 1<=p9] | [1<=p25 & 1<=p27]]] & ~ [EX [~ [[1<=p19 & 1<=p22]]]]] & [[[1<=p5 & 1<=p18] | ~ [EX [~ [[1<=p14 & 1<=p16]]]]] & ~ [EX [~ [[1<=p26 & 1<=p27]]]]]]]]]]

abstracting: (1<=p27)
states: 727,187,236 (8)
abstracting: (1<=p26)
states: 7,433,943,715 (9)

before gc: list nodes free: 45289683

after gc: idd nodes used:21252536, unused:42747464; list nodes free:263731514
MC time: 1m53.325sec

checking: EG [[[A [EG [[1<=p49 & 1<=p53]] U [1<=p56 & 1<=p57]] | A [[AG [[1<=p25 & 1<=p27]] & [[[1<=p41 & 1<=p42] | [1<=p19 & 1<=p21]] | [[1<=p50 & 1<=p51] | ~ [[1<=p56 & 1<=p58]]]]] U EG [[1<=p50 & 1<=p52]]]] | [[1<=p7 & 1<=p11] | [[1<=p29 & 1<=p32] | [EX [[1<=p2 & 1<=p24]] & [[p0<=0 | p24<=0] | [p46<=0 | p48<=0]]]]]]]
normalized: EG [[[[[[[p46<=0 | p48<=0] | [p0<=0 | p24<=0]] & EX [[1<=p2 & 1<=p24]]] | [1<=p29 & 1<=p32]] | [1<=p7 & 1<=p11]] | [[~ [EG [~ [EG [[1<=p50 & 1<=p52]]]]] & ~ [E [~ [EG [[1<=p50 & 1<=p52]]] U [~ [[[[~ [[1<=p56 & 1<=p58]] | [1<=p50 & 1<=p51]] | [[1<=p19 & 1<=p21] | [1<=p41 & 1<=p42]]] & ~ [E [true U ~ [[1<=p25 & 1<=p27]]]]]] & ~ [EG [[1<=p50 & 1<=p52]]]]]]] | [~ [EG [~ [[1<=p56 & 1<=p57]]]] & ~ [E [~ [[1<=p56 & 1<=p57]] U [~ [EG [[1<=p49 & 1<=p53]]] & ~ [[1<=p56 & 1<=p57]]]]]]]]]

abstracting: (1<=p57)
states: 4,363,123,416 (9)
abstracting: (1<=p56)
states: 4,805,556,115 (9)
abstracting: (1<=p53)
states: 4,363,123,416 (9)
abstracting: (1<=p49)
states: 4,805,556,115 (9)

before gc: list nodes free: 27085363

after gc: idd nodes used:22474983, unused:41525017; list nodes free:258039794
MC time: 1m44.469sec

checking: A [~ [EX [[[1<=p39 | [1<=p7 & 1<=p9]] & [~ [[1<=p19 & 1<=p21]] & [[1<=p39 & [1<=p56 & 1<=p57]] | ~ [[1<=p62 & 1<=p65]]]]]]] U AF [[[EF [[1<=p2 & 1<=p3]] & 1<=p46] & [1<=p54 & [[EF [EG [[1<=p25 & 1<=p39]]] | [1<=p5 & [1<=p18 & ~ [EF [1<=p1]]]]] & [[1<=p19 & 1<=p22] | [[1<=p35 & 1<=p37] | [[1<=p26 & 1<=p39] & [1<=p4 & 1<=p12]]]]]]]]]
normalized: [~ [EG [EG [~ [[[1<=p54 & [[[[[1<=p4 & 1<=p12] & [1<=p26 & 1<=p39]] | [1<=p35 & 1<=p37]] | [1<=p19 & 1<=p22]] & [[1<=p5 & [1<=p18 & ~ [E [true U 1<=p1]]]] | E [true U EG [[1<=p25 & 1<=p39]]]]]] & [1<=p46 & E [true U [1<=p2 & 1<=p3]]]]]]]] & ~ [E [EG [~ [[[1<=p54 & [[[[[1<=p4 & 1<=p12] & [1<=p26 & 1<=p39]] | [1<=p35 & 1<=p37]] | [1<=p19 & 1<=p22]] & [[1<=p5 & [1<=p18 & ~ [E [true U 1<=p1]]]] | E [true U EG [[1<=p25 & 1<=p39]]]]]] & [1<=p46 & E [true U [1<=p2 & 1<=p3]]]]]] U [EX [[[[~ [[1<=p62 & 1<=p65]] | [1<=p39 & [1<=p56 & 1<=p57]]] & ~ [[1<=p19 & 1<=p21]]] & [1<=p39 | [1<=p7 & 1<=p9]]]] & EG [~ [[[1<=p54 & [[[[[1<=p4 & 1<=p12] & [1<=p26 & 1<=p39]] | [1<=p35 & 1<=p37]] | [1<=p19 & 1<=p22]] & [[1<=p5 & [1<=p18 & ~ [E [true U 1<=p1]]]] | E [true U EG [[1<=p25 & 1<=p39]]]]]] & [1<=p46 & E [true U [1<=p2 & 1<=p3]]]]]]]]]]

abstracting: (1<=p3)
states: 4,380,646 (6)
abstracting: (1<=p2)
states: 9,155,556,415 (9)
abstracting: (1<=p46)
states: 7,433,943,715 (9)
abstracting: (1<=p39)
states: 727,187,236 (8)
abstracting: (1<=p25)
states: 7,433,943,715 (9)

before gc: list nodes free: 25935662

after gc: idd nodes used:21629141, unused:42370859; list nodes free:262767535
.MC time: 1m38.430sec

checking: E [[[~ [[1<=p62 & 1<=p64]] & E [[[[[1<=p26 & 1<=p27] | 1<=p39] & EG [[1<=p14 & 1<=p16]]] | [~ [[1<=p4 & 1<=p12]] | [1<=p27 & [1<=p46 & 1<=p54]]]] U [1<=p25 & 1<=p33]]] & [p27<=0 & [A [[[1<=p47 & 1<=p60] & [1<=p20 & [1<=p23 & [[1<=p8 & 1<=p11] | [1<=p49 & 1<=p53]]]]] U [[1<=p8 & [1<=p9 & 1<=p12]] | A [[1<=p47 & 1<=p60] U [1<=p2 & 1<=p24]]]] & AG [[AF [[1<=p46 & 1<=p48]] & E [[1<=p34 & 1<=p36] U [1<=p55 & 1<=p57]]]]]]] U [EG [AX [[A [[1<=p25 & 1<=p27] U [1<=p26 & 1<=p33]] | ~ [[1<=p62 & 1<=p64]]]]] | [EG [[AF [[1<=p41 & 1<=p43]] & [AX [[1<=p8 & 1<=p11]] & ~ [[1<=p41 & 1<=p42]]]]] | [1<=p34 & 1<=p38]]]]
normalized: E [[[p27<=0 & [~ [E [true U ~ [[E [[1<=p34 & 1<=p36] U [1<=p55 & 1<=p57]] & ~ [EG [~ [[1<=p46 & 1<=p48]]]]]]]] & [~ [EG [~ [[[~ [EG [~ [[1<=p2 & 1<=p24]]]] & ~ [E [~ [[1<=p2 & 1<=p24]] U [~ [[1<=p47 & 1<=p60]] & ~ [[1<=p2 & 1<=p24]]]]]] | [1<=p8 & [1<=p9 & 1<=p12]]]]]] & ~ [E [~ [[[~ [EG [~ [[1<=p2 & 1<=p24]]]] & ~ [E [~ [[1<=p2 & 1<=p24]] U [~ [[1<=p47 & 1<=p60]] & ~ [[1<=p2 & 1<=p24]]]]]] | [1<=p8 & [1<=p9 & 1<=p12]]]] U [~ [[[1<=p20 & [1<=p23 & [[1<=p49 & 1<=p53] | [1<=p8 & 1<=p11]]]] & [1<=p47 & 1<=p60]]] & ~ [[[~ [EG [~ [[1<=p2 & 1<=p24]]]] & ~ [E [~ [[1<=p2 & 1<=p24]] U [~ [[1<=p47 & 1<=p60]] & ~ [[1<=p2 & 1<=p24]]]]]] | [1<=p8 & [1<=p9 & 1<=p12]]]]]]]]]] & [E [[[[1<=p27 & [1<=p46 & 1<=p54]] | ~ [[1<=p4 & 1<=p12]]] | [EG [[1<=p14 & 1<=p16]] & [1<=p39 | [1<=p26 & 1<=p27]]]] U [1<=p25 & 1<=p33]] & ~ [[1<=p62 & 1<=p64]]]] U [[[1<=p34 & 1<=p38] | EG [[[~ [[1<=p41 & 1<=p42]] & ~ [EX [~ [[1<=p8 & 1<=p11]]]]] & ~ [EG [~ [[1<=p41 & 1<=p43]]]]]]] | EG [~ [EX [~ [[~ [[1<=p62 & 1<=p64]] | [~ [EG [~ [[1<=p26 & 1<=p33]]]] & ~ [E [~ [[1<=p26 & 1<=p33]] U [~ [[1<=p25 & 1<=p27]] & ~ [[1<=p26 & 1<=p33]]]]]]]]]]]]]

abstracting: (1<=p33)
states: 727,187,236 (8)
abstracting: (1<=p26)
states: 7,433,943,715 (9)
abstracting: (1<=p27)
states: 727,187,236 (8)
abstracting: (1<=p25)
states: 7,433,943,715 (9)
abstracting: (1<=p33)
states: 727,187,236 (8)
abstracting: (1<=p26)
states: 7,433,943,715 (9)

before gc: list nodes free: 30821043

after gc: idd nodes used:21157419, unused:42842581; list nodes free:266006341
MC time: 1m30.358sec

checking: AF [[AX [[AG [p6<=0] & EX [[p40<=0 | p42<=0]]]] & EG [[1<=p47 & 1<=p60]]]]
normalized: ~ [EG [~ [[EG [[1<=p47 & 1<=p60]] & ~ [EX [~ [[EX [[p40<=0 | p42<=0]] & ~ [E [true U ~ [p6<=0]]]]]]]]]]]

abstracting: (p6<=0)
states: 8,441,492,295 (9)
abstracting: (p42<=0)
states: 4,805,556,115 (9)
abstracting: (p40<=0)
states: 4,363,123,416 (9)

before gc: list nodes free: 52002073

after gc: idd nodes used:23434274, unused:40565726; list nodes free:253847108

before gc: list nodes free: 26169753

after gc: idd nodes used:29767515, unused:34232485; list nodes free:220478265

before gc: list nodes free: 24878724

after gc: idd nodes used:35716075, unused:28283925; list nodes free:190771579
.
before gc: list nodes free: 15786404

after gc: idd nodes used:21291943, unused:42708057; list nodes free:265098749
.abstracting: (1<=p60)
states: 727,187,236 (8)
abstracting: (1<=p47)
states: 7,433,943,715 (9)

before gc: list nodes free: 23997107

after gc: idd nodes used:24689388, unused:39310612; list nodes free:248316957
.
before gc: list nodes free: 30359997

after gc: idd nodes used:27227424, unused:36772576; list nodes free:233644742

before gc: list nodes free: 24091018

after gc: idd nodes used:34757662, unused:29242338; list nodes free:195752968

before gc: list nodes free: 22102904

after gc: idd nodes used:23851385, unused:40148615; list nodes free:252643915
......
before gc: list nodes free: 20409554

after gc: idd nodes used:22935132, unused:41064868; list nodes free:257161932
....
before gc: list nodes free: 30838424

after gc: idd nodes used:22159184, unused:41840816; list nodes free:261195974
.................
EG iterations: 28

EG iterations: 0
-> the formula is FALSE

FORMULA ViralEpidemic-PT-S03D1C1A02-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4745552 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104180 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:3791 (41), effective:91 (1)

initing FirstDep: 0m 0.000sec


iterations count:94 (1), effective:2 (0)

net_ddint.h:600: Timeout: after 237 sec


net_ddint.h:442: Timeout: after 220 sec


iterations count:95 (1), effective:2 (0)

sat_reach.icc:155: Timeout: after 204 sec


iterations count:101 (1), effective:2 (0)

sat_reach.icc:155: Timeout: after 189 sec


net_ddint.h:600: Timeout: after 175 sec


sat_reach.icc:155: Timeout: after 163 sec


net_ddint.h:600: Timeout: after 151 sec


net_ddint.h:600: Timeout: after 140 sec


net_ddint.h:600: Timeout: after 130 sec


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

sat_reach.icc:155: Timeout: after 120 sec


net_ddint.h:600: Timeout: after 112 sec


net_ddint.h:600: Timeout: after 103 sec


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

net_ddint.h:442: Timeout: after 96 sec


sat_reach.icc:155: Timeout: after 89 sec


iterations count:94 (1), effective:2 (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="ViralEpidemic-PT-S03D1C1A02"
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 ViralEpidemic-PT-S03D1C1A02, 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-167912709701258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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