About the Execution of Marcie+red for RobotManipulation-PT-00005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5452.504 | 13647.00 | 18663.00 | 592.70 | TFFFTTFFTFFFFFFT | 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.r362-smll-167891812100018.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 RobotManipulation-PT-00005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812100018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K Feb 26 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 05:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 05:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 05:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-00005-CTLFireability-00
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-01
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-02
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-03
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-04
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-05
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-06
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-07
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-08
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-09
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-10
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-11
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-12
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-13
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-14
FORMULA_NAME RobotManipulation-PT-00005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678978126137
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=RobotManipulation-PT-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:48:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 14:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:48:49] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-16 14:48:49] [INFO ] Transformed 15 places.
[2023-03-16 14:48:49] [INFO ] Transformed 11 transitions.
[2023-03-16 14:48:49] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Initial state reduction rules removed 2 formulas.
FORMULA RobotManipulation-PT-00005-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00005-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 19 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 14:48:50] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 14:48:50] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-16 14:48:50] [INFO ] Invariant cache hit.
[2023-03-16 14:48:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-16 14:48:50] [INFO ] Invariant cache hit.
[2023-03-16 14:48:50] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:48:50] [INFO ] Flatten gal took : 30 ms
[2023-03-16 14:48:50] [INFO ] Flatten gal took : 10 ms
[2023-03-16 14:48:50] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 14:48:51] [INFO ] Invariant cache hit.
[2023-03-16 14:48:51] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 5 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 13 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 9/15 places, 7/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 10 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 11/15 places, 9/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 4 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 11/15 places, 9/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 3 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 8/15 places, 6/11 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:51] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:48:51] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:48:51] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-16 14:48:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 0 ms.
Total runtime 2074 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: 15 NrTr: 11 NrArc: 34)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.776sec
RS generation: 0m 0.015sec
-> reachability set: #nodes 1827 (1.8e+03) #states 184,756 (5)
starting MCC model checker
--------------------------
checking: AX [EG [p6<=0]]
normalized: ~ [EX [~ [EG [p6<=0]]]]
abstracting: (p6<=0)
states: 87,516 (4)
.............
EG iterations: 13
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: EG [[p7<=0 | p11<=0]]
normalized: EG [[p7<=0 | p11<=0]]
abstracting: (p11<=0)
states: 2,002 (3)
abstracting: (p7<=0)
states: 87,516 (4)
...........................................
EG iterations: 43
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.163sec
checking: EG [EF [EX [[AG [p8<=0] & EF [p7<=0]]]]]
normalized: EG [E [true U EX [[E [true U p7<=0] & ~ [E [true U ~ [p8<=0]]]]]]]
abstracting: (p8<=0)
states: 87,516 (4)
abstracting: (p7<=0)
states: 87,516 (4)
..
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: EF [EG [AX [[p3<=0 | p5<=0]]]]
normalized: E [true U EG [~ [EX [~ [[p3<=0 | p5<=0]]]]]]
abstracting: (p5<=0)
states: 77
abstracting: (p3<=0)
states: 63,206 (4)
............................................
EG iterations: 43
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.148sec
checking: AF [[AX [1<=0] & [1<=p2 & 1<=p9]]]
normalized: ~ [EG [~ [[[1<=p2 & 1<=p9] & ~ [EX [~ [1<=0]]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (1<=p9)
states: 168,740 (5)
abstracting: (1<=p2)
states: 97,240 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: AX [AG [[p8<=0 & p6<=0]]]
normalized: ~ [EX [E [true U ~ [[p8<=0 & p6<=0]]]]]
abstracting: (p6<=0)
states: 87,516 (4)
abstracting: (p8<=0)
states: 87,516 (4)
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: EG [AF [[1<=p0 & 1<=p4]]]
normalized: EG [~ [EG [~ [[1<=p0 & 1<=p4]]]]]
abstracting: (1<=p4)
states: 121,550 (5)
abstracting: (1<=p0)
states: 140,998 (5)
.............
EG iterations: 13
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: [AF [[AF [[1<=p3 & 1<=p5]] | AF [p10<=0]]] & AG [p8<=0]]
normalized: [~ [E [true U ~ [p8<=0]]] & ~ [EG [~ [[~ [EG [~ [p10<=0]]] | ~ [EG [~ [[1<=p3 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 184,679 (5)
abstracting: (1<=p3)
states: 121,550 (5)
.
EG iterations: 1
abstracting: (p10<=0)
states: 87,516 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p8<=0)
states: 87,516 (4)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: A [[1<=p10 & ~ [[1<=p0 & 1<=p4]]] U AF [~ [[p7<=0 | p11<=0]]]]
normalized: [~ [EG [EG [[p7<=0 | p11<=0]]]] & ~ [E [EG [[p7<=0 | p11<=0]] U [~ [[1<=p10 & ~ [[1<=p0 & 1<=p4]]]] & EG [[p7<=0 | p11<=0]]]]]]
abstracting: (p11<=0)
states: 2,002 (3)
abstracting: (p7<=0)
states: 87,516 (4)
...........................................
EG iterations: 43
abstracting: (1<=p4)
states: 121,550 (5)
abstracting: (1<=p0)
states: 140,998 (5)
abstracting: (1<=p10)
states: 97,240 (4)
abstracting: (p11<=0)
states: 2,002 (3)
abstracting: (p7<=0)
states: 87,516 (4)
...........................................
EG iterations: 43
abstracting: (p11<=0)
states: 2,002 (3)
abstracting: (p7<=0)
states: 87,516 (4)
...........................................
EG iterations: 43
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[AF [~ [E [[1<=p12 | [1<=p13 & 1<=p14]] U [p3<=0 | p5<=0]]]] | [EF [EX [p10<=0]] & EX [0<=0]]]]
normalized: ~ [E [true U ~ [[[EX [0<=0] & E [true U EX [p10<=0]]] | ~ [EG [E [[1<=p12 | [1<=p13 & 1<=p14]] U [p3<=0 | p5<=0]]]]]]]]
abstracting: (p5<=0)
states: 77
abstracting: (p3<=0)
states: 63,206 (4)
abstracting: (1<=p14)
states: 165,308 (5)
abstracting: (1<=p13)
states: 97,240 (4)
abstracting: (1<=p12)
states: 140,998 (5)
.
EG iterations: 1
abstracting: (p10<=0)
states: 87,516 (4)
.abstracting: (0<=0)
states: 184,756 (5)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.048sec
checking: E [EX [~ [[p7<=0 | p11<=0]]] U EX [[EF [AG [1<=p12]] & [1<=p8 & ~ [[[1<=p0 & 1<=p4] & [1<=p13 & 1<=p14]]]]]]]
normalized: E [EX [~ [[p7<=0 | p11<=0]]] U EX [[[1<=p8 & ~ [[[1<=p13 & 1<=p14] & [1<=p0 & 1<=p4]]]] & E [true U ~ [E [true U ~ [1<=p12]]]]]]]
abstracting: (1<=p12)
states: 140,998 (5)
abstracting: (1<=p4)
states: 121,550 (5)
abstracting: (1<=p0)
states: 140,998 (5)
abstracting: (1<=p14)
states: 165,308 (5)
abstracting: (1<=p13)
states: 97,240 (4)
abstracting: (1<=p8)
states: 97,240 (4)
.abstracting: (p11<=0)
states: 2,002 (3)
abstracting: (p7<=0)
states: 87,516 (4)
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: AX [[AX [[p0<=0 | p4<=0]] & [EX [[1<=p3 & 1<=p5]] & [~ [E [[[1<=p1 & 1<=p5] & [1<=p13 & 1<=p14]] U AX [~ [[p2<=0 | p9<=0]]]]] | [p1<=0 | p5<=0]]]]]
normalized: ~ [EX [~ [[[[[p1<=0 | p5<=0] | ~ [E [[[1<=p13 & 1<=p14] & [1<=p1 & 1<=p5]] U ~ [EX [[p2<=0 | p9<=0]]]]]] & EX [[1<=p3 & 1<=p5]]] & ~ [EX [~ [[p0<=0 | p4<=0]]]]]]]]
abstracting: (p4<=0)
states: 63,206 (4)
abstracting: (p0<=0)
states: 43,758 (4)
.abstracting: (1<=p5)
states: 184,679 (5)
abstracting: (1<=p3)
states: 121,550 (5)
.abstracting: (p9<=0)
states: 16,016 (4)
abstracting: (p2<=0)
states: 87,516 (4)
.abstracting: (1<=p5)
states: 184,679 (5)
abstracting: (1<=p1)
states: 97,240 (4)
abstracting: (1<=p14)
states: 165,308 (5)
abstracting: (1<=p13)
states: 97,240 (4)
abstracting: (p5<=0)
states: 77
abstracting: (p1<=0)
states: 87,516 (4)
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.082sec
checking: AG [[EF [p12<=0] | [A [E [1<=p6 U [1<=p1 & 1<=p5]] U p6<=0] | [[EG [[[p13<=0 | p14<=0] & [p2<=0 | p9<=0]]] & p8<=0] & [p10<=0 & [EX [[p2<=0 | p9<=0]] | [EF [p10<=0] & [p0<=0 | p4<=0]]]]]]]]
normalized: ~ [E [true U ~ [[[[[p10<=0 & [[[p0<=0 | p4<=0] & E [true U p10<=0]] | EX [[p2<=0 | p9<=0]]]] & [p8<=0 & EG [[[p2<=0 | p9<=0] & [p13<=0 | p14<=0]]]]] | [~ [EG [~ [p6<=0]]] & ~ [E [~ [p6<=0] U [~ [E [1<=p6 U [1<=p1 & 1<=p5]]] & ~ [p6<=0]]]]]] | E [true U p12<=0]]]]]
abstracting: (p12<=0)
states: 43,758 (4)
abstracting: (p6<=0)
states: 87,516 (4)
abstracting: (1<=p5)
states: 184,679 (5)
abstracting: (1<=p1)
states: 97,240 (4)
abstracting: (1<=p6)
states: 97,240 (4)
abstracting: (p6<=0)
states: 87,516 (4)
abstracting: (p6<=0)
states: 87,516 (4)
.
EG iterations: 1
abstracting: (p14<=0)
states: 19,448 (4)
abstracting: (p13<=0)
states: 87,516 (4)
abstracting: (p9<=0)
states: 16,016 (4)
abstracting: (p2<=0)
states: 87,516 (4)
...........................................
EG iterations: 43
abstracting: (p8<=0)
states: 87,516 (4)
abstracting: (p9<=0)
states: 16,016 (4)
abstracting: (p2<=0)
states: 87,516 (4)
.abstracting: (p10<=0)
states: 87,516 (4)
abstracting: (p4<=0)
states: 63,206 (4)
abstracting: (p0<=0)
states: 43,758 (4)
abstracting: (p10<=0)
states: 87,516 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.209sec
checking: EG [[AX [[[1<=p3 & [1<=p5 & 1<=p8]] | [p7<=0 | p11<=0]]] | [[[1<=p8 & [1<=p2 & 1<=p9]] & [[1<=p0 & 1<=p4] & [1<=p6 & [E [[1<=p1 & 1<=p5] U 1<=p6] | [p7<=0 | p11<=0]]]]] | [[EF [1<=p12] & A [1<=p6 U 1<=p12]] & [1<=p7 & [1<=p11 & 1<=p8]]]]]]
normalized: EG [[[[[1<=p7 & [1<=p11 & 1<=p8]] & [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [1<=p6] & ~ [1<=p12]]]]] & E [true U 1<=p12]]] | [[[1<=p6 & [[p7<=0 | p11<=0] | E [[1<=p1 & 1<=p5] U 1<=p6]]] & [1<=p0 & 1<=p4]] & [1<=p8 & [1<=p2 & 1<=p9]]]] | ~ [EX [~ [[[p7<=0 | p11<=0] | [1<=p3 & [1<=p5 & 1<=p8]]]]]]]]
abstracting: (1<=p8)
states: 97,240 (4)
abstracting: (1<=p5)
states: 184,679 (5)
abstracting: (1<=p3)
states: 121,550 (5)
abstracting: (p11<=0)
states: 2,002 (3)
abstracting: (p7<=0)
states: 87,516 (4)
.abstracting: (1<=p9)
states: 168,740 (5)
abstracting: (1<=p2)
states: 97,240 (4)
abstracting: (1<=p8)
states: 97,240 (4)
abstracting: (1<=p4)
states: 121,550 (5)
abstracting: (1<=p0)
states: 140,998 (5)
abstracting: (1<=p6)
states: 97,240 (4)
abstracting: (1<=p5)
states: 184,679 (5)
abstracting: (1<=p1)
states: 97,240 (4)
abstracting: (p11<=0)
states: 2,002 (3)
abstracting: (p7<=0)
states: 87,516 (4)
abstracting: (1<=p6)
states: 97,240 (4)
abstracting: (1<=p12)
states: 140,998 (5)
abstracting: (1<=p12)
states: 140,998 (5)
abstracting: (1<=p6)
states: 97,240 (4)
abstracting: (1<=p12)
states: 140,998 (5)
abstracting: (1<=p12)
states: 140,998 (5)
.
EG iterations: 1
abstracting: (1<=p8)
states: 97,240 (4)
abstracting: (1<=p11)
states: 182,754 (5)
abstracting: (1<=p7)
states: 97,240 (4)
.................................
EG iterations: 33
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.143sec
totally nodes used: 301100 (3.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 818159 749890 1568049
used/not used/entry size/cache size: 939644 66169220 16 1024MB
basic ops cache: hits/miss/sum: 286063 259916 545979
used/not used/entry size/cache size: 517533 16259683 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: 27491 21740 49231
used/not used/entry size/cache size: 21719 8366889 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 66857249
1 234781
2 10899
3 2254
4 886
5 523
6 323
7 248
8 176
9 257
>= 10 1268
Total processing time: 0m 6.624sec
BK_STOP 1678978139784
--------------------
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:433 (39), effective:101 (9)
initing FirstDep: 0m 0.000sec
iterations count:44 (4), effective:9 (0)
iterations count:51 (4), effective:10 (0)
iterations count:42 (3), effective:8 (0)
iterations count:44 (4), effective:9 (0)
iterations count:41 (3), effective:10 (0)
iterations count:57 (5), effective:10 (0)
iterations count:33 (3), effective:11 (1)
iterations count:77 (7), effective:18 (1)
iterations count:33 (3), effective:11 (1)
iterations count:53 (4), effective:9 (0)
iterations count:51 (4), effective:10 (0)
iterations count:12 (1), effective:1 (0)
iterations count:53 (4), effective:9 (0)
iterations count:31 (2), effective:10 (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="RobotManipulation-PT-00005"
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 RobotManipulation-PT-00005, 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 r362-smll-167891812100018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00005.tgz
mv RobotManipulation-PT-00005 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 ;