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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5448.840 13531.00 17568.00 826.40 TTFTTFTFFTFFFTTT 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-167840348000001.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-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348000001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 6.4K Feb 25 14:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 14:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 6.6K Feb 25 14:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 14:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 14:14 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 8.1K 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-04a-CTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-04a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678516951521

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-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 06:42:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 06:42:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:42:35] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-11 06:42:35] [INFO ] Transformed 24 places.
[2023-03-11 06:42:35] [INFO ] Transformed 29 transitions.
[2023-03-11 06:42:35] [INFO ] Found NUPN structural information;
[2023-03-11 06:42:35] [INFO ] Parsed PT model containing 24 places and 29 transitions and 101 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA GPUForwardProgress-PT-04a-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04a-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04a-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04a-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Applied a total of 0 rules in 21 ms. Remains 24 /24 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 24 cols
[2023-03-11 06:42:35] [INFO ] Computed 6 place invariants in 11 ms
[2023-03-11 06:42:35] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 06:42:35] [INFO ] Invariant cache hit.
[2023-03-11 06:42:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 06:42:35] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-11 06:42:35] [INFO ] Invariant cache hit.
[2023-03-11 06:42:35] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 24/24 places, 23/23 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-03-11 06:42:36] [INFO ] Flatten gal took : 34 ms
[2023-03-11 06:42:36] [INFO ] Flatten gal took : 13 ms
[2023-03-11 06:42:36] [INFO ] Input system was already deterministic with 23 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 34) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:42:36] [INFO ] Invariant cache hit.
[2023-03-11 06:42:36] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 06:42:36] [INFO ] After 109ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA GPUForwardProgress-PT-04a-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 06:42:36] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:42:36] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 70 edges and 24 vertex of which 18 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 23/23 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 23
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 23/23 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/24 places, 23/23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Input system was already deterministic with 23 transitions.
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:42:37] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 06:42:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 23 transitions and 89 arcs took 1 ms.
Total runtime 2394 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: 24 NrTr: 23 NrArc: 89)

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

net check time: 0m 0.000sec

init dd package: 0m 3.762sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 353 (3.5e+02) #states 1,373 (3)



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

checking: EX [0<=0]
normalized: EX [0<=0]

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

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

MC time: 0m 0.003sec

checking: EX [0<=0]
normalized: EX [0<=0]

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

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [EG [[[p12<=0 & 0<=p12] | [p22<=1 & 1<=p22]]]]
normalized: ~ [EX [~ [EG [[[p12<=0 & 0<=p12] | [p22<=1 & 1<=p22]]]]]]

abstracting: (1<=p22)
states: 510
abstracting: (p22<=1)
states: 1,373 (3)
abstracting: (0<=p12)
states: 1,373 (3)
abstracting: (p12<=0)
states: 1,043 (3)
........
EG iterations: 8
.-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AX [A [[p20<=0 & 0<=p20] U [p13<=0 & 0<=p13]]]
normalized: ~ [EX [~ [[~ [EG [~ [[p13<=0 & 0<=p13]]]] & ~ [E [~ [[p13<=0 & 0<=p13]] U [~ [[p20<=0 & 0<=p20]] & ~ [[p13<=0 & 0<=p13]]]]]]]]]

abstracting: (0<=p13)
states: 1,373 (3)
abstracting: (p13<=0)
states: 992
abstracting: (0<=p20)
states: 1,373 (3)
abstracting: (p20<=0)
states: 1,198 (3)
abstracting: (0<=p13)
states: 1,373 (3)
abstracting: (p13<=0)
states: 992
abstracting: (0<=p13)
states: 1,373 (3)
abstracting: (p13<=0)
states: 992
..
EG iterations: 2
.-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [[EX [AF [[[p12<=1 & 1<=p12] & [p21<=0 & 0<=p21]]]] | [p6<=0 & 0<=p6]]]
normalized: ~ [EX [~ [[[p6<=0 & 0<=p6] | EX [~ [EG [~ [[[p21<=0 & 0<=p21] & [p12<=1 & 1<=p12]]]]]]]]]]

abstracting: (1<=p12)
states: 330
abstracting: (p12<=1)
states: 1,373 (3)
abstracting: (0<=p21)
states: 1,373 (3)
abstracting: (p21<=0)
states: 1,198 (3)
.......
EG iterations: 7
.abstracting: (0<=p6)
states: 1,373 (3)
abstracting: (p6<=0)
states: 1,043 (3)
.-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [EG [EF [~ [[p5<=1 & 1<=p5]]]] & EG [EX [[[p18<=0 & 0<=p18] | [p2<=1 & 1<=p2]]]]]
normalized: [EG [E [true U ~ [[p5<=1 & 1<=p5]]]] & EG [EX [[[p2<=1 & 1<=p2] | [p18<=0 & 0<=p18]]]]]

abstracting: (0<=p18)
states: 1,373 (3)
abstracting: (p18<=0)
states: 863
abstracting: (1<=p2)
states: 330
abstracting: (p2<=1)
states: 1,373 (3)
........
EG iterations: 7
abstracting: (1<=p5)
states: 381
abstracting: (p5<=1)
states: 1,373 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: A [[p5<=1 & 1<=p5] U [AX [EG [AX [[p23<=1 & 1<=p23]]]] & AX [AG [[[p3<=1 & 1<=p3] | E [[p4<=0 & 0<=p4] U [p6<=0 & 0<=p6]]]]]]]
normalized: [~ [EG [~ [[~ [EX [~ [EG [~ [EX [~ [[p23<=1 & 1<=p23]]]]]]]] & ~ [EX [E [true U ~ [[E [[p4<=0 & 0<=p4] U [p6<=0 & 0<=p6]] | [p3<=1 & 1<=p3]]]]]]]]]] & ~ [E [~ [[~ [EX [~ [EG [~ [EX [~ [[p23<=1 & 1<=p23]]]]]]]] & ~ [EX [E [true U ~ [[E [[p4<=0 & 0<=p4] U [p6<=0 & 0<=p6]] | [p3<=1 & 1<=p3]]]]]]]] U [~ [[~ [EX [~ [EG [~ [EX [~ [[p23<=1 & 1<=p23]]]]]]]] & ~ [EX [E [true U ~ [[E [[p4<=0 & 0<=p4] U [p6<=0 & 0<=p6]] | [p3<=1 & 1<=p3]]]]]]]] & ~ [[p5<=1 & 1<=p5]]]]]]

abstracting: (1<=p5)
states: 381
abstracting: (p5<=1)
states: 1,373 (3)
abstracting: (1<=p3)
states: 330
abstracting: (p3<=1)
states: 1,373 (3)
abstracting: (0<=p6)
states: 1,373 (3)
abstracting: (p6<=0)
states: 1,043 (3)
abstracting: (0<=p4)
states: 1,373 (3)
abstracting: (p4<=0)
states: 1,043 (3)
.abstracting: (1<=p23)
states: 511
abstracting: (p23<=1)
states: 1,373 (3)
...
EG iterations: 2
.abstracting: (1<=p3)
states: 330
abstracting: (p3<=1)
states: 1,373 (3)
abstracting: (0<=p6)
states: 1,373 (3)
abstracting: (p6<=0)
states: 1,043 (3)
abstracting: (0<=p4)
states: 1,373 (3)
abstracting: (p4<=0)
states: 1,043 (3)
.abstracting: (1<=p23)
states: 511
abstracting: (p23<=1)
states: 1,373 (3)
...
EG iterations: 2
.abstracting: (1<=p3)
states: 330
abstracting: (p3<=1)
states: 1,373 (3)
abstracting: (0<=p6)
states: 1,373 (3)
abstracting: (p6<=0)
states: 1,043 (3)
abstracting: (0<=p4)
states: 1,373 (3)
abstracting: (p4<=0)
states: 1,043 (3)
.abstracting: (1<=p23)
states: 511
abstracting: (p23<=1)
states: 1,373 (3)
...
EG iterations: 2
.......
EG iterations: 6
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AX [[[[p9<=1 & 1<=p9] | [AF [[[p2<=0 & 0<=p2] & [p11<=1 & 1<=p11]]] & [p4<=0 & 0<=p4]]] & [[EG [[p5<=1 & 1<=p5]] | EX [EX [[p8<=0 & 0<=p8]]]] | [AG [[p9<=0 & 0<=p9]] | [p21<=0 & 0<=p21]]]]]
normalized: ~ [EX [~ [[[[[p21<=0 & 0<=p21] | ~ [E [true U ~ [[p9<=0 & 0<=p9]]]]] | [EX [EX [[p8<=0 & 0<=p8]]] | EG [[p5<=1 & 1<=p5]]]] & [[[p4<=0 & 0<=p4] & ~ [EG [~ [[[p11<=1 & 1<=p11] & [p2<=0 & 0<=p2]]]]]] | [p9<=1 & 1<=p9]]]]]]

abstracting: (1<=p9)
states: 381
abstracting: (p9<=1)
states: 1,373 (3)
abstracting: (0<=p2)
states: 1,373 (3)
abstracting: (p2<=0)
states: 1,043 (3)
abstracting: (1<=p11)
states: 330
abstracting: (p11<=1)
states: 1,373 (3)
...
EG iterations: 3
abstracting: (0<=p4)
states: 1,373 (3)
abstracting: (p4<=0)
states: 1,043 (3)
abstracting: (1<=p5)
states: 381
abstracting: (p5<=1)
states: 1,373 (3)
..
EG iterations: 2
abstracting: (0<=p8)
states: 1,373 (3)
abstracting: (p8<=0)
states: 1,043 (3)
..abstracting: (0<=p9)
states: 1,373 (3)
abstracting: (p9<=0)
states: 992
abstracting: (0<=p21)
states: 1,373 (3)
abstracting: (p21<=0)
states: 1,198 (3)
.-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [AF [EG [[AX [[[[p1<=0 & 0<=p1] | [p11<=1 & 1<=p11]] & [[p5<=0 & 0<=p5] | [p2<=1 & 1<=p2]]]] & EX [[[p13<=0 & 0<=p13] | [[p16<=1 & 1<=p16] | [p7<=1 & 1<=p7]]]]]]] | EG [EF [[p6<=0 & 0<=p6]]]]
normalized: [EG [E [true U [p6<=0 & 0<=p6]]] | ~ [EG [~ [EG [[EX [[[[p7<=1 & 1<=p7] | [p16<=1 & 1<=p16]] | [p13<=0 & 0<=p13]]] & ~ [EX [~ [[[[p2<=1 & 1<=p2] | [p5<=0 & 0<=p5]] & [[p11<=1 & 1<=p11] | [p1<=0 & 0<=p1]]]]]]]]]]]]

abstracting: (0<=p1)
states: 1,373 (3)
abstracting: (p1<=0)
states: 992
abstracting: (1<=p11)
states: 330
abstracting: (p11<=1)
states: 1,373 (3)
abstracting: (0<=p5)
states: 1,373 (3)
abstracting: (p5<=0)
states: 992
abstracting: (1<=p2)
states: 330
abstracting: (p2<=1)
states: 1,373 (3)
.abstracting: (0<=p13)
states: 1,373 (3)
abstracting: (p13<=0)
states: 992
abstracting: (1<=p16)
states: 330
abstracting: (p16<=1)
states: 1,373 (3)
abstracting: (1<=p7)
states: 330
abstracting: (p7<=1)
states: 1,373 (3)
........
EG iterations: 7
....
EG iterations: 4
abstracting: (0<=p6)
states: 1,373 (3)
abstracting: (p6<=0)
states: 1,043 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: E [EG [[~ [[p0<=0 & 0<=p0]] & [~ [[A [[p14<=0 & 0<=p14] U [[p18<=0 & 0<=p18] | [p17<=1 & 1<=p17]]] & [p20<=1 & 1<=p20]]] & EG [[[[[p17<=0 & 0<=p17] | [p15<=1 & 1<=p15]] & [[p0<=0 & 0<=p0] | [p23<=1 & 1<=p23]]] | ~ [[p21<=0 & 0<=p21]]]]]]] U ~ [[EF [[p20<=1 & 1<=p20]] | [EX [[p1<=0 & 0<=p1]] & [~ [[p2<=1 & 1<=p2]] & [[p2<=0 & 0<=p2] | [p20<=1 & 1<=p20]]]]]]]
normalized: E [EG [[[EG [[~ [[p21<=0 & 0<=p21]] | [[[p23<=1 & 1<=p23] | [p0<=0 & 0<=p0]] & [[p15<=1 & 1<=p15] | [p17<=0 & 0<=p17]]]]] & ~ [[[p20<=1 & 1<=p20] & [~ [EG [~ [[[p17<=1 & 1<=p17] | [p18<=0 & 0<=p18]]]]] & ~ [E [~ [[[p17<=1 & 1<=p17] | [p18<=0 & 0<=p18]]] U [~ [[p14<=0 & 0<=p14]] & ~ [[[p17<=1 & 1<=p17] | [p18<=0 & 0<=p18]]]]]]]]]] & ~ [[p0<=0 & 0<=p0]]]] U ~ [[[[[[p20<=1 & 1<=p20] | [p2<=0 & 0<=p2]] & ~ [[p2<=1 & 1<=p2]]] & EX [[p1<=0 & 0<=p1]]] | E [true U [p20<=1 & 1<=p20]]]]]

abstracting: (1<=p20)
states: 175
abstracting: (p20<=1)
states: 1,373 (3)
abstracting: (0<=p1)
states: 1,373 (3)
abstracting: (p1<=0)
states: 992
.abstracting: (1<=p2)
states: 330
abstracting: (p2<=1)
states: 1,373 (3)
abstracting: (0<=p2)
states: 1,373 (3)
abstracting: (p2<=0)
states: 1,043 (3)
abstracting: (1<=p20)
states: 175
abstracting: (p20<=1)
states: 1,373 (3)
abstracting: (0<=p0)
states: 1,373 (3)
abstracting: (p0<=0)
states: 1,372 (3)
abstracting: (0<=p18)
states: 1,373 (3)
abstracting: (p18<=0)
states: 863
abstracting: (1<=p17)
states: 175
abstracting: (p17<=1)
states: 1,373 (3)
abstracting: (0<=p14)
states: 1,373 (3)
abstracting: (p14<=0)
states: 1,043 (3)
abstracting: (0<=p18)
states: 1,373 (3)
abstracting: (p18<=0)
states: 863
abstracting: (1<=p17)
states: 175
abstracting: (p17<=1)
states: 1,373 (3)
abstracting: (0<=p18)
states: 1,373 (3)
abstracting: (p18<=0)
states: 863
abstracting: (1<=p17)
states: 175
abstracting: (p17<=1)
states: 1,373 (3)
.
EG iterations: 1
abstracting: (1<=p20)
states: 175
abstracting: (p20<=1)
states: 1,373 (3)
abstracting: (0<=p17)
states: 1,373 (3)
abstracting: (p17<=0)
states: 1,198 (3)
abstracting: (1<=p15)
states: 330
abstracting: (p15<=1)
states: 1,373 (3)
abstracting: (0<=p0)
states: 1,373 (3)
abstracting: (p0<=0)
states: 1,372 (3)
abstracting: (1<=p23)
states: 511
abstracting: (p23<=1)
states: 1,373 (3)
abstracting: (0<=p21)
states: 1,373 (3)
abstracting: (p21<=0)
states: 1,198 (3)
......
EG iterations: 6
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [EX [[[~ [E [[p20<=0 & 0<=p20] U [p15<=1 & 1<=p15]]] & [AF [[p16<=0 & 0<=p16]] | EX [[[p2<=0 & 0<=p2] & [p11<=1 & 1<=p11]]]]] | [[p3<=0 & 0<=p3] & [p4<=1 & 1<=p4]]]] & [[AF [[[p16<=0 & 0<=p16] & [p9<=1 & 1<=p9]]] | [AF [[p3<=1 & 1<=p3]] & AG [[AF [~ [[p20<=1 & 1<=p20]]] | [p19<=1 & 1<=p19]]]]] & [AX [[[p5<=0 & 0<=p5] | [p23<=1 & 1<=p23]]] | EF [[A [[[p20<=1 & 1<=p20] & [p23<=0 & 0<=p23]] U ~ [[[p14<=0 & 0<=p14] | [p10<=1 & 1<=p10]]]] & [[[[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]] | [[p23<=0 & 0<=p23] & [p11<=1 & 1<=p11]]] | [[p6<=1 & 1<=p6] | [p12<=1 & 1<=p12]]] & AX [1<=0]]]]]]]
normalized: [[[E [true U [[~ [EX [~ [1<=0]]] & [[[p12<=1 & 1<=p12] | [p6<=1 & 1<=p6]] | [[[p11<=1 & 1<=p11] & [p23<=0 & 0<=p23]] | [[p4<=1 & 1<=p4] & [p23<=1 & 1<=p23]]]]] & [~ [EG [[[p10<=1 & 1<=p10] | [p14<=0 & 0<=p14]]]] & ~ [E [[[p10<=1 & 1<=p10] | [p14<=0 & 0<=p14]] U [~ [[[p23<=0 & 0<=p23] & [p20<=1 & 1<=p20]]] & [[p10<=1 & 1<=p10] | [p14<=0 & 0<=p14]]]]]]]] | ~ [EX [~ [[[p23<=1 & 1<=p23] | [p5<=0 & 0<=p5]]]]]] & [[~ [E [true U ~ [[[p19<=1 & 1<=p19] | ~ [EG [[p20<=1 & 1<=p20]]]]]]] & ~ [EG [~ [[p3<=1 & 1<=p3]]]]] | ~ [EG [~ [[[p9<=1 & 1<=p9] & [p16<=0 & 0<=p16]]]]]]] & EX [[[[p4<=1 & 1<=p4] & [p3<=0 & 0<=p3]] | [[EX [[[p11<=1 & 1<=p11] & [p2<=0 & 0<=p2]]] | ~ [EG [~ [[p16<=0 & 0<=p16]]]]] & ~ [E [[p20<=0 & 0<=p20] U [p15<=1 & 1<=p15]]]]]]]

abstracting: (1<=p15)
states: 330
abstracting: (p15<=1)
states: 1,373 (3)
abstracting: (0<=p20)
states: 1,373 (3)
abstracting: (p20<=0)
states: 1,198 (3)
abstracting: (0<=p16)
states: 1,373 (3)
abstracting: (p16<=0)
states: 1,043 (3)
...
EG iterations: 3
abstracting: (0<=p2)
states: 1,373 (3)
abstracting: (p2<=0)
states: 1,043 (3)
abstracting: (1<=p11)
states: 330
abstracting: (p11<=1)
states: 1,373 (3)
.abstracting: (0<=p3)
states: 1,373 (3)
abstracting: (p3<=0)
states: 1,043 (3)
abstracting: (1<=p4)
states: 330
abstracting: (p4<=1)
states: 1,373 (3)
.abstracting: (0<=p16)
states: 1,373 (3)
abstracting: (p16<=0)
states: 1,043 (3)
abstracting: (1<=p9)
states: 381
abstracting: (p9<=1)
states: 1,373 (3)
...
EG iterations: 3
abstracting: (1<=p3)
states: 330
abstracting: (p3<=1)
states: 1,373 (3)
...
EG iterations: 3
abstracting: (1<=p20)
states: 175
abstracting: (p20<=1)
states: 1,373 (3)
..
EG iterations: 2
abstracting: (1<=p19)
states: 686
abstracting: (p19<=1)
states: 1,373 (3)
abstracting: (0<=p5)
states: 1,373 (3)
abstracting: (p5<=0)
states: 992
abstracting: (1<=p23)
states: 511
abstracting: (p23<=1)
states: 1,373 (3)
.abstracting: (0<=p14)
states: 1,373 (3)
abstracting: (p14<=0)
states: 1,043 (3)
abstracting: (1<=p10)
states: 330
abstracting: (p10<=1)
states: 1,373 (3)
abstracting: (1<=p20)
states: 175
abstracting: (p20<=1)
states: 1,373 (3)
abstracting: (0<=p23)
states: 1,373 (3)
abstracting: (p23<=0)
states: 862
abstracting: (0<=p14)
states: 1,373 (3)
abstracting: (p14<=0)
states: 1,043 (3)
abstracting: (1<=p10)
states: 330
abstracting: (p10<=1)
states: 1,373 (3)
abstracting: (0<=p14)
states: 1,373 (3)
abstracting: (p14<=0)
states: 1,043 (3)
abstracting: (1<=p10)
states: 330
abstracting: (p10<=1)
states: 1,373 (3)
......
EG iterations: 6
abstracting: (1<=p23)
states: 511
abstracting: (p23<=1)
states: 1,373 (3)
abstracting: (1<=p4)
states: 330
abstracting: (p4<=1)
states: 1,373 (3)
abstracting: (0<=p23)
states: 1,373 (3)
abstracting: (p23<=0)
states: 862
abstracting: (1<=p11)
states: 330
abstracting: (p11<=1)
states: 1,373 (3)
abstracting: (1<=p6)
states: 330
abstracting: (p6<=1)
states: 1,373 (3)
abstracting: (1<=p12)
states: 330
abstracting: (p12<=1)
states: 1,373 (3)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.051sec

totally nodes used: 36601 (3.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 42232 124566 166798
used/not used/entry size/cache size: 152372 66956492 16 1024MB
basic ops cache: hits/miss/sum: 13011 35588 48599
used/not used/entry size/cache size: 60024 16717192 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: 1562 3713 5275
used/not used/entry size/cache size: 3713 8384895 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 67072822
1 35529
2 475
3 31
4 6
5 1
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.592sec


BK_STOP 1678516965052

--------------------
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:489 (21), effective:86 (3)

initing FirstDep: 0m 0.000sec


iterations count:179 (7), effective:22 (0)

iterations count:205 (8), effective:26 (1)

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

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

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

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

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

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

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

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

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

iterations count:234 (10), effective:30 (1)

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

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

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

iterations count:190 (8), effective:23 (1)

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-04a"
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-04a, 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-167840348000001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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