About the Execution of Marcie+red for DrinkVendingMachine-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.144 | 11634.00 | 15314.00 | 653.80 | FTTFFTTFFFTFTFFF | 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.r138-smll-167819421200578.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 DrinkVendingMachine-COL-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421200578
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.4K Feb 26 07:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 07:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 06:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 06:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Feb 26 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 24K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-10-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678993064305
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=DrinkVendingMachine-COL-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 18:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 18:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 18:57:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 18:57:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 18:57:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 803 ms
[2023-03-16 18:57:48] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 120 PT places and 444460.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2023-03-16 18:57:48] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2023-03-16 18:57:48] [INFO ] Skeletonized 5 HLPN properties in 11 ms. Removed 11 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 99 steps, including 0 resets, run visited all 5 properties in 10 ms. (steps per millisecond=9 )
[2023-03-16 18:57:48] [INFO ] Flatten gal took : 17 ms
[2023-03-16 18:57:48] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:40) in guard (LEQ $x 9)introduces in Quality(40) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:40) in guard (AND (GT $x 9) (LEQ $x 19))introduces in Quality(40) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:40) in guard (AND (GT $x 19) (LEQ $x 29))introduces in Quality(40) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:40) in guard (AND (GT $x 29) (LEQ $x 39))introduces in Quality(40) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 40 reducing to 4 values.
For transition elaborate0:(LEQ $x 9) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 9) (LEQ $x 19)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 19) (LEQ $x 29)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 29) (LEQ $x 39)) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 10
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 10
[2023-03-16 18:57:48] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 22 ms.
[2023-03-16 18:57:48] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 8 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 18:57:48] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-16 18:57:48] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
[2023-03-16 18:57:48] [INFO ] Invariant cache hit.
[2023-03-16 18:57:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 18:57:48] [INFO ] Invariant cache hit.
[2023-03-16 18:57:48] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-16 18:57:48] [INFO ] Invariant cache hit.
[2023-03-16 18:57:48] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 18:57:48] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:57:48] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:57:48] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 234 steps, including 0 resets, run visited all 27 properties in 20 ms. (steps per millisecond=11 )
[2023-03-16 18:57:48] [INFO ] Flatten gal took : 6 ms
[2023-03-16 18:57:48] [INFO ] Flatten gal took : 5 ms
[2023-03-16 18:57:48] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:48] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 6 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 18:57:49] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 10/12 places, 9/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 18:57:49] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 1 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 18:57:49] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 6/12 places, 7/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 18:57:49] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 18:57:49] [INFO ] Invariant cache hit.
[2023-03-16 18:57:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 1 ms
[2023-03-16 18:57:49] [INFO ] Input system was already deterministic with 10 transitions.
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 3 ms
[2023-03-16 18:57:49] [INFO ] Flatten gal took : 2 ms
[2023-03-16 18:57:49] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-16 18:57:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 1 ms.
Total runtime 2498 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: 12 NrTr: 10 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.399sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 72 (7.2e+01) #states 1,771,561 (6)
starting MCC model checker
--------------------------
checking: EX [AG [1<=p2]]
normalized: EX [~ [E [true U ~ [1<=p2]]]]
abstracting: (1<=p2)
states: 1,610,510 (6)
.-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [[EX [AG [AF [p0<=0]]] | AG [p2<=0]]]
normalized: EG [[EX [~ [E [true U EG [~ [p0<=0]]]]] | ~ [E [true U ~ [p2<=0]]]]]
abstracting: (p2<=0)
states: 161,051 (5)
abstracting: (p0<=0)
states: 161,051 (5)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [AX [[EF [p2<=0] | AG [p0<=0]]]]
normalized: ~ [E [true U EX [~ [[~ [E [true U ~ [p0<=0]]] | E [true U p2<=0]]]]]]
abstracting: (p2<=0)
states: 161,051 (5)
abstracting: (p0<=0)
states: 161,051 (5)
.-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [AG [AF [[2<=p1 & [1<=p3 & 1<=p5]]]]]
normalized: E [true U ~ [E [true U EG [~ [[[1<=p3 & 1<=p5] & 2<=p1]]]]]]
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
.................................................
EG iterations: 49
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: AX [EX [[[EG [AG [p2<=0]] & p8<=0] & [p9<=0 & [p10<=0 & p11<=0]]]]]
normalized: ~ [EX [~ [EX [[[[p10<=0 & p11<=0] & p9<=0] & [EG [~ [E [true U ~ [p2<=0]]]] & p8<=0]]]]]]
abstracting: (p8<=0)
states: 161,051 (5)
abstracting: (p2<=0)
states: 161,051 (5)
.
EG iterations: 1
abstracting: (p9<=0)
states: 161,051 (5)
abstracting: (p11<=0)
states: 161,051 (5)
abstracting: (p10<=0)
states: 161,051 (5)
..-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [E [[1<=p2 | 1<=p0] U AX [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]]]
normalized: EX [E [[1<=p2 | 1<=p0] U ~ [EX [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]]
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
.abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (1<=p2)
states: 1,610,510 (6)
.-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [E [[A [~ [[2<=p1 & [1<=p3 & 1<=p5]]] U [1<=p1 & [1<=p3 & 1<=p6]]] | AX [1<=p0]] U ~ [[~ [EF [1<=p2]] | 1<=p2]]]]
normalized: ~ [E [true U ~ [E [[[~ [EG [~ [[[1<=p3 & 1<=p6] & 1<=p1]]]] & ~ [E [~ [[[1<=p3 & 1<=p6] & 1<=p1]] U [[[1<=p3 & 1<=p5] & 2<=p1] & ~ [[[1<=p3 & 1<=p6] & 1<=p1]]]]]] | ~ [EX [~ [1<=p0]]]] U ~ [[~ [E [true U 1<=p2]] | 1<=p2]]]]]]
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p0)
states: 1,610,510 (6)
.abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
..................................................
EG iterations: 50
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: [EF [AX [[EG [[[p8<=0 & p9<=0] & [p10<=0 & p11<=0]]] | [p3<=0 | p7<=0]]]] & EX [EX [EF [[[p1<=1 | [p3<=0 | p5<=0]] & [p3<=0 | p7<=0]]]]]]
normalized: [EX [EX [E [true U [[p3<=0 | p7<=0] & [[p3<=0 | p5<=0] | p1<=1]]]]] & E [true U ~ [EX [~ [[[p3<=0 | p7<=0] | EG [[[p10<=0 & p11<=0] & [p8<=0 & p9<=0]]]]]]]]]
abstracting: (p9<=0)
states: 161,051 (5)
abstracting: (p8<=0)
states: 161,051 (5)
abstracting: (p11<=0)
states: 161,051 (5)
abstracting: (p10<=0)
states: 161,051 (5)
......................
EG iterations: 22
abstracting: (p7<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
.abstracting: (p1<=1)
states: 322,102 (5)
abstracting: (p5<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
abstracting: (p7<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
..-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[[A [[1<=p1 & [1<=p3 & 1<=p6]] U ~ [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]] & 1<=p3] & [1<=p7 & [p1<=2 | [p3<=0 | p4<=0]]]]]
normalized: E [true U [[[[p3<=0 | p4<=0] | p1<=2] & 1<=p7] & [[~ [EG [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]] & ~ [E [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]] U [~ [[[1<=p3 & 1<=p6] & 1<=p1]] & [[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]] & 1<=p3]]]
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (p1<=2)
states: 483,153 (5)
abstracting: (p4<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [A [1<=p0 U EX [~ [[3<=p1 & [1<=p3 & 1<=p4]]]]] & AX [[[[AX [1<=p2] & [[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]] | p1<=2] | [p3<=0 | p4<=0]]]]
normalized: [~ [EX [~ [[[p3<=0 | p4<=0] | [[[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]] & ~ [EX [~ [1<=p2]]]] | p1<=2]]]]] & [~ [EG [~ [EX [~ [[[1<=p3 & 1<=p4] & 3<=p1]]]]]] & ~ [E [~ [EX [~ [[[1<=p3 & 1<=p4] & 3<=p1]]]] U [~ [1<=p0] & ~ [EX [~ [[[1<=p3 & 1<=p4] & 3<=p1]]]]]]]]]
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
.abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
.abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
...
EG iterations: 2
abstracting: (p1<=2)
states: 483,153 (5)
abstracting: (1<=p2)
states: 1,610,510 (6)
.abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
abstracting: (p4<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
.-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EG [AF [[~ [A [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]] U [2<=p1 & [1<=p3 & 1<=p5]]]] & [~ [E [~ [[1<=p3 & 1<=p7]] U EG [[1<=p1 & [1<=p3 & 1<=p6]]]]] & [AG [p0<=0] | [p3<=0 | p7<=0]]]]]]
normalized: EG [~ [EG [~ [[[[[p3<=0 | p7<=0] | ~ [E [true U ~ [p0<=0]]]] & ~ [E [~ [[1<=p3 & 1<=p7]] U EG [[[1<=p3 & 1<=p6] & 1<=p1]]]]] & ~ [[~ [EG [~ [[[1<=p3 & 1<=p5] & 2<=p1]]]] & ~ [E [~ [[[1<=p3 & 1<=p5] & 2<=p1]] U [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]] & ~ [[[1<=p3 & 1<=p5] & 2<=p1]]]]]]]]]]]]
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
.................................................
EG iterations: 49
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (p0<=0)
states: 161,051 (5)
abstracting: (p7<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[[EG [[[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]] & 1<=p2]] & EF [[1<=p1 & [1<=p3 & 1<=p6]]]] & [AF [EX [p2<=0]] & [[p1<=0 | p3<=0] | [p6<=0 | [[1<=p1 & 1<=p3] & [1<=p6 & [3<=p1 & 1<=p4]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[3<=p1 & 1<=p4] & 1<=p6] & [1<=p1 & 1<=p3]] | p6<=0] | [p1<=0 | p3<=0]] & ~ [EG [~ [EX [p2<=0]]]]] & [E [true U [[1<=p3 & 1<=p6] & 1<=p1]] & EG [[[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]] & 1<=p2]]]]]]]
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
.
EG iterations: 1
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (p2<=0)
states: 161,051 (5)
...
EG iterations: 2
abstracting: (p3<=0)
states: 161,051 (5)
abstracting: (p1<=0)
states: 161,051 (5)
abstracting: (p6<=0)
states: 161,051 (5)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (3<=p1)
states: 1,288,408 (6)
............................................
EG iterations: 44
-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: EG [E [EF [[E [[1<=p1 & [1<=p3 & 1<=p6]] U 1<=p2] | [1<=p2 | ~ [A [[2<=p1 & [1<=p3 & 1<=p5]] U [1<=p3 & 1<=p7]]]]]] U [AG [1<=p0] | [AF [[1<=p0 & 1<=p2]] & A [[1<=p1 & [1<=p3 & 1<=p6]] U [1<=p2 | [1<=p3 & 1<=p7]]]]]]]
normalized: EG [E [E [true U [[~ [[~ [EG [~ [[1<=p3 & 1<=p7]]]] & ~ [E [~ [[1<=p3 & 1<=p7]] U [~ [[[1<=p3 & 1<=p5] & 2<=p1]] & ~ [[1<=p3 & 1<=p7]]]]]]] | 1<=p2] | E [[1<=p1 & [1<=p3 & 1<=p6]] U 1<=p2]]] U [[[~ [EG [~ [[[1<=p3 & 1<=p7] | 1<=p2]]]] & ~ [E [~ [[[1<=p3 & 1<=p7] | 1<=p2]] U [~ [[[1<=p3 & 1<=p6] & 1<=p1]] & ~ [[[1<=p3 & 1<=p7] | 1<=p2]]]]]] & ~ [EG [~ [[1<=p0 & 1<=p2]]]]] | ~ [E [true U ~ [1<=p0]]]]]]
abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p0)
states: 1,610,510 (6)
.
EG iterations: 1
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
..........................................
EG iterations: 42
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p2)
states: 1,610,510 (6)
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
...................................................
EG iterations: 51
EG iterations: 0
-> the formula is TRUE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: [AG [[E [1<=p0 U [A [[1<=p3 & 1<=p7] U [3<=p1 & [1<=p3 & 1<=p4]]] | p2<=0]] | [[1<=p1 & [1<=p3 & 1<=p6]] & [[1<=p0 & EX [[p3<=0 | p7<=0]]] & [AX [[[p8<=0 & p9<=0] & [p10<=0 & p11<=0]]] & [p3<=0 | p7<=0]]]]]] | AF [1<=p0]]
normalized: [~ [EG [~ [1<=p0]]] | ~ [E [true U ~ [[[[[[p3<=0 | p7<=0] & ~ [EX [~ [[[p10<=0 & p11<=0] & [p8<=0 & p9<=0]]]]]] & [EX [[p3<=0 | p7<=0]] & 1<=p0]] & [[1<=p3 & 1<=p6] & 1<=p1]] | E [1<=p0 U [[~ [EG [~ [[[1<=p3 & 1<=p4] & 3<=p1]]]] & ~ [E [~ [[[1<=p3 & 1<=p4] & 3<=p1]] U [~ [[1<=p3 & 1<=p7]] & ~ [[[1<=p3 & 1<=p4] & 3<=p1]]]]]] | p2<=0]]]]]]]
abstracting: (p2<=0)
states: 161,051 (5)
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
................................................
EG iterations: 48
abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (p7<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
.abstracting: (p9<=0)
states: 161,051 (5)
abstracting: (p8<=0)
states: 161,051 (5)
abstracting: (p11<=0)
states: 161,051 (5)
abstracting: (p10<=0)
states: 161,051 (5)
.abstracting: (p7<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
abstracting: (1<=p0)
states: 1,610,510 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: [E [~ [[[1<=p3 & 1<=p7] | [[[AF [[1<=p1 & [1<=p3 & 1<=p6]]] & 1<=p1] & [1<=p3 & 1<=p6]] | [2<=p1 & [1<=p3 & 1<=p5]]]]] U AX [[1<=p3 & 1<=p7]]] & AG [[E [[1<=p1 & [1<=p3 & 1<=p6]] U ~ [[AF [[1<=p3 & 1<=p7]] & AF [1<=p0]]]] | EX [[[p8<=0 & p9<=0] & [p10<=0 & [p11<=0 & AG [[p1<=1 | [p3<=0 | p5<=0]]]]]]]]]]
normalized: [E [~ [[[[[~ [EG [~ [[[1<=p3 & 1<=p6] & 1<=p1]]]] & 1<=p1] & [1<=p3 & 1<=p6]] | [[1<=p3 & 1<=p5] & 2<=p1]] | [1<=p3 & 1<=p7]]] U ~ [EX [~ [[1<=p3 & 1<=p7]]]]] & ~ [E [true U ~ [[EX [[[[~ [E [true U ~ [[[p3<=0 | p5<=0] | p1<=1]]]] & p11<=0] & p10<=0] & [p8<=0 & p9<=0]]] | E [[[1<=p3 & 1<=p6] & 1<=p1] U ~ [[~ [EG [~ [1<=p0]]] & ~ [EG [~ [[1<=p3 & 1<=p7]]]]]]]]]]]]
abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
...................................................
EG iterations: 51
abstracting: (1<=p0)
states: 1,610,510 (6)
.
EG iterations: 1
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (p9<=0)
states: 161,051 (5)
abstracting: (p8<=0)
states: 161,051 (5)
abstracting: (p10<=0)
states: 161,051 (5)
abstracting: (p11<=0)
states: 161,051 (5)
abstracting: (p1<=1)
states: 322,102 (5)
abstracting: (p5<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
.abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
.abstracting: (1<=p7)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
..................................................
EG iterations: 50
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [AF [AX [[p0<=0 | [3<=p1 & [1<=p3 & 1<=p4]]]]] & [~ [A [AG [[[[3<=p1 & [1<=p3 & 1<=p4]] & [2<=p1 & [1<=p3 & 1<=p5]]] | [2<=p1 & [1<=p3 & 1<=p5]]]] U [AX [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]] | AG [[1<=p0 | [2<=p1 & [1<=p3 & 1<=p5]]]]]]] & EG [[[[AF [[[3<=p1 & [1<=p3 & 1<=p4]] & [1<=p1 & [1<=p3 & 1<=p6]]]] | [1<=p1 & [1<=p3 & 1<=p6]]] | [AX [[3<=p1 & [1<=p3 & 1<=p4]]] | [1<=p1 & [1<=p3 & 1<=p6]]]] & EX [[[p1<=0 | [p3<=0 | p6<=0]] & AG [[[1<=p8 | 1<=p9] | [1<=p10 | 1<=p11]]]]]]]]]
normalized: [[EG [[EX [[~ [E [true U ~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]] & [[p3<=0 | p6<=0] | p1<=0]]] & [[[[1<=p3 & 1<=p6] & 1<=p1] | ~ [EX [~ [[[1<=p3 & 1<=p4] & 3<=p1]]]]] | [[[1<=p3 & 1<=p6] & 1<=p1] | ~ [EG [~ [[[[1<=p3 & 1<=p6] & 1<=p1] & [[1<=p3 & 1<=p4] & 3<=p1]]]]]]]]] & ~ [[~ [EG [~ [[~ [E [true U ~ [[[[1<=p3 & 1<=p5] & 2<=p1] | 1<=p0]]]] | ~ [EX [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[[1<=p3 & 1<=p5] & 2<=p1] | 1<=p0]]]] | ~ [EX [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]] U [E [true U ~ [[[[1<=p3 & 1<=p5] & 2<=p1] | [[[1<=p3 & 1<=p5] & 2<=p1] & [[1<=p3 & 1<=p4] & 3<=p1]]]]] & ~ [[~ [E [true U ~ [[[[1<=p3 & 1<=p5] & 2<=p1] | 1<=p0]]]] | ~ [EX [~ [[[1<=p10 | 1<=p11] | [1<=p8 | 1<=p9]]]]]]]]]]]]] & ~ [EG [EX [~ [[[[1<=p3 & 1<=p4] & 3<=p1] | p0<=0]]]]]]
abstracting: (p0<=0)
states: 161,051 (5)
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
..
EG iterations: 1
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
.abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
.abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
.abstracting: (1<=p0)
states: 1,610,510 (6)
abstracting: (2<=p1)
states: 1,449,459 (6)
abstracting: (1<=p5)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
..
EG iterations: 2
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
...............................................
EG iterations: 47
abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (3<=p1)
states: 1,288,408 (6)
abstracting: (1<=p4)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
.abstracting: (1<=p1)
states: 1,610,510 (6)
abstracting: (1<=p6)
states: 1,610,510 (6)
abstracting: (1<=p3)
states: 1,610,510 (6)
abstracting: (p1<=0)
states: 161,051 (5)
abstracting: (p6<=0)
states: 161,051 (5)
abstracting: (p3<=0)
states: 161,051 (5)
abstracting: (1<=p9)
states: 1,610,510 (6)
abstracting: (1<=p8)
states: 1,610,510 (6)
abstracting: (1<=p11)
states: 1,610,510 (6)
abstracting: (1<=p10)
states: 1,610,510 (6)
..
EG iterations: 1
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
totally nodes used: 64791 (6.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 131140 105790 236930
used/not used/entry size/cache size: 153554 66955310 16 1024MB
basic ops cache: hits/miss/sum: 70460 48088 118548
used/not used/entry size/cache size: 99365 16677851 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: 1117 916 2033
used/not used/entry size/cache size: 916 8387692 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 67048155
1 59744
2 592
3 127
4 17
5 27
6 6
7 4
8 1
9 5
>= 10 186
Total processing time: 0m 5.095sec
BK_STOP 1678993075939
--------------------
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:424 (42), effective:154 (15)
initing FirstDep: 0m 0.000sec
iterations count:30 (3), effective:10 (1)
iterations count:13 (1), effective:2 (0)
iterations count:17 (1), effective:3 (0)
iterations count:30 (3), effective:10 (1)
iterations count:17 (1), effective:3 (0)
iterations count:33 (3), effective:10 (1)
iterations count:13 (1), effective:2 (0)
iterations count:18 (1), effective:4 (0)
iterations count:13 (1), effective:2 (0)
iterations count:18 (1), effective:4 (0)
iterations count:30 (3), effective:10 (1)
iterations count:151 (15), effective:41 (4)
iterations count:60 (6), effective:30 (3)
iterations count:40 (4), effective:20 (2)
iterations count:40 (4), effective:20 (2)
iterations count:93 (9), effective:50 (5)
iterations count:18 (1), effective:4 (0)
iterations count:108 (10), effective:61 (6)
iterations count:16 (1), effective:3 (0)
iterations count:17 (1), effective:3 (0)
iterations count:16 (1), effective:3 (0)
iterations count:30 (3), effective:10 (1)
iterations count:10 (1), effective:0 (0)
iterations count:13 (1), effective:2 (0)
iterations count:27 (2), effective:7 (0)
iterations count:12 (1), effective:1 (0)
iterations count:20 (2), effective:5 (0)
iterations count:30 (3), effective:10 (1)
iterations count:30 (3), effective:10 (1)
iterations count:60 (6), effective:30 (3)
iterations count:48 (4), effective:19 (1)
iterations count:18 (1), effective:4 (0)
iterations count:48 (4), effective:24 (2)
iterations count:90 (9), effective:50 (5)
iterations count:60 (6), effective:30 (3)
iterations count:40 (4), effective:20 (2)
iterations count:60 (6), effective:30 (3)
iterations count:10 (1), effective:0 (0)
iterations count:60 (6), effective:30 (3)
iterations count:70 (7), effective:40 (4)
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="DrinkVendingMachine-COL-10"
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 DrinkVendingMachine-COL-10, 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 r138-smll-167819421200578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-10.tgz
mv DrinkVendingMachine-COL-10 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 ;