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-167903717600185.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 ShieldIIPt-PT-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 17K 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 ShieldIIPt-PT-001B-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-001B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679497664452

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=ShieldIIPt-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:07:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:07:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:07:46] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-22 15:07:46] [INFO ] Transformed 73 places.
[2023-03-22 15:07:46] [INFO ] Transformed 68 transitions.
[2023-03-22 15:07:46] [INFO ] Found NUPN structural information;
[2023-03-22 15:07:46] [INFO ] Parsed PT model containing 73 places and 68 transitions and 168 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ShieldIIPt-PT-001B-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Applied a total of 0 rules in 12 ms. Remains 73 /73 variables (removed 0) and now considering 68/68 (removed 0) transitions.
// Phase 1: matrix 68 rows 73 cols
[2023-03-22 15:07:46] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-22 15:07:47] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-22 15:07:47] [INFO ] Invariant cache hit.
[2023-03-22 15:07:47] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-22 15:07:47] [INFO ] Invariant cache hit.
[2023-03-22 15:07:47] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 726 ms. Remains : 73/73 places, 68/68 transitions.
Support contains 55 out of 73 places after structural reductions.
[2023-03-22 15:07:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-22 15:07:47] [INFO ] Flatten gal took : 27 ms
[2023-03-22 15:07:47] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldIIPt-PT-001B-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:07:47] [INFO ] Flatten gal took : 8 ms
[2023-03-22 15:07:47] [INFO ] Input system was already deterministic with 68 transitions.
Support contains 49 out of 73 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 43) seen :42
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 15:07:47] [INFO ] Invariant cache hit.
[2023-03-22 15:07:47] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:07:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-22 15:07:48] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2023-03-22 15:07:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 121 ms
[2023-03-22 15:07:48] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 15:07:48] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 11 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 73 transition count 58
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 63 transition count 56
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 27 place count 62 transition count 52
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 31 place count 58 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 31 place count 58 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 41 place count 53 transition count 47
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 43 place count 51 transition count 45
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 51 transition count 45
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 73 place count 37 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 37 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 36 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 36 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 35 transition count 29
Applied a total of 77 rules in 40 ms. Remains 35 /73 variables (removed 38) and now considering 29/68 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 35/73 places, 29/68 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Probably explored full state space saw : 14561 states, properties seen :0
Probabilistic random walk after 77217 steps, saw 14561 distinct states, run finished after 101 ms. (steps per millisecond=764 ) properties seen :0
Explored full state space saw : 14561 states, properties seen :0
Exhaustive walk after 77217 steps, saw 14561 distinct states, run finished after 47 ms. (steps per millisecond=1642 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:07:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-001B-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 68 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 72 transition count 58
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 63 transition count 56
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 27 place count 62 transition count 50
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 33 place count 56 transition count 50
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 33 place count 56 transition count 43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 47 place count 49 transition count 43
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 53 place count 43 transition count 37
Iterating global reduction 4 with 6 rules applied. Total rules applied 59 place count 43 transition count 37
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 87 place count 29 transition count 23
Applied a total of 87 rules in 9 ms. Remains 29 /73 variables (removed 44) and now considering 23/68 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 29/73 places, 23/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Applied a total of 24 rules in 5 ms. Remains 61 /73 variables (removed 12) and now considering 56/68 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 61/73 places, 56/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 67 transition count 62
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 67 transition count 62
Applied a total of 12 rules in 3 ms. Remains 67 /73 variables (removed 6) and now considering 62/68 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 67/73 places, 62/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 65 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 59
Applied a total of 18 rules in 3 ms. Remains 64 /73 variables (removed 9) and now considering 59/68 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/73 places, 59/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 62 transition count 57
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 60 transition count 55
Applied a total of 26 rules in 4 ms. Remains 60 /73 variables (removed 13) and now considering 55/68 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 60/73 places, 55/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 12 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Applied a total of 20 rules in 3 ms. Remains 63 /73 variables (removed 10) and now considering 58/68 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/73 places, 58/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 72 transition count 50
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 53 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 39 place count 53 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 49 place count 48 transition count 42
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 56 place count 41 transition count 35
Iterating global reduction 4 with 7 rules applied. Total rules applied 63 place count 41 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 63 place count 41 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 39 transition count 33
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 91 place count 27 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 26 transition count 20
Applied a total of 92 rules in 8 ms. Remains 26 /73 variables (removed 47) and now considering 20/68 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 26/73 places, 20/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 63 transition count 58
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 61 transition count 56
Applied a total of 24 rules in 5 ms. Remains 61 /73 variables (removed 12) and now considering 56/68 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 61/73 places, 56/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 73 transition count 55
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 17 rules applied. Total rules applied 30 place count 60 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 57 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 33 place count 57 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 41 place count 53 transition count 47
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 50 transition count 44
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 50 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 47 place count 50 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 49 transition count 43
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 73 place count 37 transition count 31
Applied a total of 73 rules in 7 ms. Remains 37 /73 variables (removed 36) and now considering 31/68 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 37/73 places, 31/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 72 transition count 53
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 58 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 56 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 32 place count 56 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 40 place count 52 transition count 47
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 46 place count 46 transition count 41
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 46 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 52 place count 46 transition count 38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 43 transition count 38
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 74 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 34 transition count 29
Applied a total of 75 rules in 7 ms. Remains 34 /73 variables (removed 39) and now considering 29/68 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 34/73 places, 29/68 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:07:48] [INFO ] Input system was already deterministic with 29 transitions.
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:07:48] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 15:07:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 68 transitions and 168 arcs took 0 ms.
Total runtime 2134 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: 73 NrTr: 68 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 3.482sec


RS generation: 0m 0.053sec


-> reachability set: #nodes 2360 (2.4e+03) #states 3,260,241 (6)



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

checking: EG [EX [AX [[[p22<=1 & 1<=p22] & [p70<=1 & 1<=p70]]]]]
normalized: EG [EX [~ [EX [~ [[[p70<=1 & 1<=p70] & [p22<=1 & 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 1,098,812 (6)
abstracting: (p22<=1)
states: 3,260,241 (6)
abstracting: (1<=p70)
states: 351,462 (5)
abstracting: (p70<=1)
states: 3,260,241 (6)
....
EG iterations: 2
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.107sec

checking: ~ [A [[p3<=0 & 0<=p3] U AF [EX [[AF [[p59<=1 & 1<=p59]] & ~ [[p66<=0 & 0<=p66]]]]]]]
normalized: ~ [[~ [EG [EG [~ [EX [[~ [[p66<=0 & 0<=p66]] & ~ [EG [~ [[p59<=1 & 1<=p59]]]]]]]]]] & ~ [E [EG [~ [EX [[~ [[p66<=0 & 0<=p66]] & ~ [EG [~ [[p59<=1 & 1<=p59]]]]]]]] U [~ [[p3<=0 & 0<=p3]] & EG [~ [EX [[~ [[p66<=0 & 0<=p66]] & ~ [EG [~ [[p59<=1 & 1<=p59]]]]]]]]]]]]]

abstracting: (1<=p59)
states: 372,168 (5)
abstracting: (p59<=1)
states: 3,260,241 (6)
..................................................................................................................
EG iterations: 114
abstracting: (0<=p66)
states: 3,260,241 (6)
abstracting: (p66<=0)
states: 2,888,931 (6)
.....................
EG iterations: 20
abstracting: (0<=p3)
states: 3,260,241 (6)
abstracting: (p3<=0)
states: 2,152,965 (6)
abstracting: (1<=p59)
states: 372,168 (5)
abstracting: (p59<=1)
states: 3,260,241 (6)
..................................................................................................................
EG iterations: 114
abstracting: (0<=p66)
states: 3,260,241 (6)
abstracting: (p66<=0)
states: 2,888,931 (6)
.....................
EG iterations: 20
abstracting: (1<=p59)
states: 372,168 (5)
abstracting: (p59<=1)
states: 3,260,241 (6)
..................................................................................................................
EG iterations: 114
abstracting: (0<=p66)
states: 3,260,241 (6)
abstracting: (p66<=0)
states: 2,888,931 (6)
.....................
EG iterations: 20
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.230sec

checking: AF [EG [[~ [[p8<=1 & 1<=p8]] & [~ [[p56<=0 & 0<=p56]] | ~ [[p54<=1 & 1<=p54]]]]]]
normalized: ~ [EG [~ [EG [[[~ [[p54<=1 & 1<=p54]] | ~ [[p56<=0 & 0<=p56]]] & ~ [[p8<=1 & 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 48
abstracting: (p8<=1)
states: 3,260,241 (6)
abstracting: (0<=p56)
states: 3,260,241 (6)
abstracting: (p56<=0)
states: 2,888,991 (6)
abstracting: (1<=p54)
states: 371,250 (5)
abstracting: (p54<=1)
states: 3,260,241 (6)
........................................................................................
EG iterations: 88
.........................................................................................
EG iterations: 89
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.171sec

checking: AF [~ [A [~ [[[p64<=0 & 0<=p64] | [p18<=1 & 1<=p18]]] U AG [AX [[[p19<=0 & 0<=p19] | [p32<=1 & 1<=p32]]]]]]]
normalized: ~ [EG [[~ [EG [E [true U EX [~ [[[p32<=1 & 1<=p32] | [p19<=0 & 0<=p19]]]]]]] & ~ [E [E [true U EX [~ [[[p32<=1 & 1<=p32] | [p19<=0 & 0<=p19]]]]] U [E [true U EX [~ [[[p32<=1 & 1<=p32] | [p19<=0 & 0<=p19]]]]] & [[p18<=1 & 1<=p18] | [p64<=0 & 0<=p64]]]]]]]]

abstracting: (0<=p64)
states: 3,260,241 (6)
abstracting: (p64<=0)
states: 2,888,931 (6)
abstracting: (1<=p18)
states: 937,494 (5)
abstracting: (p18<=1)
states: 3,260,241 (6)
abstracting: (0<=p19)
states: 3,260,241 (6)
abstracting: (p19<=0)
states: 2,444,601 (6)
abstracting: (1<=p32)
states: 335,700 (5)
abstracting: (p32<=1)
states: 3,260,241 (6)
.abstracting: (0<=p19)
states: 3,260,241 (6)
abstracting: (p19<=0)
states: 2,444,601 (6)
abstracting: (1<=p32)
states: 335,700 (5)
abstracting: (p32<=1)
states: 3,260,241 (6)
.abstracting: (0<=p19)
states: 3,260,241 (6)
abstracting: (p19<=0)
states: 2,444,601 (6)
abstracting: (1<=p32)
states: 335,700 (5)
abstracting: (p32<=1)
states: 3,260,241 (6)
.....................
EG iterations: 20
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

checking: EF [[AG [[EF [[[p47<=0 & 0<=p47] & [p62<=1 & 1<=p62]]] & [[p56<=0 & 0<=p56] & [p68<=1 & 1<=p68]]]] & [p39<=1 & 1<=p39]]]
normalized: E [true U [[p39<=1 & 1<=p39] & ~ [E [true U ~ [[[[p68<=1 & 1<=p68] & [p56<=0 & 0<=p56]] & E [true U [[p62<=1 & 1<=p62] & [p47<=0 & 0<=p47]]]]]]]]]

abstracting: (0<=p47)
states: 3,260,241 (6)
abstracting: (p47<=0)
states: 2,797,890 (6)
abstracting: (1<=p62)
states: 469
abstracting: (p62<=1)
states: 3,260,241 (6)
abstracting: (0<=p56)
states: 3,260,241 (6)
abstracting: (p56<=0)
states: 2,888,991 (6)
abstracting: (1<=p68)
states: 371,310 (5)
abstracting: (p68<=1)
states: 3,260,241 (6)
abstracting: (1<=p39)
states: 88,419 (4)
abstracting: (p39<=1)
states: 3,260,241 (6)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EG [EF [[~ [A [[[p28<=0 & 0<=p28] | [p8<=1 & 1<=p8]] U [[p25<=0 & 0<=p25] | [p12<=1 & 1<=p12]]]] | ~ [E [[[p33<=0 & 0<=p33] | [p16<=1 & 1<=p16]] U [p43<=0 & 0<=p43]]]]]]
normalized: EG [E [true U [~ [E [[[p16<=1 & 1<=p16] | [p33<=0 & 0<=p33]] U [p43<=0 & 0<=p43]]] | ~ [[~ [EG [~ [[[p12<=1 & 1<=p12] | [p25<=0 & 0<=p25]]]]] & ~ [E [~ [[[p12<=1 & 1<=p12] | [p25<=0 & 0<=p25]]] U [~ [[[p8<=1 & 1<=p8] | [p28<=0 & 0<=p28]]] & ~ [[[p12<=1 & 1<=p12] | [p25<=0 & 0<=p25]]]]]]]]]]]

abstracting: (0<=p25)
states: 3,260,241 (6)
abstracting: (p25<=0)
states: 2,173,404 (6)
abstracting: (1<=p12)
states: 1,081,072 (6)
abstracting: (p12<=1)
states: 3,260,241 (6)
abstracting: (0<=p28)
states: 3,260,241 (6)
abstracting: (p28<=0)
states: 3,171,822 (6)
abstracting: (1<=p8)
states: 48
abstracting: (p8<=1)
states: 3,260,241 (6)
abstracting: (0<=p25)
states: 3,260,241 (6)
abstracting: (p25<=0)
states: 2,173,404 (6)
abstracting: (1<=p12)
states: 1,081,072 (6)
abstracting: (p12<=1)
states: 3,260,241 (6)
abstracting: (0<=p25)
states: 3,260,241 (6)
abstracting: (p25<=0)
states: 2,173,404 (6)
abstracting: (1<=p12)
states: 1,081,072 (6)
abstracting: (p12<=1)
states: 3,260,241 (6)
..................................................................................................................................................................
EG iterations: 162
abstracting: (0<=p43)
states: 3,260,241 (6)
abstracting: (p43<=0)
states: 2,818,083 (6)
abstracting: (0<=p33)
states: 3,260,241 (6)
abstracting: (p33<=0)
states: 2,924,541 (6)
abstracting: (1<=p16)
states: 409,398 (5)
abstracting: (p16<=1)
states: 3,260,241 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.595sec

checking: [EG [EF [[AX [[[p48<=0 & 0<=p48] & [p46<=1 & 1<=p46]]] & ~ [A [[p21<=1 & 1<=p21] U [p56<=1 & 1<=p56]]]]]] & [AG [AX [AF [[[p43<=0 & 0<=p43] & [p14<=1 & 1<=p14]]]]] & EG [AG [[[p34<=0 & 0<=p34] | [p22<=1 & 1<=p22]]]]]]
normalized: [[EG [~ [E [true U ~ [[[p22<=1 & 1<=p22] | [p34<=0 & 0<=p34]]]]]] & ~ [E [true U EX [EG [~ [[[p14<=1 & 1<=p14] & [p43<=0 & 0<=p43]]]]]]]] & EG [E [true U [~ [[~ [EG [~ [[p56<=1 & 1<=p56]]]] & ~ [E [~ [[p56<=1 & 1<=p56]] U [~ [[p21<=1 & 1<=p21]] & ~ [[p56<=1 & 1<=p56]]]]]]] & ~ [EX [~ [[[p46<=1 & 1<=p46] & [p48<=0 & 0<=p48]]]]]]]]]

abstracting: (0<=p48)
states: 3,260,241 (6)
abstracting: (p48<=0)
states: 3,208,455 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)
.abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p21)
states: 882,126 (5)
abstracting: (p21<=1)
states: 3,260,241 (6)
abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
...............................................................................................................................
EG iterations: 127

EG iterations: 0
abstracting: (0<=p43)
states: 3,260,241 (6)
abstracting: (p43<=0)
states: 2,818,083 (6)
abstracting: (1<=p14)
states: 1,076,406 (6)
abstracting: (p14<=1)
states: 3,260,241 (6)
........................................
EG iterations: 40
.abstracting: (0<=p34)
states: 3,260,241 (6)
abstracting: (p34<=0)
states: 2,924,541 (6)
abstracting: (1<=p22)
states: 1,098,812 (6)
abstracting: (p22<=1)
states: 3,260,241 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.264sec

checking: EG [[EX [A [[AF [[p58<=0 & 0<=p58]] & [[[p38<=0 & 0<=p38] | [p10<=1 & 1<=p10]] & [[p31<=0 & 0<=p31] | [p66<=1 & 1<=p66]]]] U [EX [[p48<=0 & 0<=p48]] | EF [[p38<=1 & 1<=p38]]]]] | AG [[p60<=1 & 1<=p60]]]]
normalized: EG [[~ [E [true U ~ [[p60<=1 & 1<=p60]]]] | EX [[~ [EG [~ [[E [true U [p38<=1 & 1<=p38]] | EX [[p48<=0 & 0<=p48]]]]]] & ~ [E [~ [[E [true U [p38<=1 & 1<=p38]] | EX [[p48<=0 & 0<=p48]]]] U [~ [[[[[p66<=1 & 1<=p66] | [p31<=0 & 0<=p31]] & [[p10<=1 & 1<=p10] | [p38<=0 & 0<=p38]]] & ~ [EG [~ [[p58<=0 & 0<=p58]]]]]] & ~ [[E [true U [p38<=1 & 1<=p38]] | EX [[p48<=0 & 0<=p48]]]]]]]]]]]

abstracting: (0<=p48)
states: 3,260,241 (6)
abstracting: (p48<=0)
states: 3,208,455 (6)
.abstracting: (1<=p38)
states: 88,419 (4)
abstracting: (p38<=1)
states: 3,260,241 (6)
abstracting: (0<=p58)
states: 3,260,241 (6)
abstracting: (p58<=0)
states: 2,894,748 (6)
........................................................................................
EG iterations: 88
abstracting: (0<=p38)
states: 3,260,241 (6)
abstracting: (p38<=0)
states: 3,171,822 (6)
abstracting: (1<=p10)
states: 5,392 (3)
abstracting: (p10<=1)
states: 3,260,241 (6)
abstracting: (0<=p31)
states: 3,260,241 (6)
abstracting: (p31<=0)
states: 2,924,541 (6)
abstracting: (1<=p66)
states: 371,310 (5)
abstracting: (p66<=1)
states: 3,260,241 (6)
abstracting: (0<=p48)
states: 3,260,241 (6)
abstracting: (p48<=0)
states: 3,208,455 (6)
.abstracting: (1<=p38)
states: 88,419 (4)
abstracting: (p38<=1)
states: 3,260,241 (6)
abstracting: (0<=p48)
states: 3,260,241 (6)
abstracting: (p48<=0)
states: 3,208,455 (6)
.abstracting: (1<=p38)
states: 88,419 (4)
abstracting: (p38<=1)
states: 3,260,241 (6)
..
EG iterations: 2
.abstracting: (1<=p60)
states: 351
abstracting: (p60<=1)
states: 3,260,241 (6)
...................
EG iterations: 19
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.808sec

checking: E [~ [[[~ [[[p56<=1 & 1<=p56] | [p7<=1 & 1<=p7]]] | EF [[[p58<=0 & 0<=p58] | [p67<=1 & 1<=p67]]]] & [[AG [[p19<=0 & 0<=p19]] & ~ [EG [[[p5<=0 & 0<=p5] | [p61<=1 & 1<=p61]]]]] | [A [EX [[p33<=0 & 0<=p33]] U AG [[p20<=1 & 1<=p20]]] & AG [[[p60<=0 & 0<=p60] | [p22<=1 & 1<=p22]]]]]]] U EF [~ [E [AF [[[p41<=0 & 0<=p41] | [p19<=1 & 1<=p19]]] U EF [[p10<=0 & 0<=p10]]]]]]
normalized: E [~ [[[[~ [E [true U ~ [[[p22<=1 & 1<=p22] | [p60<=0 & 0<=p60]]]]] & [~ [EG [E [true U ~ [[p20<=1 & 1<=p20]]]]] & ~ [E [E [true U ~ [[p20<=1 & 1<=p20]]] U [~ [EX [[p33<=0 & 0<=p33]]] & E [true U ~ [[p20<=1 & 1<=p20]]]]]]]] | [~ [EG [[[p61<=1 & 1<=p61] | [p5<=0 & 0<=p5]]]] & ~ [E [true U ~ [[p19<=0 & 0<=p19]]]]]] & [E [true U [[p67<=1 & 1<=p67] | [p58<=0 & 0<=p58]]] | ~ [[[p7<=1 & 1<=p7] | [p56<=1 & 1<=p56]]]]]] U E [true U ~ [E [~ [EG [~ [[[p19<=1 & 1<=p19] | [p41<=0 & 0<=p41]]]]] U E [true U [p10<=0 & 0<=p10]]]]]]

abstracting: (0<=p10)
states: 3,260,241 (6)
abstracting: (p10<=0)
states: 3,254,849 (6)
abstracting: (0<=p41)
states: 3,260,241 (6)
abstracting: (p41<=0)
states: 2,818,083 (6)
abstracting: (1<=p19)
states: 815,640 (5)
abstracting: (p19<=1)
states: 3,260,241 (6)
.............................
EG iterations: 29
abstracting: (1<=p56)
states: 371,250 (5)
abstracting: (p56<=1)
states: 3,260,241 (6)
abstracting: (1<=p7)
states: 12
abstracting: (p7<=1)
states: 3,260,241 (6)
abstracting: (0<=p58)
states: 3,260,241 (6)
abstracting: (p58<=0)
states: 2,894,748 (6)
abstracting: (1<=p67)
states: 371,310 (5)
abstracting: (p67<=1)
states: 3,260,241 (6)
abstracting: (0<=p19)
states: 3,260,241 (6)
abstracting: (p19<=0)
states: 2,444,601 (6)
abstracting: (0<=p5)
states: 3,260,241 (6)
abstracting: (p5<=0)
states: 3,260,240 (6)
abstracting: (1<=p61)
states: 351
abstracting: (p61<=1)
states: 3,260,241 (6)
...
EG iterations: 3
abstracting: (1<=p20)
states: 871,008 (5)
abstracting: (p20<=1)
states: 3,260,241 (6)
abstracting: (0<=p33)
states: 3,260,241 (6)
abstracting: (p33<=0)
states: 2,924,541 (6)
.abstracting: (1<=p20)
states: 871,008 (5)
abstracting: (p20<=1)
states: 3,260,241 (6)
abstracting: (1<=p20)
states: 871,008 (5)
abstracting: (p20<=1)
states: 3,260,241 (6)
.............
EG iterations: 13
abstracting: (0<=p60)
states: 3,260,241 (6)
abstracting: (p60<=0)
states: 3,259,890 (6)
abstracting: (1<=p22)
states: 1,098,812 (6)
abstracting: (p22<=1)
states: 3,260,241 (6)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: EG [[AF [[[p8<=0 & 0<=p8] | [p2<=1 & 1<=p2]]] | [AG [[~ [A [[[p14<=0 & 0<=p14] | [p36<=1 & 1<=p36]] U [[p19<=0 & 0<=p19] | [p51<=1 & 1<=p51]]]] | [[p35<=0 & 0<=p35] | [p1<=0 & 0<=p1]]]] | [AF [EG [[p67<=1 & 1<=p67]]] & [[[p59<=0 & 0<=p59] | [p65<=1 & 1<=p65]] & [~ [A [[p45<=1 & 1<=p45] U [p15<=1 & 1<=p15]]] | [[p52<=0 & 0<=p52] & [p46<=1 & 1<=p46]]]]]]]]
normalized: EG [[[[[[[[p46<=1 & 1<=p46] & [p52<=0 & 0<=p52]] | ~ [[~ [EG [~ [[p15<=1 & 1<=p15]]]] & ~ [E [~ [[p15<=1 & 1<=p15]] U [~ [[p45<=1 & 1<=p45]] & ~ [[p15<=1 & 1<=p15]]]]]]]] & [[p65<=1 & 1<=p65] | [p59<=0 & 0<=p59]]] & ~ [EG [~ [EG [[p67<=1 & 1<=p67]]]]]] | ~ [E [true U ~ [[[[p1<=0 & 0<=p1] | [p35<=0 & 0<=p35]] | ~ [[~ [EG [~ [[[p51<=1 & 1<=p51] | [p19<=0 & 0<=p19]]]]] & ~ [E [~ [[[p51<=1 & 1<=p51] | [p19<=0 & 0<=p19]]] U [~ [[[p36<=1 & 1<=p36] | [p14<=0 & 0<=p14]]] & ~ [[[p51<=1 & 1<=p51] | [p19<=0 & 0<=p19]]]]]]]]]]]]] | ~ [EG [~ [[[p2<=1 & 1<=p2] | [p8<=0 & 0<=p8]]]]]]]

abstracting: (0<=p8)
states: 3,260,241 (6)
abstracting: (p8<=0)
states: 3,260,193 (6)
abstracting: (1<=p2)
states: 1,051,191 (6)
abstracting: (p2<=1)
states: 3,260,241 (6)
..........
EG iterations: 10
abstracting: (0<=p19)
states: 3,260,241 (6)
abstracting: (p19<=0)
states: 2,444,601 (6)
abstracting: (1<=p51)
states: 320,343 (5)
abstracting: (p51<=1)
states: 3,260,241 (6)
abstracting: (0<=p14)
states: 3,260,241 (6)
abstracting: (p14<=0)
states: 2,183,835 (6)
abstracting: (1<=p36)
states: 332,910 (5)
abstracting: (p36<=1)
states: 3,260,241 (6)
abstracting: (0<=p19)
states: 3,260,241 (6)
abstracting: (p19<=0)
states: 2,444,601 (6)
abstracting: (1<=p51)
states: 320,343 (5)
abstracting: (p51<=1)
states: 3,260,241 (6)
abstracting: (0<=p19)
states: 3,260,241 (6)
abstracting: (p19<=0)
states: 2,444,601 (6)
abstracting: (1<=p51)
states: 320,343 (5)
abstracting: (p51<=1)
states: 3,260,241 (6)
......................
EG iterations: 22
abstracting: (0<=p35)
states: 3,260,241 (6)
abstracting: (p35<=0)
states: 2,924,541 (6)
abstracting: (0<=p1)
states: 3,260,241 (6)
abstracting: (p1<=0)
states: 2,158,468 (6)
abstracting: (1<=p67)
states: 371,310 (5)
abstracting: (p67<=1)
states: 3,260,241 (6)
...............................................................................
EG iterations: 79

EG iterations: 0
abstracting: (0<=p59)
states: 3,260,241 (6)
abstracting: (p59<=0)
states: 2,888,073 (6)
abstracting: (1<=p65)
states: 352,209 (5)
abstracting: (p65<=1)
states: 3,260,241 (6)
abstracting: (1<=p15)
states: 562,777 (5)
abstracting: (p15<=1)
states: 3,260,241 (6)
abstracting: (1<=p45)
states: 442,158 (5)
abstracting: (p45<=1)
states: 3,260,241 (6)
abstracting: (1<=p15)
states: 562,777 (5)
abstracting: (p15<=1)
states: 3,260,241 (6)
abstracting: (1<=p15)
states: 562,777 (5)
abstracting: (p15<=1)
states: 3,260,241 (6)
......................................
EG iterations: 38
abstracting: (0<=p52)
states: 3,260,241 (6)
abstracting: (p52<=0)
states: 2,888,991 (6)
abstracting: (1<=p46)
states: 442,158 (5)
abstracting: (p46<=1)
states: 3,260,241 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001B-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.541sec

totally nodes used: 10050237 (1.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8502388 22432951 30935339
used/not used/entry size/cache size: 25304459 41804405 16 1024MB
basic ops cache: hits/miss/sum: 1298878 2924597 4223475
used/not used/entry size/cache size: 5339336 11437880 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 10859 29796 40655
used/not used/entry size/cache size: 29760 8358848 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 58470589
1 7429252
2 1030613
3 156332
4 19847
5 2025
6 192
7 14
8 0
9 0
>= 10 0

Total processing time: 0m16.286sec


BK_STOP 1679497685150

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


iterations count:2494 (36), effective:451 (6)

initing FirstDep: 0m 0.000sec


iterations count:262 (3), effective:34 (0)

iterations count:643 (9), effective:78 (1)

iterations count:643 (9), effective:78 (1)

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

iterations count:643 (9), effective:78 (1)

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

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

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

iterations count:520 (7), effective:65 (0)

iterations count:1938 (28), effective:312 (4)

iterations count:194 (2), effective:13 (0)

iterations count:1327 (19), effective:214 (3)

iterations count:392 (5), effective:45 (0)

iterations count:996 (14), effective:137 (2)

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

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

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

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

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

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

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

iterations count:623 (9), effective:78 (1)

iterations count:301 (4), effective:42 (0)

iterations count:301 (4), effective:42 (0)

iterations count:301 (4), effective:42 (0)

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

iterations count:258 (3), effective:37 (0)

iterations count:945 (13), effective:135 (1)

iterations count:71 (1), effective:1 (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="ShieldIIPt-PT-001B"
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 ShieldIIPt-PT-001B, 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-167903717600185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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