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.r010-oct2-167813598800225.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AirplaneLD-COL-2000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598800225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.0K Feb 26 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 12:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 12:05 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 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 328K 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 AirplaneLD-COL-2000-CTLCardinality-00
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-01
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-02
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-03
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-04
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-05
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-06
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-07
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-08
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-09
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-10
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-11
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-12
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-13
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-14
FORMULA_NAME AirplaneLD-COL-2000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678677254592

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=AirplaneLD-COL-2000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 03:14:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 03:14:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 03:14:17] [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-13 03:14:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 03:14:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 676 ms
[2023-03-13 03:14:17] [INFO ] Detected 3 constant HL places corresponding to 6002 PT places.
[2023-03-13 03:14:17] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 14019 PT places and 24012.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
[2023-03-13 03:14:17] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 4 ms.
[2023-03-13 03:14:17] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1262 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 85) seen :18
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 67) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 67) seen :0
Running SMT prover for 67 properties.
// Phase 1: matrix 14 rows 17 cols
[2023-03-13 03:14:19] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-13 03:14:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 03:14:19] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 03:14:19] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :27 sat :0 real:40
[2023-03-13 03:14:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 03:14:19] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-13 03:14:20] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :67 sat :0
Fused 67 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 67 atomic propositions for a total of 15 simplifications.
FORMULA AirplaneLD-COL-2000-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 03:14:20] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 28 ms
[2023-03-13 03:14:20] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA AirplaneLD-COL-2000-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-2000-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:4000) in guard (OR (GEQ $A 1999) (EQ $A 3999))introduces in Altitude(4000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:4000) in guard (AND (LT $A 1999) (NEQ $A 3999))introduces in Altitude(4000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 4000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 1999) (EQ $A 3999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 1999) (NEQ $A 3999)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:2000) in guard (OR (LEQ $S 999) (EQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:2000) in guard (AND (GT $S 999) (NEQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:2000) in guard (OR (LEQ $S 999) (EQ $S 1999))introduces in Speed(2000) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:2000) in guard (AND (GT $S 999) (NEQ $S 1999))introduces in Speed(2000) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 2000 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 999) (EQ $S 1999)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 999) (NEQ $S 1999)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 999) (EQ $S 1999)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 999) (NEQ $S 1999)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2023-03-13 03:14:20] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 68 ms.
[2023-03-13 03:14:20] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 22 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 23 cols
[2023-03-13 03:14:20] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-13 03:14:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-13 03:14:20] [INFO ] Invariant cache hit.
[2023-03-13 03:14:20] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-13 03:14:20] [INFO ] Invariant cache hit.
[2023-03-13 03:14:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 23/23 places, 20/20 transitions.
Support contains 22 out of 23 places after structural reductions.
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 3 ms
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 2 ms
[2023-03-13 03:14:20] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-13 03:14:20] [INFO ] Invariant cache hit.
[2023-03-13 03:14:20] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-13 03:14:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 03:14:20] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-13 03:14:20] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :0
Fused 21 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 21 atomic propositions for a total of 3 simplifications.
FORMULA AirplaneLD-COL-2000-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 2 ms
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 2 ms
[2023-03-13 03:14:20] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 23 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 2 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 19/23 places, 18/20 transitions.
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 1 ms
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 1 ms
[2023-03-13 03:14:20] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/23 places, 20/20 transitions.
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 3 ms
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 2 ms
[2023-03-13 03:14:20] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 20 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 20 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 20 transition count 18
Applied a total of 5 rules in 10 ms. Remains 20 /23 variables (removed 3) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 20/23 places, 18/20 transitions.
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 2 ms
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 1 ms
[2023-03-13 03:14:20] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 4 ms
[2023-03-13 03:14:20] [INFO ] Flatten gal took : 1 ms
[2023-03-13 03:14:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 03:14:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 20 transitions and 56 arcs took 0 ms.
Total runtime 3973 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: 23 NrTr: 20 NrArc: 56)

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

net check time: 0m 0.000sec

init dd package: 0m 2.967sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 107 (1.1e+02) #states 485



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

checking: EX [AX [1<=0]]
normalized: EX [~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA AirplaneLD-COL-2000-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: E [[EX [~ [sum(p20, p19)<=sum(p16, p15)]] | EX [p7<=sum(p22, p21)]] U EF [EX [AX [1<=0]]]]
normalized: E [[EX [p7<=sum(p22, p21)] | EX [~ [sum(p20, p19)<=sum(p16, p15)]]] U E [true U EX [~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
..abstracting: (sum(p20, p19)<=sum(p16, p15))
states: 367
.abstracting: (p7<=sum(p22, p21))
states: 458
.-> the formula is TRUE

FORMULA AirplaneLD-COL-2000-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: EX [[[[~ [sum(p14, p13)<=p5] | ~ [p0<=p3]] | AG [p6<=p9]] & AX [1<=0]]]
normalized: EX [[~ [EX [~ [1<=0]]] & [~ [E [true U ~ [p6<=p9]]] | [~ [p0<=p3] | ~ [sum(p14, p13)<=p5]]]]]

abstracting: (sum(p14, p13)<=p5)
states: 323
abstracting: (p0<=p3)
states: 369
abstracting: (p6<=p9)
states: 476
abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA AirplaneLD-COL-2000-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

totally nodes used: 2546 (2.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1306 7036 8342
used/not used/entry size/cache size: 8289 67100575 16 1024MB
basic ops cache: hits/miss/sum: 507 2119 2626
used/not used/entry size/cache size: 4225 16772991 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 29 29
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 92 296 388
used/not used/entry size/cache size: 296 8388312 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 67106336
1 2510
2 18
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.855sec


BK_STOP 1678677266123

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.000sec


iterations count:145 (7), effective:20 (1)

initing FirstDep: 0m 0.000sec


iterations count:85 (4), effective:15 (0)

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

iterations count:41 (2), effective:6 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AirplaneLD-COL-2000"
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 AirplaneLD-COL-2000, 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 r010-oct2-167813598800225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-2000.tgz
mv AirplaneLD-COL-2000 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 ;