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

About the Execution of Marcie+red for PGCD-COL-D03N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6557.563 3600000.00 3644660.00 14590.70 ?F?F?F?T?FF?TFT? 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.r522-tall-167987247300401.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 PGCD-COL-D03N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D03N050-CTLCardinality-00
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-01
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-02
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-03
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-04
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-05
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-06
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-07
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-08
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-09
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-10
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-11
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-12
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-13
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-14
FORMULA_NAME PGCD-COL-D03N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680811010695

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=PGCD-COL-D03N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 19:56:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 19:56:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 19:56:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-06 19:56:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-06 19:56:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 393 ms
[2023-04-06 19:56:52] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 12 PT places and 12.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2023-04-06 19:56:52] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-04-06 19:56:52] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PGCD-COL-D03N050-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D03N050-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D03N050-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10161 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=350 ) properties (out of 60) seen :50
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3 rows 3 cols
[2023-04-06 19:56:53] [INFO ] Computed 2 invariants in 4 ms
[2023-04-06 19:56:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-06 19:56:53] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-04-06 19:56:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-06 19:56:53] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
[2023-04-06 19:56:53] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-04-06 19:56:53] [INFO ] Flatten gal took : 14 ms
FORMULA PGCD-COL-D03N050-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D03N050-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 19:56:53] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-06 19:56:53] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 5 ms.
[2023-04-06 19:56:53] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-06 19:56:53] [INFO ] Computed 5 invariants in 2 ms
[2023-04-06 19:56:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-06 19:56:53] [INFO ] Invariant cache hit.
[2023-04-06 19:56:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-06 19:56:53] [INFO ] Invariant cache hit.
[2023-04-06 19:56:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 19:56:53] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-04-06 19:56:53] [INFO ] Invariant cache hit.
[2023-04-06 19:56:53] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-06 19:56:53] [INFO ] Flatten gal took : 4 ms
[2023-04-06 19:56:53] [INFO ] Flatten gal took : 3 ms
[2023-04-06 19:56:53] [INFO ] Input system was already deterministic with 12 transitions.
FORMULA PGCD-COL-D03N050-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10036 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=295 ) properties (out of 46) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 19:56:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-04-06 19:56:54] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-06 19:56:54] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 12 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:56:54] [INFO ] Invariant cache hit.
[2023-04-06 19:56:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 0 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Input system was already deterministic with 12 transitions.
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:56:54] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:56:54] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-06 19:56:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 56 arcs took 1 ms.
Total runtime 2561 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: 12 NrTr: 12 NrArc: 56)

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

net check time: 0m 0.000sec

init dd package: 0m 2.759sec


RS generation: 0m10.498sec


-> reachability set: #nodes 34961 (3.5e+04) #states 417,214,571,243 (11)



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

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

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

FORMULA PGCD-COL-D03N050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.865sec

checking: AF [~ [sum(p11, p10, p9, p8)<=16]]
normalized: ~ [EG [sum(p11, p10, p9, p8)<=16]]

abstracting: (sum(p11, p10, p9, p8)<=16)
states: 724,949,814 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-COL-D03N050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m14.782sec

checking: EG [AX [EX [AX [~ [sum(p11, p10, p9, p8)<=22]]]]]
normalized: EG [~ [EX [~ [EX [~ [EX [sum(p11, p10, p9, p8)<=22]]]]]]]

abstracting: (sum(p11, p10, p9, p8)<=22)
states: 2,079,044,775 (9)
.....
EG iterations: 2
-> the formula is FALSE

FORMULA PGCD-COL-D03N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m21.949sec

checking: EF [AX [~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]
normalized: E [true U ~ [EX [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]

abstracting: (sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
MC time: 7m36.014sec

checking: EX [A [sum(p3, p2, p1, p0)<=57 U ~ [[sum(p7, p6, p5, p4)<=13 & 44<=sum(p3, p2, p1, p0)]]]]
normalized: EX [[~ [EG [[sum(p7, p6, p5, p4)<=13 & 44<=sum(p3, p2, p1, p0)]]] & ~ [E [[sum(p7, p6, p5, p4)<=13 & 44<=sum(p3, p2, p1, p0)] U [~ [sum(p3, p2, p1, p0)<=57] & [sum(p7, p6, p5, p4)<=13 & 44<=sum(p3, p2, p1, p0)]]]]]]

abstracting: (44<=sum(p3, p2, p1, p0))
states: 398,362,275,747 (11)
abstracting: (sum(p7, p6, p5, p4)<=13)
states: 369,747,296 (8)
abstracting: (sum(p3, p2, p1, p0)<=57)
MC time: 6m31.006sec

checking: AX [[sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) | AF [[AF [~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]] & AG [91<=sum(p7, p6, p5, p4)]]]]]
normalized: ~ [EX [~ [[sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) | ~ [EG [~ [[~ [E [true U ~ [91<=sum(p7, p6, p5, p4)]]] & ~ [EG [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]]]]]]]]

abstracting: (sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
MC time: 5m35.001sec

checking: [AG [~ [E [~ [AX [51<=sum(p7, p6, p5, p4)]] U ~ [AF [sum(p3, p2, p1, p0)<=56]]]]] | ~ [E [[~ [[20<=sum(p11, p10, p9, p8) & 8<=sum(p11, p10, p9, p8)]] | AX [EG [sum(p11, p10, p9, p8)<=71]]] U EF [[69<=sum(p11, p10, p9, p8) | sum(p3, p2, p1, p0)<=23]]]]]
normalized: [~ [E [[~ [EX [~ [EG [sum(p11, p10, p9, p8)<=71]]]] | ~ [[20<=sum(p11, p10, p9, p8) & 8<=sum(p11, p10, p9, p8)]]] U E [true U [69<=sum(p11, p10, p9, p8) | sum(p3, p2, p1, p0)<=23]]]] | ~ [E [true U E [EX [~ [51<=sum(p7, p6, p5, p4)]] U EG [~ [sum(p3, p2, p1, p0)<=56]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=56)
states: 42,952,609,878 (10)
..
EG iterations: 2
abstracting: (51<=sum(p7, p6, p5, p4))
MC time: 4m47.000sec

checking: A [AF [[18<=sum(p11, p10, p9, p8) & sum(p11, p10, p9, p8)<=67]] U [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & AG [[E [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) U sum(p11, p10, p9, p8)<=63] | sum(p11, p10, p9, p8)<=43]]]]
normalized: [~ [EG [~ [[sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & ~ [E [true U ~ [[sum(p11, p10, p9, p8)<=43 | E [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) U sum(p11, p10, p9, p8)<=63]]]]]]]]] & ~ [E [~ [[sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & ~ [E [true U ~ [[sum(p11, p10, p9, p8)<=43 | E [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) U sum(p11, p10, p9, p8)<=63]]]]]]] U [EG [~ [[18<=sum(p11, p10, p9, p8) & sum(p11, p10, p9, p8)<=67]]] & ~ [[sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & ~ [E [true U ~ [[sum(p11, p10, p9, p8)<=43 | E [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) U sum(p11, p10, p9, p8)<=63]]]]]]]]]]]

abstracting: (sum(p11, p10, p9, p8)<=63)
states: 60,951,555,083 (10)
abstracting: (sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8))
MC time: 4m 6.001sec

checking: [AX [[EX [[~ [10<=sum(p3, p2, p1, p0)] | [~ [33<=sum(p3, p2, p1, p0)] | ~ [21<=sum(p3, p2, p1, p0)]]]] | [[AX [~ [sum(p3, p2, p1, p0)<=36]] & EG [sum(p7, p6, p5, p4)<=68]] & [~ [5<=sum(p11, p10, p9, p8)] & ~ [84<=sum(p3, p2, p1, p0)]]]]] | AX [sum(p11, p10, p9, p8)<=87]]
normalized: [~ [EX [~ [sum(p11, p10, p9, p8)<=87]]] | ~ [EX [~ [[[[~ [84<=sum(p3, p2, p1, p0)] & ~ [5<=sum(p11, p10, p9, p8)]] & [EG [sum(p7, p6, p5, p4)<=68] & ~ [EX [sum(p3, p2, p1, p0)<=36]]]] | EX [[[~ [21<=sum(p3, p2, p1, p0)] | ~ [33<=sum(p3, p2, p1, p0)]] | ~ [10<=sum(p3, p2, p1, p0)]]]]]]]]

abstracting: (10<=sum(p3, p2, p1, p0))
states: 417,099,119,745 (11)
abstracting: (33<=sum(p3, p2, p1, p0))
MC time: 3m31.001sec

checking: [E [A [[AG [~ [58<=sum(p3, p2, p1, p0)]] | [~ [[sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) & sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]] & ~ [[99<=sum(p11, p10, p9, p8) & 63<=sum(p7, p6, p5, p4)]]]] U EX [A [sum(p7, p6, p5, p4)<=9 U 82<=sum(p11, p10, p9, p8)]]] U [EX [AF [[sum(p3, p2, p1, p0)<=87 & sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)]]] & E [[AX [36<=sum(p3, p2, p1, p0)] & AG [sum(p11, p10, p9, p8)<=3]] U EX [~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]]] & EX [AX [EF [[A [sum(p7, p6, p5, p4)<=10 U sum(p3, p2, p1, p0)<=19] | sum(p3, p2, p1, p0)<=16]]]]]
normalized: [EX [~ [EX [~ [E [true U [sum(p3, p2, p1, p0)<=16 | [~ [EG [~ [sum(p3, p2, p1, p0)<=19]]] & ~ [E [~ [sum(p3, p2, p1, p0)<=19] U [~ [sum(p3, p2, p1, p0)<=19] & ~ [sum(p7, p6, p5, p4)<=10]]]]]]]]]]] & E [[~ [EG [~ [EX [[~ [EG [~ [82<=sum(p11, p10, p9, p8)]]] & ~ [E [~ [82<=sum(p11, p10, p9, p8)] U [~ [sum(p7, p6, p5, p4)<=9] & ~ [82<=sum(p11, p10, p9, p8)]]]]]]]]] & ~ [E [~ [EX [[~ [EG [~ [82<=sum(p11, p10, p9, p8)]]] & ~ [E [~ [82<=sum(p11, p10, p9, p8)] U [~ [sum(p7, p6, p5, p4)<=9] & ~ [82<=sum(p11, p10, p9, p8)]]]]]]] U [~ [[[~ [[99<=sum(p11, p10, p9, p8) & 63<=sum(p7, p6, p5, p4)]] & ~ [[sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8) & sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]]] | ~ [E [true U 58<=sum(p3, p2, p1, p0)]]]] & ~ [EX [[~ [EG [~ [82<=sum(p11, p10, p9, p8)]]] & ~ [E [~ [82<=sum(p11, p10, p9, p8)] U [~ [sum(p7, p6, p5, p4)<=9] & ~ [82<=sum(p11, p10, p9, p8)]]]]]]]]]]] U [E [[~ [E [true U ~ [sum(p11, p10, p9, p8)<=3]]] & ~ [EX [~ [36<=sum(p3, p2, p1, p0)]]]] U EX [~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]] & EX [~ [EG [~ [[sum(p3, p2, p1, p0)<=87 & sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)]]]]]]]]

abstracting: (sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9594068 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104812 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.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:11549 (962), effective:3858 (321)

initing FirstDep: 0m 0.000sec


idd.h:1025: Timeout: after 455 sec


idd.h:1025: Timeout: after 390 sec


idd.h:1025: Timeout: after 334 sec


idd.h:1025: Timeout: after 286 sec


idd.h:1025: Timeout: after 245 sec


idd.h:1025: Timeout: after 210 sec


idd.h:1025: Timeout: after 180 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="PGCD-COL-D03N050"
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 PGCD-COL-D03N050, 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 r522-tall-167987247300401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D03N050.tgz
mv PGCD-COL-D03N050 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 ;