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

About the Execution of Marcie+red for Raft-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.483 8294.00 11503.00 318.40 TFFFTTFFTFFTTTFT 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.r330-tall-167889203100297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Raft-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203100297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.3K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K 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 Raft-PT-03-CTLCardinality-00
FORMULA_NAME Raft-PT-03-CTLCardinality-01
FORMULA_NAME Raft-PT-03-CTLCardinality-02
FORMULA_NAME Raft-PT-03-CTLCardinality-03
FORMULA_NAME Raft-PT-03-CTLCardinality-04
FORMULA_NAME Raft-PT-03-CTLCardinality-05
FORMULA_NAME Raft-PT-03-CTLCardinality-06
FORMULA_NAME Raft-PT-03-CTLCardinality-07
FORMULA_NAME Raft-PT-03-CTLCardinality-08
FORMULA_NAME Raft-PT-03-CTLCardinality-09
FORMULA_NAME Raft-PT-03-CTLCardinality-10
FORMULA_NAME Raft-PT-03-CTLCardinality-11
FORMULA_NAME Raft-PT-03-CTLCardinality-12
FORMULA_NAME Raft-PT-03-CTLCardinality-13
FORMULA_NAME Raft-PT-03-CTLCardinality-14
FORMULA_NAME Raft-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679139868042

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=Raft-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 11:44:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 11:44:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:44:29] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-18 11:44:29] [INFO ] Transformed 53 places.
[2023-03-18 11:44:29] [INFO ] Transformed 98 transitions.
[2023-03-18 11:44:29] [INFO ] Found NUPN structural information;
[2023-03-18 11:44:29] [INFO ] Parsed PT model containing 53 places and 98 transitions and 328 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Raft-PT-03-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 82
Applied a total of 2 rules in 13 ms. Remains 52 /53 variables (removed 1) and now considering 82/84 (removed 2) transitions.
[2023-03-18 11:44:30] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
// Phase 1: matrix 72 rows 52 cols
[2023-03-18 11:44:30] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-18 11:44:30] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-18 11:44:30] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2023-03-18 11:44:30] [INFO ] Invariant cache hit.
[2023-03-18 11:44:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 11:44:30] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-18 11:44:30] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2023-03-18 11:44:30] [INFO ] Invariant cache hit.
[2023-03-18 11:44:30] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 82/84 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 52/53 places, 82/84 transitions.
Support contains 41 out of 52 places after structural reductions.
[2023-03-18 11:44:30] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 24 ms
FORMULA Raft-PT-03-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 10 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 82 transitions.
Support contains 34 out of 52 places (down from 41) after GAL structural reductions.
Finished random walk after 136 steps, including 0 resets, run visited all 31 properties in 29 ms. (steps per millisecond=4 )
[2023-03-18 11:44:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 7 ms
FORMULA Raft-PT-03-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 7 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 82 transitions.
Support contains 32 out of 52 places (down from 34) after GAL structural reductions.
Computed a total of 5 stabilizing places and 9 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 47 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 13 place count 42 transition count 71
Iterating global reduction 0 with 5 rules applied. Total rules applied 18 place count 42 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 23 place count 42 transition count 66
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 42 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 40 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 36 transition count 58
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 36 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 36 transition count 54
Applied a total of 41 rules in 24 ms. Remains 36 /52 variables (removed 16) and now considering 54/82 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 36/52 places, 54/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 80
Applied a total of 2 rules in 3 ms. Remains 51 /52 variables (removed 1) and now considering 80/82 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/52 places, 80/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 80
Applied a total of 2 rules in 2 ms. Remains 51 /52 variables (removed 1) and now considering 80/82 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/52 places, 80/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 46 transition count 74
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 16 place count 40 transition count 68
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 40 transition count 68
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 40 transition count 62
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 40 transition count 59
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 37 transition count 56
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 33 transition count 52
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 33 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 33 transition count 48
Applied a total of 49 rules in 14 ms. Remains 33 /52 variables (removed 19) and now considering 48/82 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 33/52 places, 48/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 78
Applied a total of 4 rules in 2 ms. Remains 50 /52 variables (removed 2) and now considering 78/82 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/52 places, 78/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 80
Applied a total of 2 rules in 7 ms. Remains 51 /52 variables (removed 1) and now considering 80/82 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 51/52 places, 80/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 78
Applied a total of 4 rules in 2 ms. Remains 50 /52 variables (removed 2) and now considering 78/82 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/52 places, 78/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 78
Applied a total of 4 rules in 2 ms. Remains 50 /52 variables (removed 2) and now considering 78/82 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/52 places, 78/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 50 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 78
Applied a total of 4 rules in 3 ms. Remains 50 /52 variables (removed 2) and now considering 78/82 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/52 places, 78/82 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Input system was already deterministic with 78 transitions.
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:44:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:30] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-18 11:44:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 82 transitions and 294 arcs took 1 ms.
Total runtime 1262 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: 52 NrTr: 82 NrArc: 294)

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

net check time: 0m 0.000sec

init dd package: 0m 2.704sec


RS generation: 0m 0.054sec


-> reachability set: #nodes 346 (3.5e+02) #states 27,317,841 (7)



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

checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]

abstracting: (0<=0)
states: 27,317,841 (7)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [AG [[[p7<=0 & 0<=p7] | AG [[p16<=1 & 1<=p16]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [true U ~ [[p16<=1 & 1<=p16]]]] | [p7<=0 & 0<=p7]]]]]]

abstracting: (0<=p7)
states: 27,317,841 (7)
abstracting: (p7<=0)
states: 22,050,881 (7)
abstracting: (1<=p16)
states: 5,266,960 (6)
abstracting: (p16<=1)
states: 27,317,841 (7)
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AF [AX [AF [[~ [[p41<=1 & 1<=p41]] | ~ [[p28<=0 & 0<=p28]]]]]]
normalized: ~ [EG [EX [EG [~ [[~ [[p28<=0 & 0<=p28]] | ~ [[p41<=1 & 1<=p41]]]]]]]]

abstracting: (1<=p41)
states: 5,266,960 (6)
abstracting: (p41<=1)
states: 27,317,841 (7)
abstracting: (0<=p28)
states: 27,317,841 (7)
abstracting: (p28<=0)
states: 22,050,881 (7)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[[p48<=1 & 1<=p48] | EX [[[p32<=0 & 0<=p32] & [p45<=1 & 1<=p45]]]]]
normalized: ~ [E [true U ~ [[EX [[[p45<=1 & 1<=p45] & [p32<=0 & 0<=p32]]] | [p48<=1 & 1<=p48]]]]]

abstracting: (1<=p48)
states: 5,463,568 (6)
abstracting: (p48<=1)
states: 27,317,841 (7)
abstracting: (0<=p32)
states: 27,317,841 (7)
abstracting: (p32<=0)
states: 22,050,881 (7)
abstracting: (1<=p45)
states: 5,463,568 (6)
abstracting: (p45<=1)
states: 27,317,841 (7)
.-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EF [EG [[AG [[EF [[p40<=1 & 1<=p40]] & [p42<=0 & 0<=p42]]] & [~ [E [[[p29<=0 & 0<=p29] | [p40<=1 & 1<=p40]] U [p7<=0 & 0<=p7]]] | AG [~ [[p41<=0 & 0<=p41]]]]]]]
normalized: E [true U EG [[[~ [E [true U [p41<=0 & 0<=p41]]] | ~ [E [[[p40<=1 & 1<=p40] | [p29<=0 & 0<=p29]] U [p7<=0 & 0<=p7]]]] & ~ [E [true U ~ [[[p42<=0 & 0<=p42] & E [true U [p40<=1 & 1<=p40]]]]]]]]]

abstracting: (1<=p40)
states: 5,266,960 (6)
abstracting: (p40<=1)
states: 27,317,841 (7)
abstracting: (0<=p42)
states: 27,317,841 (7)
abstracting: (p42<=0)
states: 22,050,881 (7)
abstracting: (0<=p7)
states: 27,317,841 (7)
abstracting: (p7<=0)
states: 22,050,881 (7)
abstracting: (0<=p29)
states: 27,317,841 (7)
abstracting: (p29<=0)
states: 22,050,881 (7)
abstracting: (1<=p40)
states: 5,266,960 (6)
abstracting: (p40<=1)
states: 27,317,841 (7)
abstracting: (0<=p41)
states: 27,317,841 (7)
abstracting: (p41<=0)
states: 22,050,881 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: [AF [~ [E [EF [[p42<=1 & 1<=p42]] U AG [[[p25<=0 & 0<=p25] | [p49<=1 & 1<=p49]]]]]] & AX [[EG [EX [[[p22<=0 & 0<=p22] & [p3<=1 & 1<=p3]]]] & EF [[p17<=1 & 1<=p17]]]]]
normalized: [~ [EX [~ [[E [true U [p17<=1 & 1<=p17]] & EG [EX [[[p3<=1 & 1<=p3] & [p22<=0 & 0<=p22]]]]]]]] & ~ [EG [E [E [true U [p42<=1 & 1<=p42]] U ~ [E [true U ~ [[[p49<=1 & 1<=p49] | [p25<=0 & 0<=p25]]]]]]]]]

abstracting: (0<=p25)
states: 27,317,841 (7)
abstracting: (p25<=0)
states: 21,067,841 (7)
abstracting: (1<=p49)
states: 6,829,460 (6)
abstracting: (p49<=1)
states: 27,317,841 (7)
abstracting: (1<=p42)
states: 5,266,960 (6)
abstracting: (p42<=1)
states: 27,317,841 (7)
.
EG iterations: 1
abstracting: (0<=p22)
states: 27,317,841 (7)
abstracting: (p22<=0)
states: 22,050,881 (7)
abstracting: (1<=p3)
states: 5,266,960 (6)
abstracting: (p3<=1)
states: 27,317,841 (7)
..
EG iterations: 1
abstracting: (1<=p17)
states: 5,266,960 (6)
abstracting: (p17<=1)
states: 27,317,841 (7)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: AF [[A [EF [[[[p46<=0 & 0<=p46] | [p21<=1 & 1<=p21]] & [[p35<=0 & 0<=p35] & AX [[p43<=1 & 1<=p43]]]]] U [p6<=1 & 1<=p6]] | [[p30<=0 & 0<=p30] & [p14<=1 & 1<=p14]]]]
normalized: ~ [EG [~ [[[[p14<=1 & 1<=p14] & [p30<=0 & 0<=p30]] | [~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [~ [E [true U [[~ [EX [~ [[p43<=1 & 1<=p43]]]] & [p35<=0 & 0<=p35]] & [[p21<=1 & 1<=p21] | [p46<=0 & 0<=p46]]]]] & ~ [[p6<=1 & 1<=p6]]]]]]]]]]

abstracting: (1<=p6)
states: 5,266,960 (6)
abstracting: (p6<=1)
states: 27,317,841 (7)
abstracting: (0<=p46)
states: 27,317,841 (7)
abstracting: (p46<=0)
states: 21,854,273 (7)
abstracting: (1<=p21)
states: 5,266,960 (6)
abstracting: (p21<=1)
states: 27,317,841 (7)
abstracting: (0<=p35)
states: 27,317,841 (7)
abstracting: (p35<=0)
states: 21,067,841 (7)
abstracting: (1<=p43)
states: 5,266,960 (6)
abstracting: (p43<=1)
states: 27,317,841 (7)
.abstracting: (1<=p6)
states: 5,266,960 (6)
abstracting: (p6<=1)
states: 27,317,841 (7)
abstracting: (1<=p6)
states: 5,266,960 (6)
abstracting: (p6<=1)
states: 27,317,841 (7)
.
EG iterations: 1
abstracting: (0<=p30)
states: 27,317,841 (7)
abstracting: (p30<=0)
states: 21,067,841 (7)
abstracting: (1<=p14)
states: 5,266,960 (6)
abstracting: (p14<=1)
states: 27,317,841 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [EG [EF [AG [[p33<=1 & 1<=p33]]]] & AF [[[EG [[[p3<=0 & 0<=p3] & [[p29<=1 & 1<=p29] & [p31<=1 & 1<=p31]]]] & [EX [[[p8<=0 & 0<=p8] & [p17<=1 & 1<=p17]]] | [p9<=0 & 0<=p9]]] | [AG [~ [[p41<=1 & 1<=p41]]] | [p2<=0 & 0<=p2]]]]]
normalized: [~ [EG [~ [[[[p2<=0 & 0<=p2] | ~ [E [true U [p41<=1 & 1<=p41]]]] | [[[p9<=0 & 0<=p9] | EX [[[p17<=1 & 1<=p17] & [p8<=0 & 0<=p8]]]] & EG [[[[p31<=1 & 1<=p31] & [p29<=1 & 1<=p29]] & [p3<=0 & 0<=p3]]]]]]]] & EG [E [true U ~ [E [true U ~ [[p33<=1 & 1<=p33]]]]]]]

abstracting: (1<=p33)
states: 5,266,960 (6)
abstracting: (p33<=1)
states: 27,317,841 (7)
.
EG iterations: 1
abstracting: (0<=p3)
states: 27,317,841 (7)
abstracting: (p3<=0)
states: 22,050,881 (7)
abstracting: (1<=p29)
states: 5,266,960 (6)
abstracting: (p29<=1)
states: 27,317,841 (7)
abstracting: (1<=p31)
states: 5,266,960 (6)
abstracting: (p31<=1)
states: 27,317,841 (7)
.
EG iterations: 1
abstracting: (0<=p8)
states: 27,317,841 (7)
abstracting: (p8<=0)
states: 22,050,881 (7)
abstracting: (1<=p17)
states: 5,266,960 (6)
abstracting: (p17<=1)
states: 27,317,841 (7)
.abstracting: (0<=p9)
states: 27,317,841 (7)
abstracting: (p9<=0)
states: 22,050,881 (7)
abstracting: (1<=p41)
states: 5,266,960 (6)
abstracting: (p41<=1)
states: 27,317,841 (7)
abstracting: (0<=p2)
states: 27,317,841 (7)
abstracting: (p2<=0)
states: 22,050,881 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: AG [[~ [E [[[[p33<=1 & 1<=p33] & [[p11<=0 & 0<=p11] | [p4<=1 & 1<=p4]]] | [p21<=0 & 0<=p21]] U AX [AX [[p41<=1 & 1<=p41]]]]] & [EF [EX [[p35<=0 & 0<=p35]]] | [[p19<=0 & 0<=p19] | [[[p26<=0 & 0<=p26] | [p45<=1 & 1<=p45]] & [EF [[p23<=1 & 1<=p23]] | [[p26<=0 & 0<=p26] | [p14<=1 & 1<=p14]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p14<=1 & 1<=p14] | [p26<=0 & 0<=p26]] | E [true U [p23<=1 & 1<=p23]]] & [[p45<=1 & 1<=p45] | [p26<=0 & 0<=p26]]] | [p19<=0 & 0<=p19]] | E [true U EX [[p35<=0 & 0<=p35]]]] & ~ [E [[[p21<=0 & 0<=p21] | [[[p4<=1 & 1<=p4] | [p11<=0 & 0<=p11]] & [p33<=1 & 1<=p33]]] U ~ [EX [EX [~ [[p41<=1 & 1<=p41]]]]]]]]]]]

abstracting: (1<=p41)
states: 5,266,960 (6)
abstracting: (p41<=1)
states: 27,317,841 (7)
..abstracting: (1<=p33)
states: 5,266,960 (6)
abstracting: (p33<=1)
states: 27,317,841 (7)
abstracting: (0<=p11)
states: 27,317,841 (7)
abstracting: (p11<=0)
states: 22,050,881 (7)
abstracting: (1<=p4)
states: 5,266,960 (6)
abstracting: (p4<=1)
states: 27,317,841 (7)
abstracting: (0<=p21)
states: 27,317,841 (7)
abstracting: (p21<=0)
states: 22,050,881 (7)
abstracting: (0<=p35)
states: 27,317,841 (7)
abstracting: (p35<=0)
states: 21,067,841 (7)
.abstracting: (0<=p19)
states: 27,317,841 (7)
abstracting: (p19<=0)
states: 22,050,881 (7)
abstracting: (0<=p26)
states: 27,317,841 (7)
abstracting: (p26<=0)
states: 22,050,881 (7)
abstracting: (1<=p45)
states: 5,463,568 (6)
abstracting: (p45<=1)
states: 27,317,841 (7)
abstracting: (1<=p23)
states: 5,266,960 (6)
abstracting: (p23<=1)
states: 27,317,841 (7)
abstracting: (0<=p26)
states: 27,317,841 (7)
abstracting: (p26<=0)
states: 22,050,881 (7)
abstracting: (1<=p14)
states: 5,266,960 (6)
abstracting: (p14<=1)
states: 27,317,841 (7)
-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

totally nodes used: 143218 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 330147 825338 1155485
used/not used/entry size/cache size: 939086 66169778 16 1024MB
basic ops cache: hits/miss/sum: 49286 100282 149568
used/not used/entry size/cache size: 193947 16583269 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: 2442 5358 7800
used/not used/entry size/cache size: 5358 8383250 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 66971755
1 131375
2 5373
3 347
4 14
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.552sec


BK_STOP 1679139876336

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


iterations count:15612 (190), effective:852 (10)

initing FirstDep: 0m 0.000sec


iterations count:195 (2), effective:5 (0)

iterations count:458 (5), effective:19 (0)

iterations count:545 (6), effective:35 (0)

iterations count:435 (5), effective:17 (0)

iterations count:451 (5), effective:20 (0)

iterations count:276 (3), effective:9 (0)

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

iterations count:359 (4), effective:22 (0)

iterations count:451 (5), effective:20 (0)

iterations count:531 (6), effective:20 (0)

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

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

iterations count:544 (6), effective:20 (0)

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

iterations count:396 (4), effective:21 (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="Raft-PT-03"
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 Raft-PT-03, 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 r330-tall-167889203100297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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