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-167819421300601.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-48, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421300601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 11K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 04:33 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.3K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 15K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 34K 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-48-CTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-48-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679000612832

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-48
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 21:03:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 21:03:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 21:03:36] [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 21:03:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 21:03:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1110 ms
[2023-03-16 21:03:37] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 576 PT places and 1.040901408E9 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
[2023-03-16 21:03:37] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 6 ms.
[2023-03-16 21:03:37] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 5 formulas.
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10013 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 85) seen :53
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 21:03:38] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-16 21:03:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 21:03:39] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :16 sat :1 real:15
[2023-03-16 21:03:39] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :16 sat :1 real:15
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-16 21:03:39] [INFO ] After 366ms SMT Verify possible using all constraints in real domain returned unsat :16 sat :1 real:15
[2023-03-16 21:03:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 21:03:39] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :27 sat :5
[2023-03-16 21:03:39] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :27 sat :5
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-16 21:03:39] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :27 sat :5
Fused 32 Parikh solutions to 5 different solutions.
Finished Parikh walk after 429 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=107 )
Parikh walk visited 5 properties in 99 ms.
Successfully simplified 27 atomic propositions for a total of 11 simplifications.
[2023-03-16 21:03:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-16 21:03:39] [INFO ] Flatten gal took : 48 ms
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 21:03:39] [INFO ] Flatten gal took : 6 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:192) in guard (AND (GT $x 143) (LEQ $x 191))introduces in Quality(192) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:192) in guard (AND (GT $x 95) (LEQ $x 143))introduces in Quality(192) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:192) in guard (AND (GT $x 47) (LEQ $x 95))introduces in Quality(192) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:192) in guard (LEQ $x 47)introduces in Quality(192) 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 192 reducing to 4 values.
For transition elaborate3:(AND (GT $x 143) (LEQ $x 191)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 95) (LEQ $x 143)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 47) (LEQ $x 95)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 47) -> (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 48
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 48
[2023-03-16 21:03:39] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 30 ms.
[2023-03-16 21:03:39] [INFO ] Unfolded 9 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 10 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 21:03:39] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 21:03:39] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
[2023-03-16 21:03:39] [INFO ] Invariant cache hit.
[2023-03-16 21:03:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-16 21:03:39] [INFO ] Invariant cache hit.
[2023-03-16 21:03:39] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-16 21:03:39] [INFO ] Invariant cache hit.
[2023-03-16 21:03:39] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 21:03:39] [INFO ] Flatten gal took : 7 ms
[2023-03-16 21:03:39] [INFO ] Flatten gal took : 7 ms
[2023-03-16 21:03:39] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 69) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-16 21:03:40] [INFO ] Invariant cache hit.
[2023-03-16 21:03:40] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 21:03:40] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:27
[2023-03-16 21:03:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 21:03:40] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :23 sat :7
[2023-03-16 21:03:40] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :23 sat :7
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 21:03:40] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :23 sat :7
Fused 30 Parikh solutions to 7 different solutions.
Finished Parikh walk after 620 steps, including 0 resets, run visited all 7 properties in 24 ms. (steps per millisecond=25 )
Parikh walk visited 7 properties in 24 ms.
Successfully simplified 23 atomic propositions for a total of 9 simplifications.
[2023-03-16 21:03:40] [INFO ] Flatten gal took : 5 ms
[2023-03-16 21:03:40] [INFO ] Flatten gal took : 5 ms
[2023-03-16 21:03:40] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 21:03:40] [INFO ] Invariant cache hit.
[2023-03-16 21:03:40] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 21:03:40] [INFO ] Flatten gal took : 3 ms
[2023-03-16 21:03:40] [INFO ] Flatten gal took : 3 ms
[2023-03-16 21:03:40] [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 21:03:40] [INFO ] Invariant cache hit.
[2023-03-16 21:03:40] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 21:03:40] [INFO ] Flatten gal took : 4 ms
[2023-03-16 21:03:40] [INFO ] Flatten gal took : 3 ms
[2023-03-16 21:03:40] [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 21:03:41] [INFO ] Invariant cache hit.
[2023-03-16 21:03:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 2 ms
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 3 ms
[2023-03-16 21:03:41] [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 21:03:41] [INFO ] Invariant cache hit.
[2023-03-16 21:03:41] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 3 ms
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 1 ms
[2023-03-16 21:03:41] [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 21:03:41] [INFO ] Invariant cache hit.
[2023-03-16 21:03:41] [INFO ] Dead Transitions using invariants and state equation in 30 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 21:03:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 1 ms
FORMULA DrinkVendingMachine-COL-48-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 1 ms
[2023-03-16 21:03:41] [INFO ] Input system was already deterministic with 10 transitions.
Support contains 0 out of 12 places (down from 2) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 4 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 8/12 places, 8/10 transitions.
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 1 ms
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 1 ms
[2023-03-16 21:03:41] [INFO ] Input system was already deterministic with 8 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 21:03:41] [INFO ] Invariant cache hit.
[2023-03-16 21:03:41] [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 21:03:41] [INFO ] Flatten gal took : 2 ms
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 1 ms
[2023-03-16 21:03:41] [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 21:03:41] [INFO ] Invariant cache hit.
[2023-03-16 21:03:41] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 2 ms
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 2 ms
[2023-03-16 21:03:41] [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 21:03:41] [INFO ] Invariant cache hit.
[2023-03-16 21:03:41] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 3 ms
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 2 ms
[2023-03-16 21:03:41] [INFO ] Input system was already deterministic with 10 transitions.
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 2 ms
[2023-03-16 21:03:41] [INFO ] Flatten gal took : 2 ms
[2023-03-16 21:03:41] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2023-03-16 21:03:41] [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 4955 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 12 NrTr: 10 NrArc: 34)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.009sec

init dd package: 0m 3.938sec


RS generation: 0m 0.043sec


-> reachability set: #nodes 300 (3.0e+02) #states 13,841,287,201 (10)



starting MCC model checker
--------------------------

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 13,841,287,201 (10)
.-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-48-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [EX [p8<=17]]
normalized: EX [EX [p8<=17]]

abstracting: (p8<=17)
states: 5,084,554,482 (9)
..-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-48-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EG [~ [p11<=p8]] | EF [EX [AX [16<=p11]]]]
normalized: [E [true U EX [~ [EX [~ [16<=p11]]]]] | EG [~ [p11<=p8]]]

abstracting: (p11<=p8)
states: 7,061,881,225 (9)
..................................................................................................................................................................................................
EG iterations: 194
abstracting: (16<=p11)
states: 9,321,683,217 (9)
..-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-48-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.267sec

checking: AG [EF [42<=sum(p3, p2, p1, p0)]]
normalized: ~ [E [true U ~ [E [true U 42<=sum(p3, p2, p1, p0)]]]]

abstracting: (42<=sum(p3, p2, p1, p0))
states: 13,483,550,206 (10)
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-48-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.661sec

checking: AX [[EG [p8<=p11] & ~ [A [EX [p9<=p11] U EX [83<=sum(p3, p2, p1, p0)]]]]]
normalized: ~ [EX [~ [[~ [[~ [EG [~ [EX [83<=sum(p3, p2, p1, p0)]]]] & ~ [E [~ [EX [83<=sum(p3, p2, p1, p0)]] U [~ [EX [p9<=p11]] & ~ [EX [83<=sum(p3, p2, p1, p0)]]]]]]] & EG [p8<=p11]]]]]

abstracting: (p8<=p11)
states: 7,061,881,225 (9)
..................................................................................................................................................................................................
EG iterations: 194
abstracting: (83<=sum(p3, p2, p1, p0))
states: 9,376,927,826 (9)
.abstracting: (p9<=p11)
states: 7,061,881,225 (9)
.abstracting: (83<=sum(p3, p2, p1, p0))
states: 9,376,927,826 (9)
.abstracting: (83<=sum(p3, p2, p1, p0))
states: 9,376,927,826 (9)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-48-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.556sec

checking: EG [A [[~ [EX [0<=0]] | AX [9<=p11]] U [AF [p10<=p9] & [EF [76<=sum(p7, p6, p5, p4)] | [p11<=p9 | p10<=sum(p3, p2, p1, p0)]]]]]
normalized: EG [[~ [EG [~ [[[[p11<=p9 | p10<=sum(p3, p2, p1, p0)] | E [true U 76<=sum(p7, p6, p5, p4)]] & ~ [EG [~ [p10<=p9]]]]]]] & ~ [E [~ [[[[p11<=p9 | p10<=sum(p3, p2, p1, p0)] | E [true U 76<=sum(p7, p6, p5, p4)]] & ~ [EG [~ [p10<=p9]]]]] U [~ [[~ [EX [~ [9<=p11]]] | ~ [EX [0<=0]]]] & ~ [[[[p11<=p9 | p10<=sum(p3, p2, p1, p0)] | E [true U 76<=sum(p7, p6, p5, p4)]] & ~ [EG [~ [p10<=p9]]]]]]]]]]

abstracting: (p10<=p9)
states: 7,061,881,225 (9)
.
EG iterations: 1
abstracting: (76<=sum(p7, p6, p5, p4))
states: 10,496,979,920 (10)
abstracting: (p10<=sum(p3, p2, p1, p0))
states: 13,713,938,161 (10)
abstracting: (p11<=p9)
states: 7,061,881,225 (9)
abstracting: (0<=0)
states: 13,841,287,201 (10)
.abstracting: (9<=p11)
states: 11,299,009,960 (10)
.abstracting: (p10<=p9)
states: 7,061,881,225 (9)
.
EG iterations: 1
abstracting: (76<=sum(p7, p6, p5, p4))
states: 10,496,979,920 (10)
abstracting: (p10<=sum(p3, p2, p1, p0))
states: 13,713,938,161 (10)
abstracting: (p11<=p9)
states: 7,061,881,225 (9)
abstracting: (p10<=p9)
states: 7,061,881,225 (9)
.
EG iterations: 1
abstracting: (76<=sum(p7, p6, p5, p4))
states: 10,496,979,920 (10)
abstracting: (p10<=sum(p3, p2, p1, p0))
states: 13,713,938,161 (10)
abstracting: (p11<=p9)
states: 7,061,881,225 (9)
.
EG iterations: 1
..................................................................................................................................................................................................
EG iterations: 194
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-48-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.644sec

checking: A [AF [[sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4) | 39<=p10]] U [p10<=25 & p8<=sum(p7, p6, p5, p4)]]
normalized: [~ [EG [~ [[p10<=25 & p8<=sum(p7, p6, p5, p4)]]]] & ~ [E [~ [[p10<=25 & p8<=sum(p7, p6, p5, p4)]] U [EG [~ [[sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4) | 39<=p10]]] & ~ [[p10<=25 & p8<=sum(p7, p6, p5, p4)]]]]]]

abstracting: (p8<=sum(p7, p6, p5, p4))
states: 13,713,938,161 (10)
abstracting: (p10<=25)
states: 7,344,356,474 (9)
abstracting: (39<=p10)
states: 2,824,752,490 (9)
abstracting: (sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4))
MC time: 29m10.023sec

checking: A [[AF [~ [EX [~ [sum(p3, p2, p1, p0)<=10]]]] & [AG [p10<=p9] | [~ [[[sum(p7, p6, p5, p4)<=p8 | 94<=p9] & [[p10<=p9 | p10<=62] & 43<=p10]]] & EG [A [p10<=sum(p3, p2, p1, p0) U sum(p7, p6, p5, p4)<=p11]]]]] U ~ [[[AG [E [32<=p10 U p11<=p9]] & [~ [AG [p9<=p8]] & AG [64<=sum(p3, p2, p1, p0)]]] | AX [~ [[p10<=sum(p7, p6, p5, p4) | 96<=p11]]]]]]
normalized: [~ [EG [[~ [EX [[p10<=sum(p7, p6, p5, p4) | 96<=p11]]] | [[~ [E [true U ~ [64<=sum(p3, p2, p1, p0)]]] & E [true U ~ [p9<=p8]]] & ~ [E [true U ~ [E [32<=p10 U p11<=p9]]]]]]]] & ~ [E [[~ [EX [[p10<=sum(p7, p6, p5, p4) | 96<=p11]]] | [[~ [E [true U ~ [64<=sum(p3, p2, p1, p0)]]] & E [true U ~ [p9<=p8]]] & ~ [E [true U ~ [E [32<=p10 U p11<=p9]]]]]] U [~ [[[[EG [[~ [EG [~ [sum(p7, p6, p5, p4)<=p11]]] & ~ [E [~ [sum(p7, p6, p5, p4)<=p11] U [~ [p10<=sum(p3, p2, p1, p0)] & ~ [sum(p7, p6, p5, p4)<=p11]]]]]] & ~ [[[43<=p10 & [p10<=p9 | p10<=62]] & [sum(p7, p6, p5, p4)<=p8 | 94<=p9]]]] | ~ [E [true U ~ [p10<=p9]]]] & ~ [EG [EX [~ [sum(p3, p2, p1, p0)<=10]]]]]] & [~ [EX [[p10<=sum(p7, p6, p5, p4) | 96<=p11]]] | [[~ [E [true U ~ [64<=sum(p3, p2, p1, p0)]]] & E [true U ~ [p9<=p8]]] & ~ [E [true U ~ [E [32<=p10 U p11<=p9]]]]]]]]]]

abstracting: (p11<=p9)
states: 7,061,881,225 (9)
abstracting: (32<=p10)
states: 4,802,079,233 (9)
abstracting: (p9<=p8)
states: 7,061,881,225 (9)
abstracting: (64<=sum(p3, p2, p1, p0))
states: 12,030,356,961 (10)
abstracting: (96<=p11)
states: 0
abstracting: (p10<=sum(p7, p6, p5, p4))
states: 13,713,938,161 (10)
.abstracting: (sum(p3, p2, p1, p0)<=10)
states: 2,403,401 (6)
..
EG iterations: 1
abstracting: (p10<=p9)
states: 7,061,881,225 (9)
abstracting: (94<=p9)
states: 0
abstracting: (sum(p7, p6, p5, p4)<=p8)
states: 140,614,565 (8)
abstracting: (p10<=62)
states: 13,841,287,201 (10)
abstracting: (p10<=p9)
states: 7,061,881,225 (9)
abstracting: (43<=p10)
states: 1,694,851,494 (9)
abstracting: (sum(p7, p6, p5, p4)<=p11)
states: 140,614,565 (8)
abstracting: (p10<=sum(p3, p2, p1, p0))
states: 13,713,938,161 (10)
abstracting: (sum(p7, p6, p5, p4)<=p11)
states: 140,614,565 (8)
abstracting: (sum(p7, p6, p5, p4)<=p11)
states: 140,614,565 (8)
.
EG iterations: 1
..................................................
EG iterations: 50
abstracting: (p11<=p9)
states: 7,061,881,225 (9)
abstracting: (32<=p10)
states: 4,802,079,233 (9)
abstracting: (p9<=p8)
states: 7,061,881,225 (9)
abstracting: (64<=sum(p3, p2, p1, p0))
states: 12,030,356,961 (10)
abstracting: (96<=p11)
states: 0
abstracting: (p10<=sum(p7, p6, p5, p4))
states: 13,713,938,161 (10)
.abstracting: (p11<=p9)
states: 7,061,881,225 (9)
abstracting: (32<=p10)
states: 4,802,079,233 (9)
abstracting: (p9<=p8)
states: 7,061,881,225 (9)
abstracting: (64<=sum(p3, p2, p1, p0))
states: 12,030,356,961 (10)
abstracting: (96<=p11)
states: 0
abstracting: (p10<=sum(p7, p6, p5, p4))
states: 13,713,938,161 (10)
....................................................
EG iterations: 51
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-48-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10231828 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095784 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.006sec


iterations count:2026 (202), effective:768 (76)

initing FirstDep: 0m 0.000sec


iterations count:125 (12), effective:50 (5)

iterations count:178 (17), effective:84 (8)

iterations count:255 (25), effective:147 (14)

iterations count:86 (8), effective:76 (7)

iterations count:86 (8), effective:76 (7)

iterations count:86 (8), effective:38 (3)

iterations count:86 (8), effective:76 (7)

idd.h:1025: Timeout: after 1749 sec


iterations count:58 (5), effective:32 (3)

iterations count:193 (19), effective:83 (8)

iterations count:85 (8), effective:50 (5)

iterations count:172 (17), effective:129 (12)

iterations count:108 (10), effective:49 (4)

iterations count:300 (30), effective:193 (19)

iterations count:58 (5), effective:32 (3)

iterations count:193 (19), effective:83 (8)

iterations count:85 (8), effective:50 (5)

iterations count:172 (17), effective:129 (12)

iterations count:10 (1), effective:0 (0)

iterations count:58 (5), effective:32 (3)

iterations count:193 (19), effective:83 (8)

iterations count:85 (8), effective:50 (5)

iterations count:172 (17), effective:129 (12)

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-48"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DrinkVendingMachine-COL-48, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-167819421300601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-48.tgz
mv DrinkVendingMachine-COL-48 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;