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

About the Execution of Marcie+red for GPUForwardProgress-PT-16a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10360.000 3600000.00 3627755.00 11550.30 ???T?F?TTFTFTF?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348100049.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 GPUForwardProgress-PT-16a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348100049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.0K Feb 25 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 14:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 14:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 14:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 26K Mar 5 18:22 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 GPUForwardProgress-PT-16a-CTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-16a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678526260992

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=GPUForwardProgress-PT-16a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 09:17:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 09:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:17:44] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-11 09:17:44] [INFO ] Transformed 72 places.
[2023-03-11 09:17:44] [INFO ] Transformed 89 transitions.
[2023-03-11 09:17:44] [INFO ] Found NUPN structural information;
[2023-03-11 09:17:44] [INFO ] Parsed PT model containing 72 places and 89 transitions and 341 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
FORMULA GPUForwardProgress-PT-16a-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16a-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 71/71 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 71
Applied a total of 1 rules in 19 ms. Remains 71 /72 variables (removed 1) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 71 cols
[2023-03-11 09:17:44] [INFO ] Computed 17 place invariants in 16 ms
[2023-03-11 09:17:44] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-11 09:17:44] [INFO ] Invariant cache hit.
[2023-03-11 09:17:44] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-11 09:17:44] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-11 09:17:44] [INFO ] Invariant cache hit.
[2023-03-11 09:17:44] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/72 places, 71/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 71/72 places, 71/71 transitions.
Support contains 52 out of 71 places after structural reductions.
[2023-03-11 09:17:45] [INFO ] Flatten gal took : 65 ms
[2023-03-11 09:17:45] [INFO ] Flatten gal took : 22 ms
[2023-03-11 09:17:45] [INFO ] Input system was already deterministic with 71 transitions.
Support contains 51 out of 71 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 42) seen :41
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:17:45] [INFO ] Invariant cache hit.
[2023-03-11 09:17:46] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 13 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 13 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 224 edges and 71 vertex of which 54 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 5 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 10 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 16 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 9 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/71 places, 71/71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Input system was already deterministic with 71 transitions.
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 8 ms
[2023-03-11 09:17:46] [INFO ] Flatten gal took : 7 ms
[2023-03-11 09:17:46] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 09:17:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 71 transitions and 303 arcs took 1 ms.
Total runtime 2994 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: 71 NrTr: 71 NrArc: 303)

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

net check time: 0m 0.000sec

init dd package: 0m 3.667sec


RS generation: 1m26.005sec


-> reachability set: #nodes 1605667 (1.6e+06) #states 25,683,710,333 (10)



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

checking: AX [[EX [0<=0] & [p36<=1 & 1<=p36]]]
normalized: ~ [EX [~ [[EX [0<=0] & [p36<=1 & 1<=p36]]]]]

abstracting: (1<=p36)
states: 6,413,753,130 (9)
abstracting: (p36<=1)
states: 25,683,710,333 (10)
abstracting: (0<=0)
states: 25,683,710,333 (10)
..-> the formula is TRUE

FORMULA GPUForwardProgress-PT-16a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m58.159sec

checking: EX [[[p22<=0 & 0<=p22] | [p53<=1 & 1<=p53]]]
normalized: EX [[[p53<=1 & 1<=p53] | [p22<=0 & 0<=p22]]]

abstracting: (0<=p22)
states: 25,683,710,333 (10)
abstracting: (p22<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p53)
states: 6,442,450,941 (9)
abstracting: (p53<=1)
states: 25,683,710,333 (10)
.-> the formula is TRUE

FORMULA GPUForwardProgress-PT-16a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.713sec

checking: [EF [AG [AF [[[p7<=0 & 0<=p7] | [p11<=1 & 1<=p11]]]]] & AX [[[p9<=0 & 0<=p9] | [p26<=1 & 1<=p26]]]]
normalized: [~ [EX [~ [[[p26<=1 & 1<=p26] | [p9<=0 & 0<=p9]]]]] & E [true U ~ [E [true U EG [~ [[[p11<=1 & 1<=p11] | [p7<=0 & 0<=p7]]]]]]]]

abstracting: (0<=p7)
states: 25,683,710,333 (10)
abstracting: (p7<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p11)
states: 6,413,753,130 (9)
abstracting: (p11<=1)
states: 25,683,710,333 (10)

before gc: list nodes free: 109623

after gc: idd nodes used:5301432, unused:58698568; list nodes free:273595966
...
before gc: list nodes free: 4172140

after gc: idd nodes used:9028271, unused:54971729; list nodes free:256575490
....MC time: 5m36.300sec

checking: AG [~ [E [AX [AG [[[p34<=0 & 0<=p34] | [p61<=1 & 1<=p61]]]] U ~ [[[p53<=0 & 0<=p53] | [p64<=1 & 1<=p64]]]]]]
normalized: ~ [E [true U E [~ [EX [E [true U ~ [[[p61<=1 & 1<=p61] | [p34<=0 & 0<=p34]]]]]] U ~ [[[p64<=1 & 1<=p64] | [p53<=0 & 0<=p53]]]]]]

abstracting: (0<=p53)
states: 25,683,710,333 (10)
abstracting: (p53<=0)
states: 19,241,259,392 (10)
abstracting: (1<=p64)
states: 6,413,753,130 (9)
abstracting: (p64<=1)
states: 25,683,710,333 (10)
abstracting: (0<=p34)
states: 25,683,710,333 (10)
abstracting: (p34<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p61)
states: 6,442,450,941 (9)
abstracting: (p61<=1)
states: 25,683,710,333 (10)
.-> the formula is FALSE

FORMULA GPUForwardProgress-PT-16a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m21.235sec

checking: AX [EG [AG [[[[p15<=0 & 0<=p15] & [p25<=1 & 1<=p25]] & [[p42<=0 & 0<=p42] & [p37<=1 & 1<=p37]]]]]]
normalized: ~ [EX [~ [EG [~ [E [true U ~ [[[[p37<=1 & 1<=p37] & [p42<=0 & 0<=p42]] & [[p25<=1 & 1<=p25] & [p15<=0 & 0<=p15]]]]]]]]]]

abstracting: (0<=p15)
states: 25,683,710,333 (10)
abstracting: (p15<=0)

before gc: list nodes free: 6054773

after gc: idd nodes used:7209040, unused:56790960; list nodes free:264490946
states: 19,269,957,203 (10)
abstracting: (1<=p25)
states: 6,442,450,941 (9)
abstracting: (p25<=1)
states: 25,683,710,333 (10)
abstracting: (0<=p42)
states: 25,683,710,333 (10)
abstracting: (p42<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p37)
states: 6,442,450,941 (9)
abstracting: (p37<=1)
states: 25,683,710,333 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA GPUForwardProgress-PT-16a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m22.886sec

checking: AF [AX [[EX [[1<=p20 & p20<=1]] | [[p38<=1 & 1<=p38] & [[p58<=0 & 0<=p58] | [[p27<=0 & 0<=p27] & [p28<=1 & 1<=p28]]]]]]]
normalized: ~ [EG [EX [~ [[[[[[p28<=1 & 1<=p28] & [p27<=0 & 0<=p27]] | [p58<=0 & 0<=p58]] & [p38<=1 & 1<=p38]] | EX [[1<=p20 & p20<=1]]]]]]]

abstracting: (p20<=1)
states: 25,683,710,333 (10)
abstracting: (1<=p20)
states: 6,413,753,130 (9)
.abstracting: (1<=p38)
states: 6,413,753,130 (9)
abstracting: (p38<=1)
states: 25,683,710,333 (10)
abstracting: (0<=p58)
states: 25,683,710,333 (10)
abstracting: (p58<=0)
states: 19,269,957,203 (10)
abstracting: (0<=p27)
states: 25,683,710,333 (10)
abstracting: (p27<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p28)
states: 6,413,753,130 (9)
abstracting: (p28<=1)
states: 25,683,710,333 (10)

before gc: list nodes free: 1373625

after gc: idd nodes used:15927415, unused:48072585; list nodes free:224388855
.
before gc: list nodes free: 4284339

after gc: idd nodes used:17887680, unused:46112320; list nodes free:215934962
MC time: 5m27.591sec

checking: [EG [[EF [AG [[[p2<=0 & 0<=p2] | [p68<=1 & 1<=p68]]]] | [p33<=1 & 1<=p33]]] & AX [[[p29<=0 & 0<=p29] | [p54<=1 & 1<=p54]]]]
normalized: [~ [EX [~ [[[p54<=1 & 1<=p54] | [p29<=0 & 0<=p29]]]]] & EG [[[p33<=1 & 1<=p33] | E [true U ~ [E [true U ~ [[[p68<=1 & 1<=p68] | [p2<=0 & 0<=p2]]]]]]]]]

abstracting: (0<=p2)
states: 25,683,710,333 (10)
abstracting: (p2<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p68)
states: 4,251,920,575 (9)
abstracting: (p68<=1)
states: 25,683,710,333 (10)
abstracting: (1<=p33)
states: 6,442,450,941 (9)
abstracting: (p33<=1)
states: 25,683,710,333 (10)

EG iterations: 0
abstracting: (0<=p29)
states: 25,683,710,333 (10)
abstracting: (p29<=0)
states: 19,241,259,392 (10)
abstracting: (1<=p54)
states: 6,413,753,130 (9)
abstracting: (p54<=1)
states: 25,683,710,333 (10)
.-> the formula is TRUE

FORMULA GPUForwardProgress-PT-16a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m14.887sec

checking: [EG [AX [[EF [[[p56<=0 & 0<=p56] & [[p51<=0 & 0<=p51] | [p67<=1 & 1<=p67]]]] | [[p55<=0 & 0<=p55] | [p36<=1 & 1<=p36]]]]] | AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] | EG [~ [EX [~ [[[[p36<=1 & 1<=p36] | [p55<=0 & 0<=p55]] | E [true U [[[p67<=1 & 1<=p67] | [p51<=0 & 0<=p51]] & [p56<=0 & 0<=p56]]]]]]]]]

abstracting: (0<=p56)
states: 25,683,710,333 (10)
abstracting: (p56<=0)
states: 19,269,957,203 (10)
abstracting: (0<=p51)
states: 25,683,710,333 (10)
abstracting: (p51<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p67)
states: 12,841,855,166 (10)
abstracting: (p67<=1)
states: 25,683,710,333 (10)
abstracting: (0<=p55)
states: 25,683,710,333 (10)
abstracting: (p55<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p36)
states: 6,413,753,130 (9)
abstracting: (p36<=1)
states: 25,683,710,333 (10)
.
EG iterations: 0
abstracting: (1<=0)
states: 0

before gc: list nodes free: 37706

after gc: idd nodes used:18281652, unused:45718348; list nodes free:213206630
.-> the formula is TRUE

FORMULA GPUForwardProgress-PT-16a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m27.534sec

checking: A [[EF [[AF [[[p25<=0 & 0<=p25] | [p58<=1 & 1<=p58]]] & [~ [[[p68<=0 & 0<=p68] | [p51<=1 & 1<=p51]]] & EX [[p52<=0 & 0<=p52]]]]] | AF [AX [EF [[[p19<=0 & 0<=p19] | [p41<=1 & 1<=p41]]]]]] U EG [~ [[AX [[[p18<=0 & 0<=p18] | [p60<=1 & 1<=p60]]] | EF [[[p66<=0 & 0<=p66] | [p54<=1 & 1<=p54]]]]]]]
normalized: [~ [EG [~ [EG [~ [[E [true U [[p54<=1 & 1<=p54] | [p66<=0 & 0<=p66]]] | ~ [EX [~ [[[p60<=1 & 1<=p60] | [p18<=0 & 0<=p18]]]]]]]]]]] & ~ [E [~ [EG [~ [[E [true U [[p54<=1 & 1<=p54] | [p66<=0 & 0<=p66]]] | ~ [EX [~ [[[p60<=1 & 1<=p60] | [p18<=0 & 0<=p18]]]]]]]]] U [~ [[~ [EG [EX [~ [E [true U [[p41<=1 & 1<=p41] | [p19<=0 & 0<=p19]]]]]]] | E [true U [[EX [[p52<=0 & 0<=p52]] & ~ [[[p51<=1 & 1<=p51] | [p68<=0 & 0<=p68]]]] & ~ [EG [~ [[[p58<=1 & 1<=p58] | [p25<=0 & 0<=p25]]]]]]]]] & ~ [EG [~ [[E [true U [[p54<=1 & 1<=p54] | [p66<=0 & 0<=p66]]] | ~ [EX [~ [[[p60<=1 & 1<=p60] | [p18<=0 & 0<=p18]]]]]]]]]]]]]

abstracting: (0<=p18)
states: 25,683,710,333 (10)
abstracting: (p18<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p60)
states: 6,413,753,130 (9)
abstracting: (p60<=1)
states: 25,683,710,333 (10)
.abstracting: (0<=p66)
states: 25,683,710,333 (10)
abstracting: (p66<=0)
states: 17,093,775,743 (10)
abstracting: (1<=p54)
states: 6,413,753,130 (9)
abstracting: (p54<=1)
states: 25,683,710,333 (10)
.
EG iterations: 1
abstracting: (0<=p25)
states: 25,683,710,333 (10)
abstracting: (p25<=0)
states: 19,241,259,392 (10)
abstracting: (1<=p58)
states: 6,413,753,130 (9)
abstracting: (p58<=1)
states: 25,683,710,333 (10)
.
before gc: list nodes free: 323494

after gc: idd nodes used:20106711, unused:43893289; list nodes free:204805135
..MC time: 5m 4.061sec

checking: [EF [AG [[~ [[p46<=0 & 0<=p46]] & ~ [[p47<=1 & 1<=p47]]]]] & [E [[AG [AX [[p58<=0 & 0<=p58]]] | [[p15<=0 & 0<=p15] | [p33<=1 & 1<=p33]]] U E [[[p28<=0 & 0<=p28] | [p32<=1 & 1<=p32]] U ~ [[p45<=1 & 1<=p45]]]] & AF [[[p9<=0 & 0<=p9] | [[p45<=0 & 0<=p45] & [[p42<=1 & 1<=p42] & [p63<=1 & 1<=p63]]]]]]]
normalized: [E [true U ~ [E [true U ~ [[~ [[p47<=1 & 1<=p47]] & ~ [[p46<=0 & 0<=p46]]]]]]] & [~ [EG [~ [[[[[p63<=1 & 1<=p63] & [p42<=1 & 1<=p42]] & [p45<=0 & 0<=p45]] | [p9<=0 & 0<=p9]]]]] & E [[[[p33<=1 & 1<=p33] | [p15<=0 & 0<=p15]] | ~ [E [true U EX [~ [[p58<=0 & 0<=p58]]]]]] U E [[[p32<=1 & 1<=p32] | [p28<=0 & 0<=p28]] U ~ [[p45<=1 & 1<=p45]]]]]]

abstracting: (1<=p45)
states: 6,442,450,941 (9)
abstracting: (p45<=1)
states: 25,683,710,333 (10)
abstracting: (0<=p28)
states: 25,683,710,333 (10)
abstracting: (p28<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p32)
states: 6,413,753,130 (9)
abstracting: (p32<=1)
states: 25,683,710,333 (10)
abstracting: (0<=p58)
states: 25,683,710,333 (10)
abstracting: (p58<=0)
states: 19,269,957,203 (10)
.abstracting: (0<=p15)
states: 25,683,710,333 (10)
abstracting: (p15<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p33)
states: 6,442,450,941 (9)
abstracting: (p33<=1)
states: 25,683,710,333 (10)
MC time: 4m13.050sec

checking: AX [[[EX [[[p23<=0 & 0<=p23] & [p68<=1 & 1<=p68]]] & [[p24<=0 & 0<=p24] | [AX [1<=0] | [EF [[p48<=0 & 0<=p48]] & [[p68<=0 & 0<=p68] | [p65<=1 & 1<=p65]]]]]] | [[EX [[[p4<=0 & 0<=p4] | [p63<=1 & 1<=p63]]] & AX [[[p47<=0 & 0<=p47] & [p67<=1 & 1<=p67]]]] & [[p43<=0 & 0<=p43] & [p33<=1 & 1<=p33]]]]]
normalized: ~ [EX [~ [[[EX [[[p68<=1 & 1<=p68] & [p23<=0 & 0<=p23]]] & [[[[[p65<=1 & 1<=p65] | [p68<=0 & 0<=p68]] & E [true U [p48<=0 & 0<=p48]]] | ~ [EX [~ [1<=0]]]] | [p24<=0 & 0<=p24]]] | [[[p33<=1 & 1<=p33] & [p43<=0 & 0<=p43]] & [~ [EX [~ [[[p67<=1 & 1<=p67] & [p47<=0 & 0<=p47]]]]] & EX [[[p63<=1 & 1<=p63] | [p4<=0 & 0<=p4]]]]]]]]]

abstracting: (0<=p4)
states: 25,683,710,333 (10)
abstracting: (p4<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p63)
states: 6,413,753,130 (9)
abstracting: (p63<=1)
states: 25,683,710,333 (10)

before gc: list nodes free: 1687008

after gc: idd nodes used:23730000, unused:40270000; list nodes free:187997876
.abstracting: (0<=p47)
states: 25,683,710,333 (10)
abstracting: (p47<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p67)
states: 12,841,855,166 (10)
abstracting: (p67<=1)
states: 25,683,710,333 (10)

before gc: list nodes free: 1681446

after gc: idd nodes used:26561161, unused:37438839; list nodes free:175162151
MC time: 3m32.149sec

checking: EF [[[EX [EX [A [[p46<=1 & 1<=p46] U [p5<=1 & 1<=p5]]]] & AF [[EF [[p23<=1 & 1<=p23]] & [AG [[[p54<=0 & 0<=p54] | [p16<=1 & 1<=p16]]] & [[~ [[p57<=0 & 0<=p57]] & ~ [[p8<=1 & 1<=p8]]] | [[[p25<=0 & 0<=p25] | [p65<=1 & 1<=p65]] & [[p5<=0 & 0<=p5] | [p41<=1 & 1<=p41]]]]]]]] & [EX [[[p23<=0 & 0<=p23] | [[p52<=0 & 0<=p52] & [p27<=1 & 1<=p27]]]] & [[p62<=0 & 0<=p62] & [p50<=1 & 1<=p50]]]]]
normalized: E [true U [[[[p50<=1 & 1<=p50] & [p62<=0 & 0<=p62]] & EX [[[[p27<=1 & 1<=p27] & [p52<=0 & 0<=p52]] | [p23<=0 & 0<=p23]]]] & [~ [EG [~ [[[[[[[p41<=1 & 1<=p41] | [p5<=0 & 0<=p5]] & [[p65<=1 & 1<=p65] | [p25<=0 & 0<=p25]]] | [~ [[p8<=1 & 1<=p8]] & ~ [[p57<=0 & 0<=p57]]]] & ~ [E [true U ~ [[[p16<=1 & 1<=p16] | [p54<=0 & 0<=p54]]]]]] & E [true U [p23<=1 & 1<=p23]]]]]] & EX [EX [[~ [EG [~ [[p5<=1 & 1<=p5]]]] & ~ [E [~ [[p5<=1 & 1<=p5]] U [~ [[p46<=1 & 1<=p46]] & ~ [[p5<=1 & 1<=p5]]]]]]]]]]]

abstracting: (1<=p5)
states: 6,442,450,941 (9)
abstracting: (p5<=1)
states: 25,683,710,333 (10)
abstracting: (1<=p46)
states: 6,413,753,130 (9)
abstracting: (p46<=1)
states: 25,683,710,333 (10)
abstracting: (1<=p5)
states: 6,442,450,941 (9)
abstracting: (p5<=1)
states: 25,683,710,333 (10)
abstracting: (1<=p5)
states: 6,442,450,941 (9)
abstracting: (p5<=1)
states: 25,683,710,333 (10)
.
EG iterations: 1
.MC time: 2m56.320sec

checking: [EF [AG [AF [[[p7<=0 & 0<=p7] | [p11<=1 & 1<=p11]]]]] & AX [[[p9<=0 & 0<=p9] | [p26<=1 & 1<=p26]]]]
normalized: [~ [EX [~ [[[p26<=1 & 1<=p26] | [p9<=0 & 0<=p9]]]]] & E [true U ~ [E [true U EG [~ [[[p11<=1 & 1<=p11] | [p7<=0 & 0<=p7]]]]]]]]

abstracting: (0<=p7)
states: 25,683,710,333 (10)
abstracting: (p7<=0)
states: 19,269,957,203 (10)
abstracting: (1<=p11)
states: 6,413,753,130 (9)
abstracting: (p11<=1)
states: 25,683,710,333 (10)

before gc: list nodes free: 1622509

after gc: idd nodes used:23973780, unused:40026220; list nodes free:186855019
.....
before gc: list nodes free: 6489822

after gc: idd nodes used:26718526, unused:37281474; list nodes free:174534510
......
before gc: list nodes free: 5976668

after gc: idd nodes used:26160149, unused:37839851; list nodes free:177006057
...................
EG iterations: 30
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5789620 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102932 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:11209 (157), effective:1016 (14)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 335 sec


iterations count:177 (2), effective:6 (0)

iterations count:261 (3), effective:12 (0)

iterations count:306 (4), effective:13 (0)

iterations count:1893 (26), effective:106 (1)

net_ddint.h:600: Timeout: after 326 sec


iterations count:185 (2), effective:6 (0)

iterations count:263 (3), effective:11 (0)

iterations count:137 (1), effective:5 (0)

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

net_ddint.h:600: Timeout: after 303 sec


iterations count:2217 (31), effective:122 (1)

iterations count:170 (2), effective:6 (0)

sat_reach.icc:155: Timeout: after 252 sec


net_ddint.h:600: Timeout: after 210 sec


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

net_ddint.h:600: Timeout: after 175 sec


iterations count:187 (2), effective:8 (0)

iterations count:258 (3), effective:9 (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="GPUForwardProgress-PT-16a"
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 GPUForwardProgress-PT-16a, 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 r202-smll-167840348100049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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