About the Execution of Marcie+red for Referendum-COL-0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.764 | 8209.00 | 11994.00 | 269.30 | FFFFTTTTFFFTFTTF | 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.r330-tall-167889203200402.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 Referendum-COL-0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203200402
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.9K Feb 26 17:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 17:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 26 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.5K Mar 5 18:23 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 Referendum-COL-0010-CTLFireability-00
FORMULA_NAME Referendum-COL-0010-CTLFireability-01
FORMULA_NAME Referendum-COL-0010-CTLFireability-02
FORMULA_NAME Referendum-COL-0010-CTLFireability-03
FORMULA_NAME Referendum-COL-0010-CTLFireability-04
FORMULA_NAME Referendum-COL-0010-CTLFireability-05
FORMULA_NAME Referendum-COL-0010-CTLFireability-06
FORMULA_NAME Referendum-COL-0010-CTLFireability-07
FORMULA_NAME Referendum-COL-0010-CTLFireability-08
FORMULA_NAME Referendum-COL-0010-CTLFireability-09
FORMULA_NAME Referendum-COL-0010-CTLFireability-10
FORMULA_NAME Referendum-COL-0010-CTLFireability-11
FORMULA_NAME Referendum-COL-0010-CTLFireability-12
FORMULA_NAME Referendum-COL-0010-CTLFireability-13
FORMULA_NAME Referendum-COL-0010-CTLFireability-14
FORMULA_NAME Referendum-COL-0010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679159054985
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 17:04:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 17:04:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:04:16] [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-03-18 17:04:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:04:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 532 ms
[2023-03-18 17:04:17] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 31 PT places and 21.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2023-03-18 17:04:17] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 3 ms.
[2023-03-18 17:04:17] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 9 formulas.
FORMULA Referendum-COL-0010-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=0 )
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 12 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [3:1*[0]] contains constants of sort Voters
Arc [3:1*[1]] contains constants of sort Voters
Arc [3:1*[2]] contains constants of sort Voters
Arc [3:1*[3]] contains constants of sort Voters
Arc [3:1*[4]] contains constants of sort Voters
Arc [3:1*[5]] contains constants of sort Voters
Arc [3:1*[6]] contains constants of sort Voters
Arc [3:1*[7]] contains constants of sort Voters
Arc [3:1*[8]] contains constants of sort Voters
Arc [3:1*[9]] contains constants of sort Voters
Transition start : constants on arcs in [[3:1*[0]], [3:1*[1]], [3:1*[2]], [3:1*[3]], [3:1*[4]], [3:1*[5]], [3:1*[6]], [3:1*[7]], [3:1*[8]], [3:1*[9]]] introduces in Voters(10) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 10
[2023-03-18 17:04:17] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 5 ms.
[2023-03-18 17:04:17] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 5 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 17:04:17] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 17:04:17] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-18 17:04:17] [INFO ] Invariant cache hit.
[2023-03-18 17:04:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-18 17:04:17] [INFO ] Invariant cache hit.
[2023-03-18 17:04:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 3 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Incomplete random walk after 10000 steps, including 769 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10009 steps, including 769 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10009 steps, including 769 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10009 steps, including 769 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10009 steps, including 769 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 17:04:17] [INFO ] Invariant cache hit.
[2023-03-18 17:04:17] [INFO ] After 30ms SMT Verify possible using all constraints in real 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 13 simplifications.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 2 formulas.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 2 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-COL-0010-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Support contains 0 out of 2 places (down from 2) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:17] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:17] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:18] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:04:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:18] [INFO ] Input system was already deterministic with 2 transitions.
[2023-03-18 17:04:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:04:18] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:04:18] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 17:04:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2 places, 2 transitions and 3 arcs took 0 ms.
Total runtime 1640 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 2 NrTr: 2 NrArc: 3)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.696sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 3 (3.0e+00) #states 12
starting MCC model checker
--------------------------
checking: EG [p1<=0]
normalized: EG [p1<=0]
abstracting: (p1<=0)
states: 2
..
EG iterations: 2
-> the formula is FALSE
FORMULA Referendum-COL-0010-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AX [1<=p1] & AX [EF [EG [p0<=0]]]]
normalized: [~ [EX [~ [1<=p1]]] & ~ [EX [~ [E [true U EG [p0<=0]]]]]]
abstracting: (p0<=0)
states: 11
.
EG iterations: 1
.abstracting: (1<=p1)
states: 10
.-> the formula is TRUE
FORMULA Referendum-COL-0010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[EX [[AG [p1<=0] | [p1<=0 | p1<=0]]] & EX [1<=p1]]]
normalized: ~ [EG [~ [[EX [[[p1<=0 | p1<=0] | ~ [E [true U ~ [p1<=0]]]]] & EX [1<=p1]]]]]
abstracting: (1<=p1)
states: 10
.abstracting: (p1<=0)
states: 2
abstracting: (p1<=0)
states: 2
abstracting: (p1<=0)
states: 2
.
EG iterations: 0
-> the formula is FALSE
FORMULA Referendum-COL-0010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AG [p1<=0] | [AX [~ [E [p1<=0 U 1<=p1]]] | EX [AX [EG [p0<=0]]]]]
normalized: [[~ [EX [E [p1<=0 U 1<=p1]]] | EX [~ [EX [~ [EG [p0<=0]]]]]] | ~ [E [true U ~ [p1<=0]]]]
abstracting: (p1<=0)
states: 2
abstracting: (p0<=0)
states: 11
.
EG iterations: 1
..abstracting: (1<=p1)
states: 10
abstracting: (p1<=0)
states: 2
.-> the formula is TRUE
FORMULA Referendum-COL-0010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [EG [[[p1<=0 & ~ [E [1<=p1 U 1<=p0]]] | [AG [p1<=0] & p1<=0]]]]
normalized: ~ [EG [~ [EG [[[~ [E [true U ~ [p1<=0]]] & p1<=0] | [~ [E [1<=p1 U 1<=p0]] & p1<=0]]]]]]
abstracting: (p1<=0)
states: 2
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 10
abstracting: (p1<=0)
states: 2
abstracting: (p1<=0)
states: 2
.
EG iterations: 1
............
EG iterations: 12
-> the formula is TRUE
FORMULA Referendum-COL-0010-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[E [[p0<=0 & ~ [[EG [1<=p0] | 1<=p1]]] U EF [AG [1<=p1]]] & [1<=p0 | 1<=p1]]]
normalized: E [true U [E [[~ [[EG [1<=p0] | 1<=p1]] & p0<=0] U E [true U ~ [E [true U ~ [1<=p1]]]]] & [1<=p0 | 1<=p1]]]
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 10
abstracting: (p0<=0)
states: 11
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
-> the formula is FALSE
FORMULA Referendum-COL-0010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [[[EX [EF [p1<=0]] & EF [[EX [1<=p0] | [EG [1<=p0] | 1<=p1]]]] & [AX [p0<=0] & [AF [1<=p1] | [AG [AX [1<=p0]] | p0<=0]]]]]
normalized: EX [[[[~ [EG [~ [1<=p1]]] | [~ [E [true U EX [~ [1<=p0]]]] | p0<=0]] & ~ [EX [~ [p0<=0]]]] & [E [true U [[EG [1<=p0] | 1<=p1] | EX [1<=p0]]] & EX [E [true U p1<=0]]]]]
abstracting: (p1<=0)
states: 2
.abstracting: (1<=p0)
states: 1
.abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (p0<=0)
states: 11
.abstracting: (p0<=0)
states: 11
abstracting: (1<=p0)
states: 1
.abstracting: (1<=p1)
states: 10
..
EG iterations: 2
.-> the formula is TRUE
FORMULA Referendum-COL-0010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[A [[EX [p0<=0] & 1<=p1] U ~ [AF [E [1<=p0 U 1<=p1]]]] & AG [[1<=p1 & [EX [1<=p0] & A [1<=p1 U 1<=p1]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[[~ [E [~ [1<=p1] U [~ [1<=p1] & ~ [1<=p1]]]] & ~ [EG [~ [1<=p1]]]] & EX [1<=p0]] & 1<=p1]]]] & [~ [EG [~ [EG [~ [E [1<=p0 U 1<=p1]]]]]] & ~ [E [~ [EG [~ [E [1<=p0 U 1<=p1]]]] U [~ [[EX [p0<=0] & 1<=p1]] & ~ [EG [~ [E [1<=p0 U 1<=p1]]]]]]]]]]]]
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 10
abstracting: (p0<=0)
states: 11
.abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
............
EG iterations: 12
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
.abstracting: (1<=p1)
states: 10
..
EG iterations: 2
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
EG iterations: 0
-> the formula is FALSE
FORMULA Referendum-COL-0010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AX [EF [EG [AG [1<=p0]]]] | [E [1<=p0 U [1<=p1 & [AX [1<=p1] | EG [1<=p1]]]] & A [EF [1<=p0] U [AG [1<=p1] & ~ [EX [A [1<=p1 U 1<=p1]]]]]]]
normalized: [[[~ [EG [~ [[~ [EX [[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p1] & ~ [1<=p1]]]]]]] & ~ [E [true U ~ [1<=p1]]]]]]] & ~ [E [~ [[~ [EX [[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p1] & ~ [1<=p1]]]]]]] & ~ [E [true U ~ [1<=p1]]]]] U [~ [E [true U 1<=p0]] & ~ [[~ [EX [[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p1] & ~ [1<=p1]]]]]]] & ~ [E [true U ~ [1<=p1]]]]]]]]] & E [1<=p0 U [1<=p1 & [EG [1<=p1] | ~ [EX [~ [1<=p1]]]]]]] | ~ [EX [~ [E [true U EG [~ [E [true U ~ [1<=p0]]]]]]]]]
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
.abstracting: (1<=p1)
states: 10
.abstracting: (1<=p1)
states: 10
...........
EG iterations: 11
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
.abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
.abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
.
EG iterations: 0
-> the formula is FALSE
FORMULA Referendum-COL-0010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [[EX [[[AF [p1<=0] & AG [p0<=0]] & [AX [p1<=0] & [p1<=0 & 1<=p0]]]] | EX [AG [[EF [1<=p1] | 1<=p1]]]] & [AF [p1<=0] | AX [EX [p0<=0]]]]
normalized: [[~ [EX [~ [EX [p0<=0]]]] | ~ [EG [~ [p1<=0]]]] & [EX [~ [E [true U ~ [[E [true U 1<=p1] | 1<=p1]]]]] | EX [[[[p1<=0 & 1<=p0] & ~ [EX [~ [p1<=0]]]] & [~ [E [true U ~ [p0<=0]]] & ~ [EG [~ [p1<=0]]]]]]]]
abstracting: (p1<=0)
states: 2
...........
EG iterations: 11
abstracting: (p0<=0)
states: 11
abstracting: (p1<=0)
states: 2
.abstracting: (1<=p0)
states: 1
abstracting: (p1<=0)
states: 2
.abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
.abstracting: (p1<=0)
states: 2
...........
EG iterations: 11
abstracting: (p0<=0)
states: 11
..-> the formula is FALSE
FORMULA Referendum-COL-0010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EF [[1<=p1 & EG [[A [1<=p0 U 1<=p1] | [p1<=0 | [1<=p0 & 1<=p1]]]]]] & A [~ [AF [EG [p1<=0]]] U [AX [[1<=p1 & [AF [1<=p1] & AF [1<=p1]]]] | 1<=p1]]]
normalized: [[~ [EG [~ [[~ [EX [~ [[[~ [EG [~ [1<=p1]]] & ~ [EG [~ [1<=p1]]]] & 1<=p1]]]] | 1<=p1]]]] & ~ [E [~ [[~ [EX [~ [[[~ [EG [~ [1<=p1]]] & ~ [EG [~ [1<=p1]]]] & 1<=p1]]]] | 1<=p1]] U [~ [EG [~ [EG [p1<=0]]]] & ~ [[~ [EX [~ [[[~ [EG [~ [1<=p1]]] & ~ [EG [~ [1<=p1]]]] & 1<=p1]]]] | 1<=p1]]]]]] & E [true U [EG [[[[1<=p0 & 1<=p1] | p1<=0] | [~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p0] & ~ [1<=p1]]]]]]] & 1<=p1]]]
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
abstracting: (p1<=0)
states: 2
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
EG iterations: 0
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
.abstracting: (p1<=0)
states: 2
..
EG iterations: 2
............
EG iterations: 12
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
.abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE
FORMULA Referendum-COL-0010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EF [[EX [p1<=0] | [1<=p0 | AF [p0<=0]]]] & [EF [[[EX [1<=p1] & [p1<=0 & ~ [E [1<=p0 U 1<=p1]]]] | [[AF [1<=p1] | [1<=p0 | 1<=p1]] & 1<=p1]]] & AG [[AF [1<=p0] & EX [0<=0]]]]]
normalized: [[~ [E [true U ~ [[EX [0<=0] & ~ [EG [~ [1<=p0]]]]]]] & E [true U [[[[1<=p0 | 1<=p1] | ~ [EG [~ [1<=p1]]]] & 1<=p1] | [[~ [E [1<=p0 U 1<=p1]] & p1<=0] & EX [1<=p1]]]]] & E [true U [[~ [EG [~ [p0<=0]]] | 1<=p0] | EX [p1<=0]]]]
abstracting: (p1<=0)
states: 2
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=0)
states: 11
..
EG iterations: 2
abstracting: (1<=p1)
states: 10
.abstracting: (p1<=0)
states: 2
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
abstracting: (1<=p1)
states: 10
abstracting: (1<=p1)
states: 10
..
EG iterations: 2
abstracting: (1<=p1)
states: 10
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
abstracting: (0<=0)
states: 12
.-> the formula is FALSE
FORMULA Referendum-COL-0010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 87 (8.7e+01)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 286 236 522
used/not used/entry size/cache size: 192 67108672 16 1024MB
basic ops cache: hits/miss/sum: 679 144 823
used/not used/entry size/cache size: 265 16776951 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: 107 8 115
used/not used/entry size/cache size: 8 8388600 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 67108835
1 12
2 13
3 0
4 0
5 0
6 0
7 0
8 0
9 1
>= 10 3
Total processing time: 0m 4.251sec
BK_STOP 1679159063194
--------------------
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 CTLFireability -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:23 (11), effective:11 (5)
initing FirstDep: 0m 0.000sec
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:22 (11), effective:10 (5)
iterations count:22 (11), effective:10 (5)
iterations count:3 (1), effective:1 (0)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:22 (11), effective:10 (5)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:22 (11), effective:10 (5)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:22 (11), effective:10 (5)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:23 (11), effective:11 (5)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-COL-0010"
export BK_EXAMINATION="CTLFireability"
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 Referendum-COL-0010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203200402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0010.tgz
mv Referendum-COL-0010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;