About the Execution of Marcie+red for CircularTrains-PT-024
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5515.819 | 14031.00 | 20988.00 | 516.00 | FTFFFFFFFTTTFFTT | 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.r074-smll-167814399900153.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 CircularTrains-PT-024, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900153
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.5K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 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 19K 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 CircularTrains-PT-024-CTLCardinality-00
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-01
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-02
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-03
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-04
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-05
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-06
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-07
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-08
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-09
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-10
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-11
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-12
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-13
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-14
FORMULA_NAME CircularTrains-PT-024-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678305909886
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=CircularTrains-PT-024
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 20:05:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 20:05:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:05:13] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-08 20:05:13] [INFO ] Transformed 48 places.
[2023-03-08 20:05:13] [INFO ] Transformed 24 transitions.
[2023-03-08 20:05:13] [INFO ] Parsed PT model containing 48 places and 24 transitions and 96 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 45 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 17 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 48 cols
[2023-03-08 20:05:13] [INFO ] Computed 25 place invariants in 12 ms
[2023-03-08 20:05:13] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-08 20:05:13] [INFO ] Invariant cache hit.
[2023-03-08 20:05:14] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-08 20:05:14] [INFO ] Invariant cache hit.
[2023-03-08 20:05:14] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 489 ms. Remains : 48/48 places, 24/24 transitions.
Support contains 45 out of 48 places after structural reductions.
[2023-03-08 20:05:14] [INFO ] Flatten gal took : 39 ms
[2023-03-08 20:05:14] [INFO ] Flatten gal took : 15 ms
[2023-03-08 20:05:14] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 44 out of 48 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 64) seen :49
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-08 20:05:15] [INFO ] Invariant cache hit.
[2023-03-08 20:05:15] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-08 20:05:15] [INFO ] [Real]Absence check using 12 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-08 20:05:15] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-08 20:05:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-08 20:05:15] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-08 20:05:15] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA CircularTrains-PT-024-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-024-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 14 ms
[2023-03-08 20:05:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CircularTrains-PT-024-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 6 ms
[2023-03-08 20:05:15] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 40 out of 48 places (down from 41) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 5 ms
[2023-03-08 20:05:15] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:15] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:15] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:15] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:15] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:05:15] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:15] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 10 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:05:16] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 24/24 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 48/48 places, 24/24 transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Input system was already deterministic with 24 transitions.
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:05:16] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-08 20:05:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 24 transitions and 96 arcs took 1 ms.
Total runtime 2736 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: 48 NrTr: 24 NrArc: 96)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.674sec
RS generation: 0m 0.012sec
-> reachability set: #nodes 779 (7.8e+02) #states 86,515 (4)
starting MCC model checker
--------------------------
checking: EG [EX [~ [1<=p3]]]
normalized: EG [EX [~ [1<=p3]]]
abstracting: (1<=p3)
states: 34,016 (4)
..
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: EG [1<=p28]
normalized: EG [1<=p28]
abstracting: (1<=p28)
states: 34,016 (4)
......................................................................................
EG iterations: 86
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.104sec
checking: EX [AG [AF [AX [1<=p14]]]]
normalized: EX [~ [E [true U EG [EX [~ [1<=p14]]]]]]
abstracting: (1<=p14)
states: 34,016 (4)
..
EG iterations: 1
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EF [AG [1<=p22]]
normalized: E [true U ~ [E [true U ~ [1<=p22]]]]
abstracting: (1<=p22)
states: 34,016 (4)
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [AF [~ [1<=p24]]]
normalized: ~ [E [true U EG [1<=p24]]]
abstracting: (1<=p24)
states: 34,016 (4)
......................................................................................
EG iterations: 86
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.149sec
checking: E [[EX [p28<=0] & EX [0<=0]] U EG [EF [p46<=1]]]
normalized: E [[EX [0<=0] & EX [p28<=0]] U EG [E [true U p46<=1]]]
abstracting: (p46<=1)
states: 55,757 (4)
EG iterations: 0
abstracting: (p28<=0)
states: 52,499 (4)
.abstracting: (0<=0)
states: 86,515 (4)
.-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EF [AX [EG [~ [p43<=p34]]]]
normalized: E [true U ~ [EX [~ [EG [~ [p43<=p34]]]]]]
abstracting: (p43<=p34)
states: 75,279 (4)
.......................................
EG iterations: 39
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: EG [EF [~ [p43<=p35]]]
normalized: EG [E [true U ~ [p43<=p35]]]
abstracting: (p43<=p35)
states: 72,021 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [E [[~ [EF [p33<=p31]] | A [~ [p29<=p20] U ~ [p43<=p44]]] U 1<=p43]]
normalized: ~ [EX [~ [E [[[~ [EG [p43<=p44]] & ~ [E [p43<=p44 U [p29<=p20 & p43<=p44]]]] | ~ [E [true U p33<=p31]]] U 1<=p43]]]]
abstracting: (1<=p43)
states: 18,483 (4)
abstracting: (p33<=p31)
states: 66,993 (4)
abstracting: (p43<=p44)
states: 75,279 (4)
abstracting: (p29<=p20)
states: 75,279 (4)
abstracting: (p43<=p44)
states: 75,279 (4)
abstracting: (p43<=p44)
states: 75,279 (4)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [AG [EX [E [[AG [1<=p41] & EG [p10<=1]] U p13<=p45]]] & AF [[AX [~ [p23<=p5]] | AG [[~ [p9<=1] | ~ [1<=p7]]]]]]
normalized: [~ [EG [~ [[~ [E [true U ~ [[~ [1<=p7] | ~ [p9<=1]]]]] | ~ [EX [p23<=p5]]]]]] & ~ [E [true U ~ [EX [E [[EG [p10<=1] & ~ [E [true U ~ [1<=p41]]]] U p13<=p45]]]]]]
abstracting: (p13<=p45)
states: 59,746 (4)
abstracting: (1<=p41)
states: 74,240 (4)
abstracting: (p10<=1)
states: 55,757 (4)
.
EG iterations: 1
.abstracting: (p23<=p5)
states: 59,746 (4)
.abstracting: (p9<=1)
states: 86,515 (4)
abstracting: (1<=p7)
states: 34,016 (4)
..
EG iterations: 2
-> the formula is FALSE
FORMULA CircularTrains-PT-024-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: A [[EX [[[1<=p40 | EX [p47<=p19]] & [~ [A [p0<=0 U 1<=p0]] | [EX [p12<=0] & [1<=p39 | p26<=p0]]]]] & 1<=p4] U A [AF [[AF [p24<=p3] | [~ [p41<=p22] & AF [p42<=p37]]]] U EG [AF [[p45<=1 & 1<=p27]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]] U [EG [~ [[[~ [EG [~ [p42<=p37]]] & ~ [p41<=p22]] | ~ [EG [~ [p24<=p3]]]]]] & ~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]] U [EG [~ [[[~ [EG [~ [p42<=p37]]] & ~ [p41<=p22]] | ~ [EG [~ [p24<=p3]]]]]] & ~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]]]]]]] U [~ [[1<=p4 & EX [[[[[1<=p39 | p26<=p0] & EX [p12<=0]] | ~ [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [p0<=0] & ~ [1<=p0]]]]]]] & [1<=p40 | EX [p47<=p19]]]]]] & ~ [[~ [EG [~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]] U [EG [~ [[[~ [EG [~ [p42<=p37]]] & ~ [p41<=p22]] | ~ [EG [~ [p24<=p3]]]]]] & ~ [EG [~ [EG [~ [[p45<=1 & 1<=p27]]]]]]]]]]]]]]]
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (p24<=p3)
states: 66,993 (4)
..................................................................
EG iterations: 66
abstracting: (p41<=p22)
states: 28,799 (4)
abstracting: (p42<=p37)
states: 75,279 (4)
....................................
EG iterations: 36
.
EG iterations: 1
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
.
EG iterations: 1
abstracting: (p47<=p19)
states: 30,027 (4)
.abstracting: (1<=p40)
states: 34,016 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (p0<=0)
states: 68,032 (4)
abstracting: (1<=p0)
states: 18,483 (4)
abstracting: (1<=p0)
states: 18,483 (4)
..................................................................................................
EG iterations: 98
abstracting: (p12<=0)
states: 52,499 (4)
.abstracting: (p26<=p0)
states: 59,746 (4)
abstracting: (1<=p39)
states: 74,240 (4)
.abstracting: (1<=p4)
states: 74,240 (4)
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (p24<=p3)
states: 66,993 (4)
..................................................................
EG iterations: 66
abstracting: (p41<=p22)
states: 28,799 (4)
abstracting: (p42<=p37)
states: 75,279 (4)
....................................
EG iterations: 36
.
EG iterations: 1
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (p24<=p3)
states: 66,993 (4)
..................................................................
EG iterations: 66
abstracting: (p41<=p22)
states: 28,799 (4)
abstracting: (p42<=p37)
states: 75,279 (4)
....................................
EG iterations: 36
.
EG iterations: 1
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
abstracting: (1<=p27)
states: 34,016 (4)
abstracting: (p45<=1)
states: 86,515 (4)
.......................................................................................
EG iterations: 87
EG iterations: 0
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.547sec
checking: A [[p4<=1 & [EF [EG [p0<=p32]] | [~ [[[1<=p16 | [p6<=p22 & p13<=1]] & AF [1<=p25]]] | A [[AG [1<=p38] | ~ [[p9<=0 | p40<=p16]]] U EG [[p2<=p40 | p39<=0]]]]]] U A [[~ [1<=p21] | AX [[p22<=p13 & [p27<=p12 & ~ [p28<=0]]]]] U ~ [1<=p22]]]
normalized: [~ [EG [~ [[~ [EG [1<=p22]] & ~ [E [1<=p22 U [1<=p22 & ~ [[~ [EX [~ [[p22<=p13 & [p27<=p12 & ~ [p28<=0]]]]]] | ~ [1<=p21]]]]]]]]]] & ~ [E [~ [[~ [EG [1<=p22]] & ~ [E [1<=p22 U [1<=p22 & ~ [[~ [EX [~ [[p22<=p13 & [p27<=p12 & ~ [p28<=0]]]]]] | ~ [1<=p21]]]]]]]] U [~ [[p4<=1 & [[[~ [EG [~ [EG [[p2<=p40 | p39<=0]]]]] & ~ [E [~ [EG [[p2<=p40 | p39<=0]]] U [~ [[~ [[p9<=0 | p40<=p16]] | ~ [E [true U ~ [1<=p38]]]]] & ~ [EG [[p2<=p40 | p39<=0]]]]]]] | ~ [[~ [EG [~ [1<=p25]]] & [1<=p16 | [p6<=p22 & p13<=1]]]]] | E [true U EG [p0<=p32]]]]] & ~ [[~ [EG [1<=p22]] & ~ [E [1<=p22 U [1<=p22 & ~ [[~ [EX [~ [[p22<=p13 & [p27<=p12 & ~ [p28<=0]]]]]] | ~ [1<=p21]]]]]]]]]]]]
abstracting: (1<=p21)
states: 34,016 (4)
abstracting: (p28<=0)
states: 52,499 (4)
abstracting: (p27<=p12)
states: 66,993 (4)
abstracting: (p22<=p13)
states: 66,993 (4)
.abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
......................................................................................
EG iterations: 86
abstracting: (p0<=p32)
states: 75,279 (4)
.
EG iterations: 1
abstracting: (p13<=1)
states: 86,515 (4)
abstracting: (p6<=p22)
states: 28,799 (4)
abstracting: (1<=p16)
states: 34,016 (4)
abstracting: (1<=p25)
states: 34,016 (4)
.......................................................................................
EG iterations: 87
abstracting: (p39<=0)
states: 12,275 (4)
abstracting: (p2<=p40)
states: 64,774 (4)
.
EG iterations: 1
abstracting: (1<=p38)
states: 18,483 (4)
abstracting: (p40<=p16)
states: 66,993 (4)
abstracting: (p9<=0)
states: 52,499 (4)
abstracting: (p39<=0)
states: 12,275 (4)
abstracting: (p2<=p40)
states: 64,774 (4)
.
EG iterations: 1
abstracting: (p39<=0)
states: 12,275 (4)
abstracting: (p2<=p40)
states: 64,774 (4)
.
EG iterations: 1
...............................................
EG iterations: 47
abstracting: (p4<=1)
states: 55,757 (4)
abstracting: (1<=p21)
states: 34,016 (4)
abstracting: (p28<=0)
states: 52,499 (4)
abstracting: (p27<=p12)
states: 66,993 (4)
abstracting: (p22<=p13)
states: 66,993 (4)
.abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
......................................................................................
EG iterations: 86
abstracting: (1<=p21)
states: 34,016 (4)
abstracting: (p28<=0)
states: 52,499 (4)
abstracting: (p27<=p12)
states: 66,993 (4)
abstracting: (p22<=p13)
states: 66,993 (4)
.abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
abstracting: (1<=p22)
states: 34,016 (4)
......................................................................................
EG iterations: 86
......................................................................................
EG iterations: 86
-> the formula is TRUE
FORMULA CircularTrains-PT-024-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.230sec
totally nodes used: 1151642 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 540256 2039930 2580186
used/not used/entry size/cache size: 3013063 64095801 16 1024MB
basic ops cache: hits/miss/sum: 124837 366116 490953
used/not used/entry size/cache size: 753629 16023587 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: 4215 13798 18013
used/not used/entry size/cache size: 13789 8374819 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 66068509
1 956109
2 69153
3 11683
4 1907
5 304
6 188
7 203
8 172
9 84
>= 10 552
Total processing time: 0m 6.586sec
BK_STOP 1678305923917
--------------------
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:464 (19), effective:96 (4)
initing FirstDep: 0m 0.000sec
iterations count:57 (2), effective:11 (0)
iterations count:76 (3), effective:11 (0)
iterations count:57 (2), effective:11 (0)
iterations count:24 (1), effective:0 (0)
iterations count:134 (5), effective:24 (1)
iterations count:54 (2), effective:10 (0)
iterations count:27 (1), effective:1 (0)
iterations count:24 (1), effective:0 (0)
iterations count:174 (7), effective:25 (1)
iterations count:24 (1), effective:0 (0)
iterations count:328 (13), effective:71 (2)
iterations count:98 (4), effective:12 (0)
iterations count:63 (2), effective:13 (0)
iterations count:26 (1), effective:1 (0)
iterations count:27 (1), effective:1 (0)
iterations count:24 (1), effective:0 (0)
iterations count:63 (2), effective:13 (0)
iterations count:63 (2), effective:13 (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="CircularTrains-PT-024"
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 CircularTrains-PT-024, 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 r074-smll-167814399900153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-024.tgz
mv CircularTrains-PT-024 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 '
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 ;