About the Execution of Marcie+red for RobotManipulation-PT-00010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5913.331 | 25655.00 | 31158.00 | 865.20 | TTTFTTTFFTTFFTTF | 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-167891812100026.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-00010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812100026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.9K Feb 26 05:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 05:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 05:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 05:27 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.7K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 05:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 05:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 139K Feb 26 05:29 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-00010-CTLFireability-00
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-01
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-02
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-03
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-04
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-05
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-06
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-07
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-08
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-09
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-10
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-11
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-12
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-13
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-14
FORMULA_NAME RobotManipulation-PT-00010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678978222444
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-00010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:50:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 14:50:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:50:26] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-16 14:50:26] [INFO ] Transformed 15 places.
[2023-03-16 14:50:26] [INFO ] Transformed 11 transitions.
[2023-03-16 14:50:26] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-00010-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 21 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:50:26] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 14:50:26] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-16 14:50:26] [INFO ] Invariant cache hit.
[2023-03-16 14:50:26] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-16 14:50:26] [INFO ] Invariant cache hit.
[2023-03-16 14:50:26] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:50:26] [INFO ] Flatten gal took : 34 ms
[2023-03-16 14:50:26] [INFO ] Flatten gal took : 11 ms
[2023-03-16 14:50:26] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 40) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 14:50:27] [INFO ] Invariant cache hit.
[2023-03-16 14:50:27] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-16 14:50:27] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:50:27] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA RobotManipulation-PT-00010-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:50:27] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 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 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 17 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 12/15 places, 9/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Input system was already deterministic with 9 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 2 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 2 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:27] [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 2 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 2 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:27] [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 6 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 6 ms. Remains : 9/15 places, 7/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Input system was already deterministic with 7 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:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:27] [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 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:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [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:50:27] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [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 6 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 6 ms. Remains : 9/15 places, 7/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:27] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL 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 3 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Applied a total of 2 rules in 4 ms. Remains 14 /15 variables (removed 1) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 14/15 places, 10/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Input system was already deterministic with 10 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:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [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 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 3 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [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:50:27] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [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:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:27] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 4 ms
[2023-03-16 14:50:27] [INFO ] Flatten gal took : 4 ms
[2023-03-16 14:50:27] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-16 14:50:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 1 ms.
Total runtime 1866 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.727sec
RS generation: 0m 0.088sec
-> reachability set: #nodes 9437 (9.4e+03) #states 20,030,010 (7)
starting MCC model checker
--------------------------
checking: EG [p7<=0]
normalized: EG [p7<=0]
abstracting: (p7<=0)
states: 6,216,210 (6)
...................................................................................
EG iterations: 83
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.281sec
checking: EG [[p7<=0 | p11<=0]]
normalized: EG [[p7<=0 | p11<=0]]
abstracting: (p11<=0)
states: 21,252 (4)
abstracting: (p7<=0)
states: 6,216,210 (6)
...................................................................................
EG iterations: 83
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EX [[~ [E [AX [p12<=0] U AF [[[1<=p3 & 1<=p5] | 1<=p8]]]] | AF [AX [AG [[p1<=0 | p5<=0]]]]]]
normalized: EX [[~ [EG [EX [E [true U ~ [[p1<=0 | p5<=0]]]]]] | ~ [E [~ [EX [~ [p12<=0]]] U ~ [EG [~ [[1<=p8 | [1<=p3 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
...................................................................................
EG iterations: 83
abstracting: (p12<=0)
states: 3,108,105 (6)
.abstracting: (p5<=0)
states: 252
abstracting: (p1<=0)
states: 6,216,210 (6)
.
EG iterations: 0
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.548sec
checking: AX [E [EX [A [EX [[1<=p13 & 1<=p14]] U E [[1<=p2 & 1<=p9] U 1<=p10]]] U 1<=p12]]
normalized: ~ [EX [~ [E [EX [[~ [EG [~ [E [[1<=p2 & 1<=p9] U 1<=p10]]]] & ~ [E [~ [E [[1<=p2 & 1<=p9] U 1<=p10]] U [~ [EX [[1<=p13 & 1<=p14]]] & ~ [E [[1<=p2 & 1<=p9] U 1<=p10]]]]]]] U 1<=p12]]]]
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
.abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
...........................................
EG iterations: 43
..-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.655sec
checking: ~ [A [E [1<=p6 U AF [[A [1<=p8 U 1<=p8] | [1<=p6 | [1<=p13 & 1<=p14]]]]] U EF [~ [EF [[1<=p0 & 1<=p4]]]]]]
normalized: ~ [[~ [EG [~ [E [true U ~ [E [true U [1<=p0 & 1<=p4]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [1<=p0 & 1<=p4]]]]] U [~ [E [1<=p6 U ~ [EG [~ [[[1<=p6 | [1<=p13 & 1<=p14]] | [~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p8] & ~ [1<=p8]]]]]]]]]]] & ~ [E [true U ~ [E [true U [1<=p0 & 1<=p4]]]]]]]]]]
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
.......................................................................................................
EG iterations: 103
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.198sec
checking: AX [[AG [EF [[[[1<=p3 & 1<=p5] | 1<=p12] & [1<=p13 & 1<=p14]]]] | [E [[AG [[1<=p13 & 1<=p14]] | [p7<=0 | AF [1<=p8]]] U AG [1<=p6]] | [1<=p7 & 1<=p11]]]]
normalized: ~ [EX [~ [[[[1<=p7 & 1<=p11] | E [[[p7<=0 | ~ [EG [~ [1<=p8]]]] | ~ [E [true U ~ [[1<=p13 & 1<=p14]]]]] U ~ [E [true U ~ [1<=p6]]]]] | ~ [E [true U ~ [E [true U [[1<=p13 & 1<=p14] & [1<=p12 | [1<=p3 & 1<=p5]]]]]]]]]]]
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (p7<=0)
states: 6,216,210 (6)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.349sec
checking: A [[~ [[p7<=0 & 1<=p8]] & ~ [EX [[E [[1<=p0 & 1<=p4] U 1<=p10] & [p10<=0 & ~ [[1<=p1 & 1<=p5]]]]]]] U EF [[~ [EX [~ [[1<=p2 & 1<=p9]]]] & E [AX [[1<=p7 & 1<=p11]] U 1<=p6]]]]
normalized: [~ [EG [~ [E [true U [E [~ [EX [~ [[1<=p7 & 1<=p11]]]] U 1<=p6] & ~ [EX [~ [[1<=p2 & 1<=p9]]]]]]]]] & ~ [E [~ [E [true U [E [~ [EX [~ [[1<=p7 & 1<=p11]]]] U 1<=p6] & ~ [EX [~ [[1<=p2 & 1<=p9]]]]]]] U [~ [[~ [EX [[[p10<=0 & ~ [[1<=p1 & 1<=p5]]] & E [[1<=p0 & 1<=p4] U 1<=p10]]]] & ~ [[p7<=0 & 1<=p8]]]] & ~ [E [true U [E [~ [EX [~ [[1<=p7 & 1<=p11]]]] U 1<=p6] & ~ [EX [~ [[1<=p2 & 1<=p9]]]]]]]]]]]
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
.abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
.abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (p7<=0)
states: 6,216,210 (6)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (p10<=0)
states: 6,216,210 (6)
.abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
.abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
.abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
.abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
..
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.481sec
checking: ~ [E [E [[EF [1<=p8] | ~ [[[EF [[1<=p13 & 1<=p14]] & 1<=p12] & [1<=p3 & 1<=p5]]]] U [1<=p6 & [AG [[1<=p3 & 1<=p5]] & AF [AG [[1<=p2 & 1<=p9]]]]]] U [1<=p0 & 1<=p4]]]
normalized: ~ [E [E [[~ [[[1<=p3 & 1<=p5] & [1<=p12 & E [true U [1<=p13 & 1<=p14]]]]] | E [true U 1<=p8]] U [1<=p6 & [~ [EG [E [true U ~ [[1<=p2 & 1<=p9]]]]] & ~ [E [true U ~ [[1<=p3 & 1<=p5]]]]]]] U [1<=p0 & 1<=p4]]]
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
EG iterations: 0
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.478sec
checking: EF [~ [E [[E [[[1<=p0 & 1<=p4] | [1<=p7 & 1<=p11]] U p12<=0] | ~ [[[[1<=p2 & 1<=p9] & [1<=p1 & 1<=p5]] | 1<=p10]]] U [1<=p0 & [1<=p4 & 1<=p10]]]]]
normalized: E [true U ~ [E [[~ [[1<=p10 | [[1<=p1 & 1<=p5] & [1<=p2 & 1<=p9]]]] | E [[[1<=p7 & 1<=p11] | [1<=p0 & 1<=p4]] U p12<=0]] U [1<=p0 & [1<=p4 & 1<=p10]]]]]
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (p12<=0)
states: 3,108,105 (6)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.700sec
checking: [~ [E [[[AX [[1<=p10 | [1<=p2 & 1<=p9]]] & 1<=p2] & [1<=p9 & 1<=p7]] U AX [~ [[1<=p1 & 1<=p5]]]]] | [A [AF [[[1<=p3 & 1<=p5] | [1<=p1 & 1<=p5]]] U [1<=p7 & 1<=p11]] | EF [[AG [[p7<=0 | p11<=0]] & [[EG [[p0<=0 | p4<=0]] & ~ [A [1<=p8 U 1<=p6]]] | [EG [p7<=0] | AF [[p8<=0 | [p7<=0 | p11<=0]]]]]]]]]
normalized: [[E [true U [[[~ [EG [~ [[p8<=0 | [p7<=0 | p11<=0]]]]] | EG [p7<=0]] | [~ [[~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [1<=p8] & ~ [1<=p6]]]]]] & EG [[p0<=0 | p4<=0]]]] & ~ [E [true U ~ [[p7<=0 | p11<=0]]]]]] | [~ [EG [~ [[1<=p7 & 1<=p11]]]] & ~ [E [~ [[1<=p7 & 1<=p11]] U [EG [~ [[[1<=p1 & 1<=p5] | [1<=p3 & 1<=p5]]]] & ~ [[1<=p7 & 1<=p11]]]]]]] | ~ [E [[[1<=p9 & 1<=p7] & [1<=p2 & ~ [EX [~ [[1<=p10 | [1<=p2 & 1<=p9]]]]]]] U ~ [EX [[1<=p1 & 1<=p5]]]]]]
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
.abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
.abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
...................................................................................
EG iterations: 83
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
...................................................................................
EG iterations: 83
abstracting: (p11<=0)
states: 21,252 (4)
abstracting: (p7<=0)
states: 6,216,210 (6)
abstracting: (p4<=0)
states: 3,996,135 (6)
abstracting: (p0<=0)
states: 3,108,105 (6)
.......................
EG iterations: 23
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
.......................
EG iterations: 23
abstracting: (p7<=0)
states: 6,216,210 (6)
...................................................................................
EG iterations: 83
abstracting: (p11<=0)
states: 21,252 (4)
abstracting: (p7<=0)
states: 6,216,210 (6)
abstracting: (p8<=0)
states: 6,216,210 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.806sec
checking: EG [[[1<=p2 & 1<=p9] | [[A [~ [[1<=p0 & 1<=p4]] U E [[[1<=p0 & 1<=p4] | 1<=p10] U AG [1<=p6]]] & E [[[1<=p1 & 1<=p5] | 1<=p6] U EF [1<=p7]]] & [A [[1<=p7 & 1<=p11] U p10<=0] & [A [EG [1<=p12] U [1<=p3 & 1<=p5]] | [E [1<=p12 U 1<=p6] | [[p10<=0 & 1<=p8] & [1<=p0 & 1<=p4]]]]]]]]
normalized: EG [[[[[[[[1<=p0 & 1<=p4] & [p10<=0 & 1<=p8]] | E [1<=p12 U 1<=p6]] | [~ [EG [~ [[1<=p3 & 1<=p5]]]] & ~ [E [~ [[1<=p3 & 1<=p5]] U [~ [EG [1<=p12]] & ~ [[1<=p3 & 1<=p5]]]]]]] & [~ [EG [~ [p10<=0]]] & ~ [E [~ [p10<=0] U [~ [[1<=p7 & 1<=p11]] & ~ [p10<=0]]]]]] & [E [[1<=p6 | [1<=p1 & 1<=p5]] U E [true U 1<=p7]] & [~ [EG [~ [E [[1<=p10 | [1<=p0 & 1<=p4]] U ~ [E [true U ~ [1<=p6]]]]]]] & ~ [E [~ [E [[1<=p10 | [1<=p0 & 1<=p4]] U ~ [E [true U ~ [1<=p6]]]]] U [[1<=p0 & 1<=p4] & ~ [E [[1<=p10 | [1<=p0 & 1<=p4]] U ~ [E [true U ~ [1<=p6]]]]]]]]]]] | [1<=p2 & 1<=p9]]]
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
EG iterations: 0
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (p10<=0)
states: 6,216,210 (6)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (p10<=0)
states: 6,216,210 (6)
abstracting: (p10<=0)
states: 6,216,210 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
.
EG iterations: 1
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
.
EG iterations: 1
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (p10<=0)
states: 6,216,210 (6)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.300sec
checking: [A [~ [[[EG [1<=p8] & [[A [1<=p6 U 1<=p6] | [1<=p12 | 1<=p6]] & [[1<=p1 & 1<=p5] | [1<=p0 & 1<=p4]]]] | EG [[[1<=p12 | [1<=p2 & 1<=p9]] & [1<=p6 | [1<=p1 & 1<=p5]]]]]] U [~ [A [[1<=p2 & 1<=p9] U EX [1<=p10]]] | [~ [[1<=p3 & 1<=p5]] & 1<=p8]]] & [EF [[p3<=0 | [p5<=0 | p7<=0]]] & AX [[[[1<=p7 & 1<=p11] | [[1<=p0 & 1<=p4] & [1<=p13 & 1<=p14]]] & EG [p12<=0]]]]]
normalized: [[~ [EX [~ [[EG [p12<=0] & [[[1<=p13 & 1<=p14] & [1<=p0 & 1<=p4]] | [1<=p7 & 1<=p11]]]]]] & E [true U [p3<=0 | [p5<=0 | p7<=0]]]] & [~ [EG [~ [[[1<=p8 & ~ [[1<=p3 & 1<=p5]]] | ~ [[~ [EG [~ [EX [1<=p10]]]] & ~ [E [~ [EX [1<=p10]] U [~ [[1<=p2 & 1<=p9]] & ~ [EX [1<=p10]]]]]]]]]]] & ~ [E [~ [[[1<=p8 & ~ [[1<=p3 & 1<=p5]]] | ~ [[~ [EG [~ [EX [1<=p10]]]] & ~ [E [~ [EX [1<=p10]] U [~ [[1<=p2 & 1<=p9]] & ~ [EX [1<=p10]]]]]]]]] U [[EG [[[1<=p6 | [1<=p1 & 1<=p5]] & [1<=p12 | [1<=p2 & 1<=p9]]]] | [[[[1<=p0 & 1<=p4] | [1<=p1 & 1<=p5]] & [[1<=p12 | 1<=p6] | [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [1<=p6] & ~ [1<=p6]]]]]]] & EG [1<=p8]]] & ~ [[[1<=p8 & ~ [[1<=p3 & 1<=p5]]] | ~ [[~ [EG [~ [EX [1<=p10]]]] & ~ [E [~ [EX [1<=p10]] U [~ [[1<=p2 & 1<=p9]] & ~ [EX [1<=p10]]]]]]]]]]]]]]
abstracting: (1<=p10)
states: 13,813,800 (7)
.abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
.abstracting: (1<=p10)
states: 13,813,800 (7)
............................................
EG iterations: 43
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
.......................
EG iterations: 23
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (1<=p10)
states: 13,813,800 (7)
.abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
.abstracting: (1<=p10)
states: 13,813,800 (7)
............................................
EG iterations: 43
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
.abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
.abstracting: (1<=p10)
states: 13,813,800 (7)
............................................
EG iterations: 43
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (p7<=0)
states: 6,216,210 (6)
abstracting: (p5<=0)
states: 252
abstracting: (p3<=0)
states: 3,996,135 (6)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (p12<=0)
states: 3,108,105 (6)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.972sec
checking: [AG [AF [[A [1<=p7 U [1<=p3 & 1<=p5]] | [[p10<=0 & EF [1<=p8]] | E [p12<=0 U [1<=p10 | [1<=p0 & 1<=p4]]]]]]] | [A [[[[EG [[1<=p7 & 1<=p11]] & 1<=p8] | AF [[1<=p7 & 1<=p11]]] | [~ [[1<=p0 & 1<=p4]] | ~ [AG [1<=p7]]]] U [[AG [[1<=p3 & 1<=p5]] | 1<=p6] & [p6<=0 | ~ [[1<=p1 & 1<=p5]]]]] & [EF [1<=p6] & AX [[A [[E [[1<=p7 & 1<=p11] U 1<=p12] | 1<=p8] U E [[1<=p1 & 1<=p5] U [1<=p3 & 1<=p5]]] | EF [[[AX [1<=p12] & 1<=p3] & [1<=p5 & 1<=p8]]]]]]]]
normalized: [[[~ [EX [~ [[E [true U [[1<=p5 & 1<=p8] & [1<=p3 & ~ [EX [~ [1<=p12]]]]]] | [~ [EG [~ [E [[1<=p1 & 1<=p5] U [1<=p3 & 1<=p5]]]]] & ~ [E [~ [E [[1<=p1 & 1<=p5] U [1<=p3 & 1<=p5]]] U [~ [[1<=p8 | E [[1<=p7 & 1<=p11] U 1<=p12]]] & ~ [E [[1<=p1 & 1<=p5] U [1<=p3 & 1<=p5]]]]]]]]]]] & E [true U 1<=p6]] & [~ [EG [~ [[[p6<=0 | ~ [[1<=p1 & 1<=p5]]] & [1<=p6 | ~ [E [true U ~ [[1<=p3 & 1<=p5]]]]]]]]] & ~ [E [~ [[[p6<=0 | ~ [[1<=p1 & 1<=p5]]] & [1<=p6 | ~ [E [true U ~ [[1<=p3 & 1<=p5]]]]]]] U [~ [[[E [true U ~ [1<=p7]] | ~ [[1<=p0 & 1<=p4]]] | [~ [EG [~ [[1<=p7 & 1<=p11]]]] | [1<=p8 & EG [[1<=p7 & 1<=p11]]]]]] & ~ [[[p6<=0 | ~ [[1<=p1 & 1<=p5]]] & [1<=p6 | ~ [E [true U ~ [[1<=p3 & 1<=p5]]]]]]]]]]]] | ~ [E [true U EG [~ [[[E [p12<=0 U [1<=p10 | [1<=p0 & 1<=p4]]] | [p10<=0 & E [true U 1<=p8]]] | [~ [EG [~ [[1<=p3 & 1<=p5]]]] & ~ [E [~ [[1<=p3 & 1<=p5]] U [~ [1<=p7] & ~ [[1<=p3 & 1<=p5]]]]]]]]]]]]
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
.
EG iterations: 1
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (p10<=0)
states: 6,216,210 (6)
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (p12<=0)
states: 3,108,105 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (p6<=0)
states: 6,216,210 (6)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
...................................................................................
EG iterations: 83
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (p6<=0)
states: 6,216,210 (6)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (p6<=0)
states: 6,216,210 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
...................................................................................
EG iterations: 83
abstracting: (1<=p12)
states: 16,921,905 (7)
.abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p8)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.669sec
checking: [AF [E [~ [AF [[1<=p0 & 1<=p4]]] U A [[1<=p13 & 1<=p14] U [1<=p13 & 1<=p14]]]] & ~ [A [[EX [[[1<=p7 & 1<=p10] | [1<=p7 & 1<=p11]]] | [[AF [~ [[1<=p3 & 1<=p5]]] & [[1<=p3 & 1<=p5] | 1<=p10]] & [[[1<=p3 & 1<=p5] | [1<=p2 & 1<=p9]] & 1<=p12]]] U [[[EG [[1<=p1 & 1<=p5]] & EF [[1<=p7 & 1<=p11]]] & [EF [[1<=p3 & 1<=p5]] & [EX [[1<=p2 & 1<=p9]] & EF [1<=p7]]]] & [[EG [p7<=0] & [1<=p12 | [1<=p2 & 1<=p9]]] & [1<=p1 & [1<=p5 & 1<=p6]]]]]]]
normalized: [~ [[~ [EG [~ [[[[1<=p1 & [1<=p5 & 1<=p6]] & [[1<=p12 | [1<=p2 & 1<=p9]] & EG [p7<=0]]] & [[[E [true U 1<=p7] & EX [[1<=p2 & 1<=p9]]] & E [true U [1<=p3 & 1<=p5]]] & [E [true U [1<=p7 & 1<=p11]] & EG [[1<=p1 & 1<=p5]]]]]]]] & ~ [E [~ [[[[1<=p1 & [1<=p5 & 1<=p6]] & [[1<=p12 | [1<=p2 & 1<=p9]] & EG [p7<=0]]] & [[[E [true U 1<=p7] & EX [[1<=p2 & 1<=p9]]] & E [true U [1<=p3 & 1<=p5]]] & [E [true U [1<=p7 & 1<=p11]] & EG [[1<=p1 & 1<=p5]]]]]] U [~ [[[[1<=p12 & [[1<=p2 & 1<=p9] | [1<=p3 & 1<=p5]]] & [[1<=p10 | [1<=p3 & 1<=p5]] & ~ [EG [[1<=p3 & 1<=p5]]]]] | EX [[[1<=p7 & 1<=p11] | [1<=p7 & 1<=p10]]]]] & ~ [[[[1<=p1 & [1<=p5 & 1<=p6]] & [[1<=p12 | [1<=p2 & 1<=p9]] & EG [p7<=0]]] & [[[E [true U 1<=p7] & EX [[1<=p2 & 1<=p9]]] & E [true U [1<=p3 & 1<=p5]]] & [E [true U [1<=p7 & 1<=p11]] & EG [[1<=p1 & 1<=p5]]]]]]]]]]] & ~ [EG [~ [E [EG [~ [[1<=p0 & 1<=p4]]] U [~ [EG [~ [[1<=p13 & 1<=p14]]]] & ~ [E [~ [[1<=p13 & 1<=p14]] U [~ [[1<=p13 & 1<=p14]] & ~ [[1<=p13 & 1<=p14]]]]]]]]]]]
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
abstracting: (1<=p14)
states: 19,141,980 (7)
abstracting: (1<=p13)
states: 13,813,800 (7)
...........................................
EG iterations: 43
abstracting: (1<=p4)
states: 16,033,875 (7)
abstracting: (1<=p0)
states: 16,921,905 (7)
.......................
EG iterations: 23
...........................................
EG iterations: 43
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
.abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (p7<=0)
states: 6,216,210 (6)
...................................................................................
EG iterations: 83
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
.abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
.
EG iterations: 1
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p10)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
.abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (p7<=0)
states: 6,216,210 (6)
...................................................................................
EG iterations: 83
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
.
EG iterations: 1
abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p3)
states: 16,033,875 (7)
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
.abstracting: (1<=p7)
states: 13,813,800 (7)
abstracting: (p7<=0)
states: 6,216,210 (6)
...................................................................................
EG iterations: 83
abstracting: (1<=p9)
states: 19,569,550 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
abstracting: (1<=p12)
states: 16,921,905 (7)
abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (1<=p5)
states: 20,029,758 (7)
abstracting: (1<=p1)
states: 13,813,800 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA RobotManipulation-PT-00010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.261sec
totally nodes used: 4066893 (4.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17197716 10846969 28044685
used/not used/entry size/cache size: 12076170 55032694 16 1024MB
basic ops cache: hits/miss/sum: 6693563 3814915 10508478
used/not used/entry size/cache size: 5383121 11394095 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: 219663 109726 329389
used/not used/entry size/cache size: 109071 8279537 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 63565785
1 3273609
2 202427
3 37293
4 11515
5 4983
6 2175
7 1929
8 1020
9 880
>= 10 7248
Total processing time: 0m18.711sec
BK_STOP 1678978248099
--------------------
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:853 (77), effective:201 (18)
initing FirstDep: 0m 0.000sec
iterations count:11 (1), effective:0 (0)
iterations count:53 (4), effective:9 (0)
iterations count:21 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:171 (15), effective:40 (3)
iterations count:21 (1), effective:1 (0)
iterations count:53 (4), effective:9 (0)
iterations count:51 (4), effective:9 (0)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:51 (4), effective:9 (0)
iterations count:51 (4), effective:9 (0)
iterations count:62 (5), effective:12 (1)
iterations count:51 (4), effective:20 (1)
iterations count:91 (8), effective:20 (1)
iterations count:52 (4), effective:9 (0)
iterations count:151 (13), effective:50 (4)
iterations count:50 (4), effective:9 (0)
iterations count:52 (4), effective:9 (0)
iterations count:151 (13), effective:50 (4)
iterations count:52 (4), effective:9 (0)
iterations count:151 (13), effective:50 (4)
iterations count:71 (6), effective:20 (1)
iterations count:211 (19), effective:20 (1)
iterations count:44 (4), effective:9 (0)
iterations count:51 (4), effective:9 (0)
iterations count:11 (1), effective:0 (0)
iterations count:51 (4), effective:20 (1)
iterations count:135 (12), effective:44 (4)
iterations count:275 (25), effective:65 (5)
iterations count:209 (19), effective:36 (3)
iterations count:51 (4), effective:9 (0)
iterations count:211 (19), effective:20 (1)
iterations count:51 (4), effective:20 (1)
iterations count:51 (4), effective:20 (1)
iterations count:51 (4), effective:9 (0)
iterations count:51 (4), effective:20 (1)
iterations count:51 (4), effective:9 (0)
iterations count:11 (1), effective:0 (0)
iterations count:87 (7), effective:19 (1)
iterations count:53 (4), effective:21 (1)
iterations count:52 (4), effective:9 (0)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:155 (14), effective:36 (3)
iterations count:11 (1), effective:0 (0)
iterations count:68 (6), effective:19 (1)
iterations count:71 (6), effective:20 (1)
iterations count:44 (4), effective:9 (0)
iterations count:44 (4), effective:7 (0)
iterations count:71 (6), effective:20 (1)
iterations count:91 (8), effective:20 (1)
iterations count:71 (6), effective:20 (1)
iterations count:71 (6), effective:20 (1)
iterations count:52 (4), effective:9 (0)
iterations count:52 (4), effective:9 (0)
iterations count:15 (1), effective:1 (0)
iterations count:52 (4), effective:9 (0)
iterations count:53 (4), effective:21 (1)
iterations count:52 (4), effective:9 (0)
iterations count:107 (9), effective:24 (2)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:51 (4), effective:9 (0)
iterations count:52 (4), effective:9 (0)
iterations count:51 (4), effective:9 (0)
iterations count:51 (4), effective:9 (0)
iterations count:52 (4), effective:9 (0)
iterations count:51 (4), effective:9 (0)
iterations count:251 (22), effective:60 (5)
iterations count:51 (4), effective:9 (0)
iterations count:52 (4), effective:9 (0)
iterations count:51 (4), effective:9 (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-00010"
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-00010, 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-167891812100026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00010.tgz
mv RobotManipulation-PT-00010 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 ;