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

About the Execution of Marcie+red for ShieldIIPs-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10270.552 3600000.00 3643829.00 136.00 ?F?T?T?FTF?T??TT 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.r394-oct2-167903717400025.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717400025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 33K 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 ShieldIIPs-PT-002B-CTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679484483312

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:28:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:28:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:28:05] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-22 11:28:05] [INFO ] Transformed 123 places.
[2023-03-22 11:28:05] [INFO ] Transformed 121 transitions.
[2023-03-22 11:28:05] [INFO ] Found NUPN structural information;
[2023-03-22 11:28:05] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-002B-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 118
Applied a total of 6 rules in 15 ms. Remains 120 /123 variables (removed 3) and now considering 118/121 (removed 3) transitions.
// Phase 1: matrix 118 rows 120 cols
[2023-03-22 11:28:05] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-22 11:28:06] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-22 11:28:06] [INFO ] Invariant cache hit.
[2023-03-22 11:28:06] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-22 11:28:06] [INFO ] Invariant cache hit.
[2023-03-22 11:28:06] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/123 places, 118/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 785 ms. Remains : 120/123 places, 118/121 transitions.
Support contains 71 out of 120 places after structural reductions.
[2023-03-22 11:28:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 11:28:06] [INFO ] Flatten gal took : 32 ms
FORMULA ShieldIIPs-PT-002B-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 11:28:06] [INFO ] Flatten gal took : 16 ms
[2023-03-22 11:28:06] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 69 out of 120 places (down from 71) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 63) seen :61
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 11:28:07] [INFO ] Invariant cache hit.
[2023-03-22 11:28:07] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:28:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 11:28:07] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:07] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 4 ms to minimize.
[2023-03-22 11:28:07] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-22 11:28:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2023-03-22 11:28:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 132 ms
[2023-03-22 11:28:07] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-22 11:28:07] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 118 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 109 transition count 107
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 108 transition count 106
Applied a total of 24 rules in 8 ms. Remains 108 /120 variables (removed 12) and now considering 106/118 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 108/120 places, 106/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 6 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 109 transition count 107
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 108 transition count 106
Applied a total of 24 rules in 8 ms. Remains 108 /120 variables (removed 12) and now considering 106/118 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 108/120 places, 106/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 110 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 109 transition count 107
Applied a total of 22 rules in 5 ms. Remains 109 /120 variables (removed 11) and now considering 107/118 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 109/120 places, 107/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 111 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 110 transition count 108
Applied a total of 20 rules in 4 ms. Remains 110 /120 variables (removed 10) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/120 places, 108/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 115 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 115 transition count 113
Applied a total of 10 rules in 2 ms. Remains 115 /120 variables (removed 5) and now considering 113/118 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/120 places, 113/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 112 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 112 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 111 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 111 transition count 109
Applied a total of 18 rules in 4 ms. Remains 111 /120 variables (removed 9) and now considering 109/118 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 111/120 places, 109/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 109 transition count 107
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 108 transition count 106
Applied a total of 24 rules in 4 ms. Remains 108 /120 variables (removed 12) and now considering 106/118 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 108/120 places, 106/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 110 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 110 transition count 108
Applied a total of 20 rules in 3 ms. Remains 110 /120 variables (removed 10) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 110/120 places, 108/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 119 transition count 110
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 112 transition count 110
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 14 place count 112 transition count 101
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 103 transition count 101
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 41 place count 94 transition count 92
Iterating global reduction 2 with 9 rules applied. Total rules applied 50 place count 94 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 94 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 92 transition count 90
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 104 place count 67 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 65 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 64 transition count 63
Applied a total of 107 rules in 19 ms. Remains 64 /120 variables (removed 56) and now considering 63/118 (removed 55) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 64/120 places, 63/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 109 transition count 107
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 108 transition count 106
Applied a total of 24 rules in 3 ms. Remains 108 /120 variables (removed 12) and now considering 106/118 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 108/120 places, 106/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 110 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 110 transition count 108
Applied a total of 20 rules in 2 ms. Remains 110 /120 variables (removed 10) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/120 places, 108/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 109 transition count 107
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 109 transition count 107
Applied a total of 22 rules in 5 ms. Remains 109 /120 variables (removed 11) and now considering 107/118 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 109/120 places, 107/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 118/118 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 111 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 110 transition count 108
Applied a total of 20 rules in 5 ms. Remains 110 /120 variables (removed 10) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 110/120 places, 108/118 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 6 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:28:07] [INFO ] Input system was already deterministic with 108 transitions.
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 6 ms
[2023-03-22 11:28:07] [INFO ] Flatten gal took : 6 ms
[2023-03-22 11:28:07] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 11:28:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 120 places, 118 transitions and 356 arcs took 1 ms.
Total runtime 2314 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 120 NrTr: 118 NrArc: 356)

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

net check time: 0m 0.000sec

init dd package: 0m 2.950sec


RS generation: 0m26.547sec


-> reachability set: #nodes 333130 (3.3e+05) #states 202,319,990,341 (11)



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

checking: AG [EF [[AX [[p84<=1 & 1<=p84]] | [p25<=1 & 1<=p25]]]]
normalized: ~ [E [true U ~ [E [true U [[p25<=1 & 1<=p25] | ~ [EX [~ [[p84<=1 & 1<=p84]]]]]]]]]

abstracting: (1<=p84)
states: 67,439,817,230 (10)
abstracting: (p84<=1)
states: 202,319,990,341 (11)
.abstracting: (1<=p25)
states: 72,311,570,946 (10)
abstracting: (p25<=1)
states: 202,319,990,341 (11)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.501sec

checking: EX [[AX [AG [~ [[p36<=0 & 0<=p36]]]] | EF [AG [AX [[[p89<=0 & 0<=p89] & [p113<=1 & 1<=p113]]]]]]]
normalized: EX [[E [true U ~ [E [true U EX [~ [[[p113<=1 & 1<=p113] & [p89<=0 & 0<=p89]]]]]]] | ~ [EX [E [true U [p36<=0 & 0<=p36]]]]]]

abstracting: (0<=p36)
states: 202,319,990,341 (11)
abstracting: (p36<=0)
states: 176,593,476,579 (11)
.abstracting: (0<=p89)
states: 202,319,990,341 (11)
abstracting: (p89<=0)
states: 179,326,330,909 (11)
abstracting: (1<=p113)
states: 21,922,246,248 (10)
abstracting: (p113<=1)
states: 202,319,990,341 (11)
..-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.939sec

checking: AF [AX [EX [[AX [[p109<=1 & 1<=p109]] & [[p62<=0 & 0<=p62] | [p87<=1 & 1<=p87]]]]]]
normalized: ~ [EG [EX [~ [EX [[[[p87<=1 & 1<=p87] | [p62<=0 & 0<=p62]] & ~ [EX [~ [[p109<=1 & 1<=p109]]]]]]]]]]

abstracting: (1<=p109)
states: 134,379 (5)
abstracting: (p109<=1)
states: 202,319,990,341 (11)
.abstracting: (0<=p62)
states: 202,319,990,341 (11)
abstracting: (p62<=0)
states: 202,319,989,774 (11)
abstracting: (1<=p87)
states: 25,897,403,556 (10)
abstracting: (p87<=1)
states: 202,319,990,341 (11)
...................................................................................................
before gc: list nodes free: 1334929

after gc: idd nodes used:945617, unused:63054383; list nodes free:293546916
..........................
EG iterations: 123
-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.653sec

checking: E [~ [[p89<=1 & 1<=p89]] U EX [[AF [AX [[p77<=0 & 0<=p77]]] & ~ [[[p53<=0 & 0<=p53] | [p101<=1 & 1<=p101]]]]]]
normalized: E [~ [[p89<=1 & 1<=p89]] U EX [[~ [[[p101<=1 & 1<=p101] | [p53<=0 & 0<=p53]]] & ~ [EG [EX [~ [[p77<=0 & 0<=p77]]]]]]]]

abstracting: (0<=p77)
states: 202,319,990,341 (11)
abstracting: (p77<=0)
states: 146,181,602,701 (11)
.......................................................................................
before gc: list nodes free: 1339936

after gc: idd nodes used:1854796, unused:62145204; list nodes free:295671917
......................................................................
before gc: list nodes free: 1866962

after gc: idd nodes used:1935845, unused:62064155; list nodes free:297387776
..............................................................................................................
EG iterations: 266
abstracting: (0<=p53)
states: 202,319,990,341 (11)
abstracting: (p53<=0)
states: 176,533,926,091 (11)
abstracting: (1<=p101)
states: 29,278,154,652 (10)
abstracting: (p101<=1)
states: 202,319,990,341 (11)
.abstracting: (1<=p89)
states: 22,993,659,432 (10)
abstracting: (p89<=1)
states: 202,319,990,341 (11)
MC time: 5m46.160sec

checking: AF [[[p9<=1 & 1<=p9] & AX [~ [A [[[p8<=0 & 0<=p8] | [p16<=1 & 1<=p16]] U [[p78<=0 & 0<=p78] | [p85<=1 & 1<=p85]]]]]]]
normalized: ~ [EG [~ [[~ [EX [[~ [EG [~ [[[p85<=1 & 1<=p85] | [p78<=0 & 0<=p78]]]]] & ~ [E [~ [[[p85<=1 & 1<=p85] | [p78<=0 & 0<=p78]]] U [~ [[[p16<=1 & 1<=p16] | [p8<=0 & 0<=p8]]] & ~ [[[p85<=1 & 1<=p85] | [p78<=0 & 0<=p78]]]]]]]]] & [p9<=1 & 1<=p9]]]]]

abstracting: (1<=p9)
states: 127,168 (5)
abstracting: (p9<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p78)
states: 202,319,990,341 (11)
abstracting: (p78<=0)
states: 143,804,826,211 (11)
abstracting: (1<=p85)
states: 67,440,034,958 (10)
abstracting: (p85<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p8)
states: 202,319,990,341 (11)
abstracting: (p8<=0)
states: 202,319,926,757 (11)
abstracting: (1<=p16)
states: 28,487,586,214 (10)
abstracting: (p16<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p78)
states: 202,319,990,341 (11)
abstracting: (p78<=0)
states: 143,804,826,211 (11)
abstracting: (1<=p85)
states: 67,440,034,958 (10)
abstracting: (p85<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p78)
states: 202,319,990,341 (11)
abstracting: (p78<=0)
states: 143,804,826,211 (11)
abstracting: (1<=p85)
states: 67,440,034,958 (10)
abstracting: (p85<=1)
states: 202,319,990,341 (11)
.........................................
before gc: list nodes free: 3923863

after gc: idd nodes used:1315862, unused:62684138; list nodes free:300190863
.............................................................................................
before gc: list nodes free: 4974819

after gc: idd nodes used:5311228, unused:58688772; list nodes free:281638054
...............................................................................................
EG iterations: 229
MC time: 5m11.098sec

checking: EF [AG [[AX [[p76<=1 & 1<=p76]] & [EG [[[p87<=0 & 0<=p87] & [p117<=1 & 1<=p117]]] | [[p1<=0 & 0<=p1] & [p64<=1 & 1<=p64]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[p64<=1 & 1<=p64] & [p1<=0 & 0<=p1]] | EG [[[p117<=1 & 1<=p117] & [p87<=0 & 0<=p87]]]] & ~ [EX [~ [[p76<=1 & 1<=p76]]]]]]]]]

abstracting: (1<=p76)
states: 59,607,103,350 (10)
abstracting: (p76<=1)
states: 202,319,990,341 (11)
.abstracting: (0<=p87)
states: 202,319,990,341 (11)
abstracting: (p87<=0)
states: 176,422,586,785 (11)
abstracting: (1<=p117)
states: 21,675,861,699 (10)
abstracting: (p117<=1)
states: 202,319,990,341 (11)
........................
before gc: list nodes free: 5553004

after gc: idd nodes used:2023850, unused:61976150; list nodes free:296914248
...............................
before gc: list nodes free: 3387135

after gc: idd nodes used:3377645, unused:60622355; list nodes free:290288532
...MC time: 4m40.066sec

checking: AG [[[EX [EF [[[p105<=0 & 0<=p105] & [p86<=1 & 1<=p86]]]] | AF [[p16<=1 & 1<=p16]]] | [[p12<=0 & 0<=p12] | [[p78<=0 & 0<=p78] & [p26<=1 & 1<=p26]]]]]
normalized: ~ [E [true U ~ [[[EX [E [true U [[p86<=1 & 1<=p86] & [p105<=0 & 0<=p105]]]] | ~ [EG [~ [[p16<=1 & 1<=p16]]]]] | [[p12<=0 & 0<=p12] | [[p26<=1 & 1<=p26] & [p78<=0 & 0<=p78]]]]]]]

abstracting: (0<=p78)
states: 202,319,990,341 (11)
abstracting: (p78<=0)
states: 143,804,826,211 (11)
abstracting: (1<=p26)
states: 67,050,120,570 (10)
abstracting: (p26<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p12)
states: 202,319,990,341 (11)
abstracting: (p12<=0)
states: 202,209,707,877 (11)
abstracting: (1<=p16)
states: 28,487,586,214 (10)
abstracting: (p16<=1)
states: 202,319,990,341 (11)
........................................................
before gc: list nodes free: 4996440

after gc: idd nodes used:2047480, unused:61952520; list nodes free:296871892
......................................
before gc: list nodes free: 3974251

after gc: idd nodes used:5753849, unused:58246151; list nodes free:279530565
.MC time: 4m12.313sec

checking: EF [[[EX [[p43<=1 & 1<=p43]] & EF [[[p36<=1 & 1<=p36] & [p104<=0 & 0<=p104]]]] & [[p22<=0 & 0<=p22] & [[p93<=1 & 1<=p93] & [AF [[[p62<=0 & 0<=p62] | [p67<=1 & 1<=p67]]] | [p29<=0 & 0<=p29]]]]]]
normalized: E [true U [[[[[p29<=0 & 0<=p29] | ~ [EG [~ [[[p67<=1 & 1<=p67] | [p62<=0 & 0<=p62]]]]]] & [p93<=1 & 1<=p93]] & [p22<=0 & 0<=p22]] & [E [true U [[p104<=0 & 0<=p104] & [p36<=1 & 1<=p36]]] & EX [[p43<=1 & 1<=p43]]]]]

abstracting: (1<=p43)
states: 1,966,408 (6)
abstracting: (p43<=1)
states: 202,319,990,341 (11)
.abstracting: (1<=p36)
states: 25,726,513,762 (10)
abstracting: (p36<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p104)
states: 202,319,990,341 (11)
abstracting: (p104<=0)
states: 173,933,379,973 (11)
abstracting: (0<=p22)
states: 202,319,990,341 (11)
abstracting: (p22<=0)
states: 146,665,850,749 (11)
abstracting: (1<=p93)
states: 25,921,461,078 (10)
abstracting: (p93<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p62)
states: 202,319,990,341 (11)
abstracting: (p62<=0)
states: 202,319,989,774 (11)
abstracting: (1<=p67)
states: 72,576 (4)
abstracting: (p67<=1)
states: 202,319,990,341 (11)
.....................
EG iterations: 21
abstracting: (0<=p29)
states: 202,319,990,341 (11)
abstracting: (p29<=0)
states: 202,171,305,237 (11)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.997sec

checking: ~ [E [EG [AF [[0<=p107 & p107<=0]]] U [[~ [[~ [AX [[p43<=0 & 0<=p43]]] & AF [[[p60<=0 & 0<=p60] | [p63<=1 & 1<=p63]]]]] | AG [A [[[p12<=0 & 0<=p12] | [p69<=1 & 1<=p69]] U [p67<=0 & 0<=p67]]]] & [AG [~ [EF [[[p17<=0 & 0<=p17] | [p81<=1 & 1<=p81]]]]] & [p66<=1 & 1<=p66]]]]]
normalized: ~ [E [EG [~ [EG [~ [[0<=p107 & p107<=0]]]]] U [[[p66<=1 & 1<=p66] & ~ [E [true U E [true U [[p81<=1 & 1<=p81] | [p17<=0 & 0<=p17]]]]]] & [~ [E [true U ~ [[~ [EG [~ [[p67<=0 & 0<=p67]]]] & ~ [E [~ [[p67<=0 & 0<=p67]] U [~ [[[p69<=1 & 1<=p69] | [p12<=0 & 0<=p12]]] & ~ [[p67<=0 & 0<=p67]]]]]]]]] | ~ [[~ [EG [~ [[[p63<=1 & 1<=p63] | [p60<=0 & 0<=p60]]]]] & EX [~ [[p43<=0 & 0<=p43]]]]]]]]]

abstracting: (0<=p43)
states: 202,319,990,341 (11)
abstracting: (p43<=0)
states: 202,318,023,933 (11)
.abstracting: (0<=p60)
states: 202,319,990,341 (11)
abstracting: (p60<=0)
states: 179,864,297,707 (11)
abstracting: (1<=p63)
states: 567
abstracting: (p63<=1)
states: 202,319,990,341 (11)
..................................................................
before gc: list nodes free: 11334175

after gc: idd nodes used:3294331, unused:60705669; list nodes free:291051848
.......................MC time: 4m 8.004sec

checking: [E [[p82<=0 & 0<=p82] U EF [EX [AG [[p22<=0 & 0<=p22]]]]] & E [[p20<=1 & 1<=p20] U [[EF [~ [[p83<=1 & 1<=p83]]] | [~ [[p61<=1 & 1<=p61]] | [p28<=0 & 0<=p28]]] & [EX [~ [A [[[p16<=0 & 0<=p16] | [p93<=1 & 1<=p93]] U [p54<=1 & 1<=p54]]]] | [p42<=1 & 1<=p42]]]]]
normalized: [E [[p20<=1 & 1<=p20] U [[EX [~ [[~ [EG [~ [[p54<=1 & 1<=p54]]]] & ~ [E [~ [[p54<=1 & 1<=p54]] U [~ [[[p93<=1 & 1<=p93] | [p16<=0 & 0<=p16]]] & ~ [[p54<=1 & 1<=p54]]]]]]]] | [p42<=1 & 1<=p42]] & [[[p28<=0 & 0<=p28] | ~ [[p61<=1 & 1<=p61]]] | E [true U ~ [[p83<=1 & 1<=p83]]]]]] & E [[p82<=0 & 0<=p82] U E [true U EX [~ [E [true U ~ [[p22<=0 & 0<=p22]]]]]]]]

abstracting: (0<=p22)
states: 202,319,990,341 (11)
abstracting: (p22<=0)
states: 146,665,850,749 (11)
.
before gc: list nodes free: 10221692

after gc: idd nodes used:1423258, unused:62576742; list nodes free:299797218
abstracting: (0<=p82)
states: 202,319,990,341 (11)
abstracting: (p82<=0)
states: 132,999,569,305 (11)
abstracting: (1<=p83)
states: 67,440,034,958 (10)
abstracting: (p83<=1)
states: 202,319,990,341 (11)
abstracting: (1<=p61)
states: 1,970,382 (6)
abstracting: (p61<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p28)
states: 202,319,990,341 (11)
abstracting: (p28<=0)
states: 134,099,442,367 (11)
abstracting: (1<=p42)
states: 65,763,852,652 (10)
abstracting: (p42<=1)
states: 202,319,990,341 (11)
abstracting: (1<=p54)
states: 25,786,064,250 (10)
abstracting: (p54<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p16)
states: 202,319,990,341 (11)
abstracting: (p16<=0)
states: 173,832,404,127 (11)
abstracting: (1<=p93)
states: 25,921,461,078 (10)
abstracting: (p93<=1)
states: 202,319,990,341 (11)
abstracting: (1<=p54)
states: 25,786,064,250 (10)
abstracting: (p54<=1)
states: 202,319,990,341 (11)
abstracting: (1<=p54)
states: 25,786,064,250 (10)
abstracting: (p54<=1)
states: 202,319,990,341 (11)
.................................................MC time: 3m41.015sec

checking: AG [[AX [EF [AX [[p108<=1 & 1<=p108]]]] & [[AX [[EX [[[p52<=0 & 0<=p52] & [p58<=1 & 1<=p58]]] & AX [[[p43<=0 & 0<=p43] & [p29<=1 & 1<=p29]]]]] | [[p35<=0 & 0<=p35] | [p41<=0 & 0<=p41]]] | [[[p9<=1 & 1<=p9] | [p106<=0 & 0<=p106]] | [[p4<=1 & 1<=p4] | [EG [[p97<=0 & 0<=p97]] & [[p73<=0 & 0<=p73] & [p61<=0 & 0<=p61]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p61<=0 & 0<=p61] & [p73<=0 & 0<=p73]] & EG [[p97<=0 & 0<=p97]]] | [p4<=1 & 1<=p4]] | [[p106<=0 & 0<=p106] | [p9<=1 & 1<=p9]]] | [[[p41<=0 & 0<=p41] | [p35<=0 & 0<=p35]] | ~ [EX [~ [[~ [EX [~ [[[p29<=1 & 1<=p29] & [p43<=0 & 0<=p43]]]]] & EX [[[p58<=1 & 1<=p58] & [p52<=0 & 0<=p52]]]]]]]]] & ~ [EX [~ [E [true U ~ [EX [~ [[p108<=1 & 1<=p108]]]]]]]]]]]]

abstracting: (1<=p108)
states: 133,812 (5)
abstracting: (p108<=1)
states: 202,319,990,341 (11)
.
before gc: list nodes free: 7778643

after gc: idd nodes used:1538959, unused:62461041; list nodes free:299276146
.abstracting: (0<=p52)
states: 202,319,990,341 (11)
abstracting: (p52<=0)
states: 179,866,268,089 (11)
abstracting: (1<=p58)
states: 17,815,662,774 (10)
abstracting: (p58<=1)
states: 202,319,990,341 (11)
.abstracting: (0<=p43)
states: 202,319,990,341 (11)
abstracting: (p43<=0)
states: 202,318,023,933 (11)
abstracting: (1<=p29)
states: 148,685,104 (8)
abstracting: (p29<=1)
states: 202,319,990,341 (11)
..abstracting: (0<=p35)
states: 202,319,990,341 (11)
abstracting: (p35<=0)
states: 178,403,826,565 (11)
abstracting: (0<=p41)
states: 202,319,990,341 (11)
abstracting: (p41<=0)
states: 131,949,649,747 (11)
abstracting: (1<=p9)
states: 127,168 (5)
abstracting: (p9<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p106)
states: 202,319,990,341 (11)
abstracting: (p106<=0)
states: 173,041,701,877 (11)
abstracting: (1<=p4)
states: 72,230,342,742 (10)
abstracting: (p4<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p97)
states: 202,319,990,341 (11)
abstracting: (p97<=0)
states: 136,313,102,227 (11)
..........................................
before gc: list nodes free: 5975811

after gc: idd nodes used:7508435, unused:56491565; list nodes free:271538156
.MC time: 3m18.409sec

checking: AG [[[EG [[[p82<=0 & 0<=p82] & [p4<=1 & 1<=p4]]] | [[p90<=0 & 0<=p90] | [p50<=1 & 1<=p50]]] & [[EF [[[p15<=0 & 0<=p15] | [p92<=1 & 1<=p92]]] | [~ [E [[p21<=1 & 1<=p21] U [p9<=0 & 0<=p9]]] | [p99<=0 & 0<=p99]]] | [[[p6<=1 & 1<=p6] | [p119<=0 & 0<=p119]] | [[p101<=1 & 1<=p101] | [[[p7<=0 & 0<=p7] | [p93<=1 & 1<=p93]] & [[p50<=0 & 0<=p50] | [p107<=1 & 1<=p107]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p107<=1 & 1<=p107] | [p50<=0 & 0<=p50]] & [[p93<=1 & 1<=p93] | [p7<=0 & 0<=p7]]] | [p101<=1 & 1<=p101]] | [[p119<=0 & 0<=p119] | [p6<=1 & 1<=p6]]] | [[[p99<=0 & 0<=p99] | ~ [E [[p21<=1 & 1<=p21] U [p9<=0 & 0<=p9]]]] | E [true U [[p92<=1 & 1<=p92] | [p15<=0 & 0<=p15]]]]] & [[[p50<=1 & 1<=p50] | [p90<=0 & 0<=p90]] | EG [[[p4<=1 & 1<=p4] & [p82<=0 & 0<=p82]]]]]]]]

abstracting: (0<=p82)
states: 202,319,990,341 (11)
abstracting: (p82<=0)
states: 132,999,569,305 (11)
abstracting: (1<=p4)
states: 72,230,342,742 (10)
abstracting: (p4<=1)
states: 202,319,990,341 (11)
...........................................................................
before gc: list nodes free: 3804155

after gc: idd nodes used:3912146, unused:60087854; list nodes free:288052530
.MC time: 2m54.222sec

checking: [E [E [EG [[[p6<=0 & 0<=p6] | [[p85<=1 & 1<=p85] | [p29<=1 & 1<=p29]]]] U [[p117<=0 & 0<=p117] | [p90<=1 & 1<=p90]]] U [p101<=1 & 1<=p101]] | [AX [1<=0] | [EG [[AG [[p99<=0 & 0<=p99]] | AG [[[p73<=0 & 0<=p73] | [p1<=1 & 1<=p1]]]]] & E [~ [[A [[p8<=1 & 1<=p8] U [[p34<=0 & 0<=p34] | [p33<=1 & 1<=p33]]] | ~ [AG [[[p16<=0 & 0<=p16] | [p55<=1 & 1<=p55]]]]]] U [~ [[A [[p113<=0 & 0<=p113] U [p72<=0 & 0<=p72]] | EF [[p95<=1 & 1<=p95]]]] & [EX [[p109<=1 & 1<=p109]] & [p39<=1 & 1<=p39]]]]]]]
normalized: [[[E [~ [[E [true U ~ [[[p55<=1 & 1<=p55] | [p16<=0 & 0<=p16]]]] | [~ [EG [~ [[[p33<=1 & 1<=p33] | [p34<=0 & 0<=p34]]]]] & ~ [E [~ [[[p33<=1 & 1<=p33] | [p34<=0 & 0<=p34]]] U [~ [[p8<=1 & 1<=p8]] & ~ [[[p33<=1 & 1<=p33] | [p34<=0 & 0<=p34]]]]]]]]] U [~ [[[~ [EG [~ [[p72<=0 & 0<=p72]]]] & ~ [E [~ [[p72<=0 & 0<=p72]] U [~ [[p113<=0 & 0<=p113]] & ~ [[p72<=0 & 0<=p72]]]]]] | E [true U [p95<=1 & 1<=p95]]]] & [[p39<=1 & 1<=p39] & EX [[p109<=1 & 1<=p109]]]]] & EG [[~ [E [true U ~ [[[p1<=1 & 1<=p1] | [p73<=0 & 0<=p73]]]]] | ~ [E [true U ~ [[p99<=0 & 0<=p99]]]]]]] | ~ [EX [~ [1<=0]]]] | E [E [EG [[[[p29<=1 & 1<=p29] | [p85<=1 & 1<=p85]] | [p6<=0 & 0<=p6]]] U [[p90<=1 & 1<=p90] | [p117<=0 & 0<=p117]]] U [p101<=1 & 1<=p101]]]

abstracting: (1<=p101)
states: 29,278,154,652 (10)
abstracting: (p101<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p117)
states: 202,319,990,341 (11)
abstracting: (p117<=0)
states: 180,644,128,642 (11)
abstracting: (1<=p90)
states: 25,158,705,384 (10)
abstracting: (p90<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p6)
states: 202,319,990,341 (11)
abstracting: (p6<=0)
states: 202,319,986,367 (11)
abstracting: (1<=p85)
states: 67,440,034,958 (10)
abstracting: (p85<=1)
states: 202,319,990,341 (11)
abstracting: (1<=p29)
states: 148,685,104 (8)
abstracting: (p29<=1)
states: 202,319,990,341 (11)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (0<=p99)
states: 202,319,990,341 (11)
abstracting: (p99<=0)
states: 136,206,879,943 (11)
abstracting: (0<=p73)
states: 202,319,990,341 (11)
abstracting: (p73<=0)
states: 173,841,632,671 (11)
abstracting: (1<=p1)
states: 3,974 (3)
abstracting: (p1<=1)
states: 202,319,990,341 (11)
.
EG iterations: 1
abstracting: (1<=p109)
states: 134,379 (5)
abstracting: (p109<=1)
states: 202,319,990,341 (11)
.abstracting: (1<=p39)
states: 502,350,472 (8)
abstracting: (p39<=1)
states: 202,319,990,341 (11)
abstracting: (1<=p95)
states: 1,169,240,931 (9)
abstracting: (p95<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p72)
states: 202,319,990,341 (11)
abstracting: (p72<=0)
states: 132,270,977,599 (11)
abstracting: (0<=p113)
states: 202,319,990,341 (11)
abstracting: (p113<=0)
states: 180,397,744,093 (11)
abstracting: (0<=p72)
states: 202,319,990,341 (11)
abstracting: (p72<=0)
states: 132,270,977,599 (11)
abstracting: (0<=p72)
states: 202,319,990,341 (11)
abstracting: (p72<=0)
states: 132,270,977,599 (11)
..............................
before gc: list nodes free: 4636323

after gc: idd nodes used:4296484, unused:59703516; list nodes free:286604678
MC time: 2m35.081sec

checking: E [~ [[p89<=1 & 1<=p89]] U EX [[AF [AX [[p77<=0 & 0<=p77]]] & ~ [[[p53<=0 & 0<=p53] | [p101<=1 & 1<=p101]]]]]]
normalized: E [~ [[p89<=1 & 1<=p89]] U EX [[~ [[[p101<=1 & 1<=p101] | [p53<=0 & 0<=p53]]] & ~ [EG [EX [~ [[p77<=0 & 0<=p77]]]]]]]]

abstracting: (0<=p77)
states: 202,319,990,341 (11)
abstracting: (p77<=0)
states: 146,181,602,701 (11)
...........................................................................................
before gc: list nodes free: 3071330

after gc: idd nodes used:3637588, unused:60362412; list nodes free:289612307
...................................................................
before gc: list nodes free: 2253862

after gc: idd nodes used:3627332, unused:60372668; list nodes free:289720888
.............................................................................................................
EG iterations: 266
abstracting: (0<=p53)
states: 202,319,990,341 (11)
abstracting: (p53<=0)
states: 176,533,926,091 (11)
abstracting: (1<=p101)
states: 29,278,154,652 (10)
abstracting: (p101<=1)
states: 202,319,990,341 (11)
.abstracting: (1<=p89)
states: 22,993,659,432 (10)
abstracting: (p89<=1)
states: 202,319,990,341 (11)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m48.590sec

checking: AF [[[p9<=1 & 1<=p9] & AX [~ [A [[[p8<=0 & 0<=p8] | [p16<=1 & 1<=p16]] U [[p78<=0 & 0<=p78] | [p85<=1 & 1<=p85]]]]]]]
normalized: ~ [EG [~ [[~ [EX [[~ [EG [~ [[[p85<=1 & 1<=p85] | [p78<=0 & 0<=p78]]]]] & ~ [E [~ [[[p85<=1 & 1<=p85] | [p78<=0 & 0<=p78]]] U [~ [[[p16<=1 & 1<=p16] | [p8<=0 & 0<=p8]]] & ~ [[[p85<=1 & 1<=p85] | [p78<=0 & 0<=p78]]]]]]]]] & [p9<=1 & 1<=p9]]]]]

abstracting: (1<=p9)
states: 127,168 (5)
abstracting: (p9<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p78)
states: 202,319,990,341 (11)
abstracting: (p78<=0)
states: 143,804,826,211 (11)
abstracting: (1<=p85)
states: 67,440,034,958 (10)
abstracting: (p85<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p8)
states: 202,319,990,341 (11)
abstracting: (p8<=0)
states: 202,319,926,757 (11)
abstracting: (1<=p16)
states: 28,487,586,214 (10)
abstracting: (p16<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p78)
states: 202,319,990,341 (11)
abstracting: (p78<=0)
states: 143,804,826,211 (11)
abstracting: (1<=p85)
states: 67,440,034,958 (10)
abstracting: (p85<=1)
states: 202,319,990,341 (11)
abstracting: (0<=p78)
states: 202,319,990,341 (11)
abstracting: (p78<=0)
states: 143,804,826,211 (11)
abstracting: (1<=p85)
states: 67,440,034,958 (10)
abstracting: (p85<=1)
states: 202,319,990,341 (11)
..
before gc: list nodes free: 6373947

after gc: idd nodes used:2498969, unused:61501031; list nodes free:294928910
.........................................................................................................
before gc: list nodes free: 5232589

after gc: idd nodes used:3959629, unused:60040371; list nodes free:288132441
..........................................................................................................................
EG iterations: 229
.
EG iterations: 0
-> the formula is FALSE

FORMULA ShieldIIPs-PT-002B-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5875200 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098152 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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

447341
iterations count:148049 (1254), effective:13686 (115)

initing FirstDep: 0m 0.000sec


iterations count:3681 (31), effective:210 (1)

iterations count:1386 (11), effective:94 (0)

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

iterations count:31507 (267), effective:2505 (21)

sat_reach.icc:155: Timeout: after 345 sec


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

net_ddint.h:600: Timeout: after 310 sec


net_ddint.h:600: Timeout: after 279 sec


net_ddint.h:600: Timeout: after 251 sec


iterations count:2804 (23), effective:223 (1)

iterations count:260 (2), effective:15 (0)

net_ddint.h:600: Timeout: after 247 sec


iterations count:3446 (29), effective:246 (2)

iterations count:18655 (158), effective:1529 (12)

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

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

iterations count:7780 (65), effective:577 (4)

net_ddint.h:600: Timeout: after 220 sec


iterations count:32110 (272), effective:2529 (21)

ctl_mc.icc:221: Timeout: after 195 sec


net_ddint.h:600: Timeout: after 173 sec


iterations count:3225 (27), effective:245 (2)

iterations count:3919 (33), effective:282 (2)

iterations count:4760 (40), effective:381 (3)

iterations count:4916 (41), effective:398 (3)

iterations count:140 (1), effective:7 (0)

iterations count:4614 (39), effective:362 (3)

net_ddint.h:600: Timeout: after 154 sec


iterations count:3993 (33), effective:313 (2)

iterations count:141 (1), effective:4 (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="ShieldIIPs-PT-002B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldIIPs-PT-002B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717400025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002B.tgz
mv ShieldIIPs-PT-002B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;