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.r298-tall-167873951400201.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 Philosophers-PT-000020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951400201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 21K Feb 25 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 25 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 171K Feb 25 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K 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 Philosophers-PT-000020-CTLCardinality-00
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-01
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-02
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-03
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-04
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-05
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-06
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-07
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-08
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-09
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-10
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-11
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-12
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-13
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-14
FORMULA_NAME Philosophers-PT-000020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679478399062

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=Philosophers-PT-000020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 09:46:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 09:46:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:46:40] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-22 09:46:40] [INFO ] Transformed 100 places.
[2023-03-22 09:46:40] [INFO ] Transformed 100 transitions.
[2023-03-22 09:46:40] [INFO ] Found NUPN structural information;
[2023-03-22 09:46:40] [INFO ] Parsed PT model containing 100 places and 100 transitions and 320 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
FORMULA Philosophers-PT-000020-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2023-03-22 09:46:40] [INFO ] Computed 40 place invariants in 16 ms
[2023-03-22 09:46:41] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-22 09:46:41] [INFO ] Invariant cache hit.
[2023-03-22 09:46:41] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-22 09:46:41] [INFO ] Invariant cache hit.
[2023-03-22 09:46:41] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2023-03-22 09:46:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-22 09:46:41] [INFO ] Flatten gal took : 28 ms
FORMULA Philosophers-PT-000020-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 09:46:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Philosophers-PT-000020-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 09:46:41] [INFO ] Flatten gal took : 12 ms
[2023-03-22 09:46:41] [INFO ] Input system was already deterministic with 100 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 49) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-22 09:46:42] [INFO ] Invariant cache hit.
[2023-03-22 09:46:43] [INFO ] [Real]Absence check using 40 positive place invariants in 8 ms returned sat
[2023-03-22 09:46:43] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :0
Fused 14 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 14 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-000020-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 09:46:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 8 ms
FORMULA Philosophers-PT-000020-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 85 transition count 85
Applied a total of 30 rules in 13 ms. Remains 85 /100 variables (removed 15) and now considering 85/100 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 85/100 places, 85/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 100/100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Input system was already deterministic with 100 transitions.
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 8 ms
[2023-03-22 09:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 09:46:43] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-22 09:46:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 100 transitions and 320 arcs took 1 ms.
Total runtime 2811 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: 100 NrTr: 100 NrArc: 320)

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

net check time: 0m 0.000sec

init dd package: 0m 2.728sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 500 (5.0e+02) #states 3,486,784,401 (9)



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

checking: EF [AX [1<=0]]
normalized: E [true U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA Philosophers-PT-000020-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.087sec

checking: AX [EF [EG [~ [[p52<=1 & 1<=p52]]]]]
normalized: ~ [EX [~ [E [true U EG [~ [[p52<=1 & 1<=p52]]]]]]]

abstracting: (1<=p52)
states: 774,840,978 (8)
abstracting: (p52<=1)
states: 3,486,784,401 (9)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Philosophers-PT-000020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AX [EG [EF [[[p54<=0 & 0<=p54] | [p85<=1 & 1<=p85]]]]]
normalized: ~ [EX [~ [EG [E [true U [[p85<=1 & 1<=p85] | [p54<=0 & 0<=p54]]]]]]]

abstracting: (0<=p54)
states: 3,486,784,401 (9)
abstracting: (p54<=0)
states: 2,711,943,423 (9)
abstracting: (1<=p85)
states: 387,420,489 (8)
abstracting: (p85<=1)
states: 3,486,784,401 (9)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Philosophers-PT-000020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [EG [[[p77<=0 & 0<=p77] & [[AX [[p30<=0 & 0<=p30]] | [[p90<=0 & 0<=p90] & [p21<=0 & 0<=p21]]] & [EX [[p17<=1 & 1<=p17]] | [[p47<=0 & 0<=p47] | [p2<=1 & 1<=p2]]]]]]]
normalized: E [true U EG [[[[[[p2<=1 & 1<=p2] | [p47<=0 & 0<=p47]] | EX [[p17<=1 & 1<=p17]]] & [[[p21<=0 & 0<=p21] & [p90<=0 & 0<=p90]] | ~ [EX [~ [[p30<=0 & 0<=p30]]]]]] & [p77<=0 & 0<=p77]]]]

abstracting: (0<=p77)
states: 3,486,784,401 (9)
abstracting: (p77<=0)
states: 3,099,363,912 (9)
abstracting: (0<=p30)
states: 3,486,784,401 (9)
abstracting: (p30<=0)
states: 2,324,522,934 (9)
.abstracting: (0<=p90)
states: 3,486,784,401 (9)
abstracting: (p90<=0)
states: 3,099,363,912 (9)
abstracting: (0<=p21)
states: 3,486,784,401 (9)
abstracting: (p21<=0)
states: 2,324,522,934 (9)
abstracting: (1<=p17)
states: 1,549,681,956 (9)
abstracting: (p17<=1)
states: 3,486,784,401 (9)
.abstracting: (0<=p47)
states: 3,486,784,401 (9)
abstracting: (p47<=0)
states: 2,711,943,423 (9)
abstracting: (1<=p2)
states: 1,549,681,956 (9)
abstracting: (p2<=1)
states: 3,486,784,401 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Philosophers-PT-000020-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

checking: E [EF [[EG [A [[p95<=1 & 1<=p95] U [p69<=1 & 1<=p69]]] & AF [~ [[[p11<=0 & 0<=p11] | [[p78<=1 & 1<=p78] | [p28<=1 & 1<=p28]]]]]]] U ~ [[[p81<=0 & 0<=p81] | [p74<=1 & 1<=p74]]]]
normalized: E [E [true U [~ [EG [[[[p28<=1 & 1<=p28] | [p78<=1 & 1<=p78]] | [p11<=0 & 0<=p11]]]] & EG [[~ [EG [~ [[p69<=1 & 1<=p69]]]] & ~ [E [~ [[p69<=1 & 1<=p69]] U [~ [[p95<=1 & 1<=p95]] & ~ [[p69<=1 & 1<=p69]]]]]]]]] U ~ [[[p74<=1 & 1<=p74] | [p81<=0 & 0<=p81]]]]

abstracting: (0<=p81)
states: 3,486,784,401 (9)
abstracting: (p81<=0)
states: 2,711,943,423 (9)
abstracting: (1<=p74)
states: 774,840,978 (8)
abstracting: (p74<=1)
states: 3,486,784,401 (9)
abstracting: (1<=p69)
states: 774,840,978 (8)
abstracting: (p69<=1)
states: 3,486,784,401 (9)
abstracting: (1<=p95)
states: 387,420,489 (8)
abstracting: (p95<=1)
states: 3,486,784,401 (9)
abstracting: (1<=p69)
states: 774,840,978 (8)
abstracting: (p69<=1)
states: 3,486,784,401 (9)
abstracting: (1<=p69)
states: 774,840,978 (8)
abstracting: (p69<=1)
states: 3,486,784,401 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p11)
states: 3,486,784,401 (9)
abstracting: (p11<=0)
states: 1,937,102,445 (9)
abstracting: (1<=p78)
states: 387,420,489 (8)
abstracting: (p78<=1)
states: 3,486,784,401 (9)
abstracting: (1<=p28)
states: 1,162,261,467 (9)
abstracting: (p28<=1)
states: 3,486,784,401 (9)
...
EG iterations: 3
-> the formula is TRUE

FORMULA Philosophers-PT-000020-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

checking: EG [[EX [E [[A [[p23<=0 & 0<=p23] U [[p95<=0 & 0<=p95] | [p75<=1 & 1<=p75]]] & [[p40<=0 & 0<=p40] | [p65<=1 & 1<=p65]]] U AX [[p26<=0 & 0<=p26]]]] & [[p42<=1 & 1<=p42] | EX [[p13<=0 & 0<=p13]]]]]
normalized: EG [[[EX [[p13<=0 & 0<=p13]] | [p42<=1 & 1<=p42]] & EX [E [[[[p65<=1 & 1<=p65] | [p40<=0 & 0<=p40]] & [~ [EG [~ [[[p75<=1 & 1<=p75] | [p95<=0 & 0<=p95]]]]] & ~ [E [~ [[[p75<=1 & 1<=p75] | [p95<=0 & 0<=p95]]] U [~ [[p23<=0 & 0<=p23]] & ~ [[[p75<=1 & 1<=p75] | [p95<=0 & 0<=p95]]]]]]]] U ~ [EX [~ [[p26<=0 & 0<=p26]]]]]]]]

abstracting: (0<=p26)
states: 3,486,784,401 (9)
abstracting: (p26<=0)
states: 2,324,522,934 (9)
.abstracting: (0<=p95)
states: 3,486,784,401 (9)
abstracting: (p95<=0)
states: 3,099,363,912 (9)
abstracting: (1<=p75)
states: 774,840,978 (8)
abstracting: (p75<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p23)
states: 3,486,784,401 (9)
abstracting: (p23<=0)
states: 2,324,522,934 (9)
abstracting: (0<=p95)
states: 3,486,784,401 (9)
abstracting: (p95<=0)
states: 3,099,363,912 (9)
abstracting: (1<=p75)
states: 774,840,978 (8)
abstracting: (p75<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p95)
states: 3,486,784,401 (9)
abstracting: (p95<=0)
states: 3,099,363,912 (9)
abstracting: (1<=p75)
states: 774,840,978 (8)
abstracting: (p75<=1)
states: 3,486,784,401 (9)
...
EG iterations: 3
abstracting: (0<=p40)
states: 3,486,784,401 (9)
abstracting: (p40<=0)
states: 2,324,522,934 (9)
abstracting: (1<=p65)
states: 774,840,978 (8)
abstracting: (p65<=1)
states: 3,486,784,401 (9)
.abstracting: (1<=p42)
states: 774,840,978 (8)
abstracting: (p42<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p13)
states: 3,486,784,401 (9)
abstracting: (p13<=0)
states: 1,937,102,445 (9)
...
EG iterations: 2
-> the formula is TRUE

FORMULA Philosophers-PT-000020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: ~ [E [~ [[p79<=0 & 0<=p79]] U [AG [[[[p4<=1 & 1<=p4] & [[p96<=0 & 0<=p96] | [[p60<=0 & 0<=p60] | [p54<=1 & 1<=p54]]]] | [EX [[p59<=0 & 0<=p59]] | AG [[[p1<=0 & 0<=p1] | [p69<=1 & 1<=p69]]]]]] & [[[[p80<=0 & 0<=p80] & [AF [[[p60<=0 & 0<=p60] | [p56<=1 & 1<=p56]]] | ~ [[p78<=0 & 0<=p78]]]] | [~ [[[p61<=1 & 1<=p61] & AX [[p8<=1 & 1<=p8]]]] & [p17<=1 & 1<=p17]]] | [[p39<=0 & 0<=p39] | [[p95<=1 & 1<=p95] | [p85<=0 & 0<=p85]]]]]]]
normalized: ~ [E [~ [[p79<=0 & 0<=p79]] U [[[[[p85<=0 & 0<=p85] | [p95<=1 & 1<=p95]] | [p39<=0 & 0<=p39]] | [[[p17<=1 & 1<=p17] & ~ [[~ [EX [~ [[p8<=1 & 1<=p8]]]] & [p61<=1 & 1<=p61]]]] | [[~ [[p78<=0 & 0<=p78]] | ~ [EG [~ [[[p56<=1 & 1<=p56] | [p60<=0 & 0<=p60]]]]]] & [p80<=0 & 0<=p80]]]] & ~ [E [true U ~ [[[~ [E [true U ~ [[[p69<=1 & 1<=p69] | [p1<=0 & 0<=p1]]]]] | EX [[p59<=0 & 0<=p59]]] | [[[[p54<=1 & 1<=p54] | [p60<=0 & 0<=p60]] | [p96<=0 & 0<=p96]] & [p4<=1 & 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 1,549,681,956 (9)
abstracting: (p4<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p96)
states: 3,486,784,401 (9)
abstracting: (p96<=0)
states: 3,099,363,912 (9)
abstracting: (0<=p60)
states: 3,486,784,401 (9)
abstracting: (p60<=0)
states: 2,711,943,423 (9)
abstracting: (1<=p54)
states: 774,840,978 (8)
abstracting: (p54<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p59)
states: 3,486,784,401 (9)
abstracting: (p59<=0)
states: 2,711,943,423 (9)
.abstracting: (0<=p1)
states: 3,486,784,401 (9)
abstracting: (p1<=0)
states: 1,937,102,445 (9)
abstracting: (1<=p69)
states: 774,840,978 (8)
abstracting: (p69<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p80)
states: 3,486,784,401 (9)
abstracting: (p80<=0)
states: 3,099,363,912 (9)
abstracting: (0<=p60)
states: 3,486,784,401 (9)
abstracting: (p60<=0)
states: 2,711,943,423 (9)
abstracting: (1<=p56)
states: 774,840,978 (8)
abstracting: (p56<=1)
states: 3,486,784,401 (9)
.
EG iterations: 1
abstracting: (0<=p78)
states: 3,486,784,401 (9)
abstracting: (p78<=0)
states: 3,099,363,912 (9)
abstracting: (1<=p61)
states: 774,840,978 (8)
abstracting: (p61<=1)
states: 3,486,784,401 (9)
abstracting: (1<=p8)
states: 1,549,681,956 (9)
abstracting: (p8<=1)
states: 3,486,784,401 (9)
.abstracting: (1<=p17)
states: 1,549,681,956 (9)
abstracting: (p17<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p39)
states: 3,486,784,401 (9)
abstracting: (p39<=0)
states: 2,324,522,934 (9)
abstracting: (1<=p95)
states: 387,420,489 (8)
abstracting: (p95<=1)
states: 3,486,784,401 (9)
abstracting: (0<=p85)
states: 3,486,784,401 (9)
abstracting: (p85<=0)
states: 3,099,363,912 (9)
abstracting: (0<=p79)
states: 3,486,784,401 (9)
abstracting: (p79<=0)
states: 3,099,363,912 (9)
-> the formula is TRUE

FORMULA Philosophers-PT-000020-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: AX [[EF [sum(p20, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)] | ~ [sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)<=sum(p84, p82, p81, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p57)]]]
normalized: ~ [EX [~ [[E [true U sum(p20, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)<=sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)] | ~ [sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)<=sum(p84, p82, p81, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p57)]]]]]

abstracting: (sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)<=sum(p84, p82, p81, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p57))
MC time: 29m59.022sec

checking: EF [AG [[EG [~ [E [sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)<=sum(p84, p82, p81, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p57) U sum(p40, p39, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p19)<=sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)]]] & [sum(p84, p82, p81, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p57)<=sum(p40, p39, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p19) | 69<=sum(p60, p59, p58, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p38)]]]]
normalized: E [true U ~ [E [true U ~ [[[sum(p84, p82, p81, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p57)<=sum(p40, p39, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p19) | 69<=sum(p60, p59, p58, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p38)] & EG [~ [E [sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)<=sum(p84, p82, p81, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p57) U sum(p40, p39, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p19)<=sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77)]]]]]]]]

abstracting: (sum(p40, p39, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p19)<=sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p83, p80, p79, p78, p77))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10696728 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100680 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:458 (4), effective:60 (0)

initing FirstDep: 0m 0.000sec


iterations count:3453 (34), effective:456 (4)

iterations count:440 (4), effective:37 (0)

iterations count:774 (7), effective:86 (0)

iterations count:607 (6), effective:62 (0)

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

iterations count:2042 (20), effective:283 (2)

iterations count:971 (9), effective:103 (1)

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

iterations count:412 (4), effective:54 (0)

iterations count:1006 (10), effective:112 (1)

iterations count:879 (8), effective:103 (1)

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

idd.h:1025: Timeout: after 1798 sec


idd.h:1025: Timeout: after 899 sec

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="Philosophers-PT-000020"
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 Philosophers-PT-000020, 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 r298-tall-167873951400201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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