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

About the Execution of Marcie+red for Eratosthenes-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5482.256 8510.00 11509.00 350.80 FTFFFTTFTFFFTTTF 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.r170-tall-167838856800161.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 Eratosthenes-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 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 126K 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 Eratosthenes-PT-100-CTLCardinality-00
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-01
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-02
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-03
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-04
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-05
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-06
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-07
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-08
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-09
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-10
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-11
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-12
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-13
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-14
FORMULA_NAME Eratosthenes-PT-100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678493522030

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=Eratosthenes-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:12:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:12:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:12:03] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-11 00:12:03] [INFO ] Transformed 99 places.
[2023-03-11 00:12:03] [INFO ] Transformed 283 transitions.
[2023-03-11 00:12:03] [INFO ] Parsed PT model containing 99 places and 283 transitions and 849 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA Eratosthenes-PT-100-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 68 transition count 205
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 68 transition count 205
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 149 place count 68 transition count 68
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 163 place count 54 transition count 54
Iterating global reduction 0 with 14 rules applied. Total rules applied 177 place count 54 transition count 54
Applied a total of 177 rules in 15 ms. Remains 54 /74 variables (removed 20) and now considering 54/211 (removed 157) transitions.
// Phase 1: matrix 54 rows 54 cols
[2023-03-11 00:12:03] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-11 00:12:03] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-11 00:12:03] [INFO ] Invariant cache hit.
[2023-03-11 00:12:03] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-11 00:12:03] [INFO ] Invariant cache hit.
[2023-03-11 00:12:03] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 54/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 54/74 places, 54/211 transitions.
Support contains 53 out of 54 places after structural reductions.
[2023-03-11 00:12:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 18 ms
FORMULA Eratosthenes-PT-100-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 54 transitions.
Support contains 52 out of 54 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 50) seen :42
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 00:12:04] [INFO ] Invariant cache hit.
[2023-03-11 00:12:04] [INFO ] After 88ms SMT Verify possible using all constraints in real 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 12 simplifications.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 54 transitions.
Support contains 43 out of 54 places (down from 46) after GAL structural reductions.
FORMULA Eratosthenes-PT-100-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 54 stabilizing places and 54 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 54
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 4 formulas.
FORMULA Eratosthenes-PT-100-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 5 transition count 5
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 5 transition count 5
Applied a total of 98 rules in 2 ms. Remains 5 /54 variables (removed 49) and now considering 5/54 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 5/54 places, 5/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 4 transition count 4
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 4 transition count 4
Applied a total of 100 rules in 1 ms. Remains 4 /54 variables (removed 50) and now considering 4/54 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/54 places, 4/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Graph (complete) has 0 edges and 54 vertex of which 6 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 3 ms. Remains 6 /54 variables (removed 48) and now considering 6/54 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 6/54 places, 6/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 6 transitions.
Support contains 2 out of 6 places (down from 6) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Graph (complete) has 0 edges and 54 vertex of which 6 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 6 /54 variables (removed 48) and now considering 6/54 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 6/54 places, 6/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Graph (complete) has 0 edges and 54 vertex of which 3 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 51 output transitions
Drop transitions removed 51 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /54 variables (removed 51) and now considering 3/54 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 3/54 places, 3/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 11 transition count 11
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 11 transition count 11
Applied a total of 86 rules in 1 ms. Remains 11 /54 variables (removed 43) and now considering 11/54 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/54 places, 11/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 9 transition count 9
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 9 transition count 9
Applied a total of 90 rules in 1 ms. Remains 9 /54 variables (removed 45) and now considering 9/54 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/54 places, 9/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Graph (complete) has 0 edges and 54 vertex of which 3 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 51 output transitions
Drop transitions removed 51 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /54 variables (removed 51) and now considering 3/54 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 3/54 places, 3/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 54/54 transitions.
Graph (complete) has 0 edges and 54 vertex of which 9 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Applied a total of 1 rules in 1 ms. Remains 9 /54 variables (removed 45) and now considering 9/54 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/54 places, 9/54 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:12:04] [INFO ] Input system was already deterministic with 9 transitions.
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:12:04] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:12:04] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-11 00:12:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 54 transitions and 54 arcs took 0 ms.
Total runtime 1599 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: 54 NrTr: 54 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 2.681sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 54 (5.4e+01) #states 198,158,383,604,301,824 (17)



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

checking: EX [~ [A [AF [EX [p37<=0]] U p22<=p45]]]
normalized: EX [~ [[~ [EG [~ [p22<=p45]]] & ~ [E [~ [p22<=p45] U [~ [p22<=p45] & EG [~ [EX [p37<=0]]]]]]]]]

abstracting: (p37<=0)
states: 99,079,191,802,150,912 (16)
..
EG iterations: 1
abstracting: (p22<=p45)
states: 148,618,787,703,226,368 (17)
abstracting: (p22<=p45)
states: 148,618,787,703,226,368 (17)
abstracting: (p22<=p45)
states: 148,618,787,703,226,368 (17)
..........................................................................
EG iterations: 74
.-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: ~ [A [EG [1<=p9] U AF [[1<=p45 & ~ [1<=p53]]]]]
normalized: ~ [[~ [EG [EG [~ [[~ [1<=p53] & 1<=p45]]]]] & ~ [E [EG [~ [[~ [1<=p53] & 1<=p45]]] U [EG [~ [[~ [1<=p53] & 1<=p45]]] & ~ [EG [1<=p9]]]]]]]

abstracting: (1<=p9)
states: 99,079,191,802,150,912 (16)
...........................................................................
EG iterations: 75
abstracting: (1<=p45)
states: 99,079,191,802,150,912 (16)
abstracting: (1<=p53)
states: 99,079,191,802,150,912 (16)
.
EG iterations: 1
abstracting: (1<=p45)
states: 99,079,191,802,150,912 (16)
abstracting: (1<=p53)
states: 99,079,191,802,150,912 (16)
.
EG iterations: 1
abstracting: (1<=p45)
states: 99,079,191,802,150,912 (16)
abstracting: (1<=p53)
states: 99,079,191,802,150,912 (16)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AF [E [[~ [1<=p2] & EF [1<=p40]] U ~ [EG [1<=p24]]]]
normalized: ~ [EG [~ [E [[E [true U 1<=p40] & ~ [1<=p2]] U ~ [EG [1<=p24]]]]]]

abstracting: (1<=p24)
states: 99,079,191,802,150,912 (16)
...........................................................................
EG iterations: 75
abstracting: (1<=p2)
states: 99,079,191,802,150,912 (16)
abstracting: (1<=p40)
states: 99,079,191,802,150,912 (16)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: AX [[~ [p39<=p53] | EG [p17<=p11]]]
normalized: ~ [EX [~ [[EG [p17<=p11] | ~ [p39<=p53]]]]]

abstracting: (p39<=p53)
states: 148,618,787,703,226,368 (17)
abstracting: (p17<=p11)
states: 148,618,787,703,226,368 (17)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [E [~ [EF [1<=p12]] U [~ [AG [p25<=0]] | [~ [EG [p6<=p46]] & [EF [1<=p53] & AG [1<=p45]]]]]]
normalized: EG [E [~ [E [true U 1<=p12]] U [[[~ [E [true U ~ [1<=p45]]] & E [true U 1<=p53]] & ~ [EG [p6<=p46]]] | E [true U ~ [p25<=0]]]]]

abstracting: (p25<=0)
states: 99,079,191,802,150,912 (16)
abstracting: (p6<=p46)
states: 148,618,787,703,226,368 (17)
.
EG iterations: 1
abstracting: (1<=p53)
states: 99,079,191,802,150,912 (16)
abstracting: (1<=p45)
states: 99,079,191,802,150,912 (16)
abstracting: (1<=p12)
states: 99,079,191,802,150,912 (16)
...........................................................................
EG iterations: 75
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AF [[E [[p27<=p36 | ~ [[p17<=0 | 1<=p21]]] U 0<=0] & EG [AF [E [p25<=p13 U 1<=p25]]]]]
normalized: ~ [EG [~ [[EG [~ [EG [~ [E [p25<=p13 U 1<=p25]]]]] & E [[p27<=p36 | ~ [[p17<=0 | 1<=p21]]] U 0<=0]]]]]

abstracting: (0<=0)
states: 198,158,383,604,301,824 (17)
abstracting: (1<=p21)
states: 99,079,191,802,150,912 (16)
abstracting: (p17<=0)
states: 99,079,191,802,150,912 (16)
abstracting: (p27<=p36)
states: 148,618,787,703,226,368 (17)
abstracting: (1<=p25)
states: 99,079,191,802,150,912 (16)
abstracting: (p25<=p13)
states: 148,618,787,703,226,368 (17)
.
EG iterations: 1
...........................................................................
EG iterations: 75

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [EG [[[AG [~ [1<=p42]] & [~ [p15<=p53] & ~ [p33<=p37]]] | [AG [AF [p20<=p35]] & EX [AG [1<=p50]]]]]]
normalized: ~ [EG [~ [EG [[[EX [~ [E [true U ~ [1<=p50]]]] & ~ [E [true U EG [~ [p20<=p35]]]]] | [[~ [p33<=p37] & ~ [p15<=p53]] & ~ [E [true U 1<=p42]]]]]]]]

abstracting: (1<=p42)
states: 99,079,191,802,150,912 (16)
abstracting: (p15<=p53)
states: 148,618,787,703,226,368 (17)
abstracting: (p33<=p37)
states: 148,618,787,703,226,368 (17)
abstracting: (p20<=p35)
states: 148,618,787,703,226,368 (17)
..........................................................................
EG iterations: 74
abstracting: (1<=p50)
states: 99,079,191,802,150,912 (16)
........................................................................
EG iterations: 71

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: AG [~ [E [[p42<=0 | [p22<=1 & p51<=p19]] U [EG [p53<=p6] & [1<=p32 | p13<=p44]]]]]
normalized: ~ [E [true U E [[p42<=0 | [p22<=1 & p51<=p19]] U [[1<=p32 | p13<=p44] & EG [p53<=p6]]]]]

abstracting: (p53<=p6)
states: 148,618,787,703,226,368 (17)
.
EG iterations: 1
abstracting: (p13<=p44)
states: 148,618,787,703,226,368 (17)
abstracting: (1<=p32)
states: 99,079,191,802,150,912 (16)
abstracting: (p51<=p19)
states: 148,618,787,703,226,368 (17)
abstracting: (p22<=1)
states: 198,158,383,604,301,824 (17)
abstracting: (p42<=0)
states: 99,079,191,802,150,912 (16)
-> the formula is FALSE

FORMULA Eratosthenes-PT-100-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[[1<=p13 & EX [0<=0]] & [AX [p43<=p10] & [EF [~ [p23<=p49]] | [AG [~ [1<=p17]] | [AX [p7<=0] & [~ [1<=p16] | ~ [p3<=p22]]]]]]]]
normalized: E [true U [[[[[[~ [p3<=p22] | ~ [1<=p16]] & ~ [EX [~ [p7<=0]]]] | ~ [E [true U 1<=p17]]] | E [true U ~ [p23<=p49]]] & ~ [EX [~ [p43<=p10]]]] & [1<=p13 & EX [0<=0]]]]

abstracting: (0<=0)
states: 198,158,383,604,301,824 (17)
.abstracting: (1<=p13)
states: 99,079,191,802,150,912 (16)
abstracting: (p43<=p10)
states: 148,618,787,703,226,368 (17)
.abstracting: (p23<=p49)
states: 148,618,787,703,226,368 (17)
abstracting: (1<=p17)
states: 99,079,191,802,150,912 (16)
abstracting: (p7<=0)
states: 99,079,191,802,150,912 (16)
.abstracting: (1<=p16)
states: 99,079,191,802,150,912 (16)
abstracting: (p3<=p22)
states: 148,618,787,703,226,368 (17)
-> the formula is TRUE

FORMULA Eratosthenes-PT-100-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 515889 (5.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 436931 497531 934462
used/not used/entry size/cache size: 973911 66134953 16 1024MB
basic ops cache: hits/miss/sum: 51296 75472 126768
used/not used/entry size/cache size: 149975 16627241 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: 61 1143 1204
used/not used/entry size/cache size: 1143 8387465 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 66597472
1 507108
2 4141
3 137
4 2
5 0
6 0
7 0
8 0
9 0
>= 10 4

Total processing time: 0m 4.509sec


BK_STOP 1678493530540

--------------------
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:128 (2), effective:74 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:57 (1), effective:3 (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="Eratosthenes-PT-100"
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 Eratosthenes-PT-100, 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 r170-tall-167838856800161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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