About the Execution of Marcie+red for AirplaneLD-COL-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.644 | 11935.00 | 21862.00 | 103.20 | TTTTFFTTFTTTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813598700202.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-0200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598700202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 11:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 11:27 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 3.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 11:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:30 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 67K 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-0200-CTLFireability-00
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-01
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-02
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-03
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-04
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-05
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-06
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-07
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-08
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-09
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-10
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-11
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-12
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-13
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-14
FORMULA_NAME AirplaneLD-COL-0200-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678676364799
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-0200
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 02:59:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 02:59:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 02:59:28] [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 02:59:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 02:59:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 880 ms
[2023-03-13 02:59:29] [INFO ] Detected 3 constant HL places corresponding to 602 PT places.
[2023-03-13 02:59:29] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 1419 PT places and 2412.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2023-03-13 02:59:29] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 6 ms.
[2023-03-13 02:59:29] [INFO ] Skeletonized 8 HLPN properties in 2 ms. Removed 8 properties that had guard overlaps.
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).
AF dead knowledge conclusive for 4 formulas.
FORMULA AirplaneLD-COL-0200-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0200-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 3 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).
Finished random walk after 158 steps, including 20 resets, run visited all 1 properties in 17 ms. (steps per millisecond=9 )
[2023-03-13 02:59:29] [INFO ] Flatten gal took : 17 ms
[2023-03-13 02:59:29] [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:400) in guard (OR (GEQ $A 199) (EQ $A 399))introduces in Altitude(400) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:400) in guard (AND (LT $A 199) (NEQ $A 399))introduces in Altitude(400) 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 400 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 199) (EQ $A 399)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 199) (NEQ $A 399)) -> (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:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:200) in guard (OR (LEQ $S 99) (EQ $S 199))introduces in Speed(200) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:200) in guard (AND (GT $S 99) (NEQ $S 199))introduces in Speed(200) 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 200 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 99) (NEQ $S 199)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 99) (EQ $S 199)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 99) (NEQ $S 199)) -> (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 02:59:29] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 25 ms.
[2023-03-13 02:59:29] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
[2023-03-13 02:59:29] [INFO ] Reduced 1 identical enabling conditions.
Reduce places removed 6 places and 0 transitions.
Support contains 20 out of 23 places. Attempting structural reductions.
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
Applied a total of 3 rules in 5 ms. Remains 20 /23 variables (removed 3) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-13 02:59:29] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-13 02:59:29] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-13 02:59:29] [INFO ] Invariant cache hit.
[2023-03-13 02:59:29] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-13 02:59:29] [INFO ] Invariant cache hit.
[2023-03-13 02:59:30] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 20/23 places, 20/20 transitions.
Support contains 20 out of 20 places after structural reductions.
[2023-03-13 02:59:30] [INFO ] Flatten gal took : 5 ms
[2023-03-13 02:59:30] [INFO ] Flatten gal took : 5 ms
[2023-03-13 02:59:30] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 32) seen :25
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 240 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 246 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 02:59:30] [INFO ] Invariant cache hit.
[2023-03-13 02:59:30] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 02:59:31] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-13 02:59:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-13 02:59:31] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 8 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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 SI_CTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 17
Applied a total of 2 rules in 6 ms. Remains 17 /20 variables (removed 3) and now considering 17/20 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 17/20 places, 17/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 20/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 19/20 places, 18/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 16/20 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/20 places, 16/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 170 steps, including 25 resets, run visited all 1 properties in 1 ms. (steps per millisecond=170 )
FORMULA AirplaneLD-COL-0200-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/20 places, 18/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 20/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 15 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/20 places, 18/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 20/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/20 places, 18/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Graph (complete) has 18 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 16/20 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/20 places, 16/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 0 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 0 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 53 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
FORMULA AirplaneLD-COL-0200-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/20 places, 18/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 20/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 18
Applied a total of 3 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 18/20 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/20 places, 18/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 20/20 places, 20/20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 02:59:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 02:59:31] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-13 02:59:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 20 transitions and 44 arcs took 0 ms.
Total runtime 3170 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 20 NrTr: 20 NrArc: 44)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.934sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 77 (7.7e+01) #states 484
starting MCC model checker
--------------------------
checking: AF [EG [AX [AF [[p8<=0 | p11<=0]]]]]
normalized: ~ [EG [~ [EG [~ [EX [EG [~ [[p8<=0 | p11<=0]]]]]]]]]
abstracting: (p11<=0)
states: 349
abstracting: (p8<=0)
states: 403
.....
EG iterations: 5
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[AX [p1<=0] | [1<=p6 & 1<=p16]]]
normalized: E [true U [[1<=p6 & 1<=p16] | ~ [EX [~ [p1<=0]]]]]
abstracting: (p1<=0)
states: 325
.abstracting: (1<=p16)
states: 159
abstracting: (1<=p6)
states: 9
-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [E [[1<=p8 & 1<=p11] U AG [~ [EF [~ [[p5<=0 | p19<=0]]]]]] | AG [1<=p4]]
normalized: [~ [E [true U ~ [1<=p4]]] | E [[1<=p8 & 1<=p11] U ~ [E [true U E [true U ~ [[p5<=0 | p19<=0]]]]]]]
abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
abstracting: (1<=p11)
states: 135
abstracting: (1<=p8)
states: 81
abstracting: (1<=p4)
states: 81
-> the formula is FALSE
FORMULA AirplaneLD-COL-0200-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [[1<=p0 | [EF [~ [E [[1<=p7 & 1<=p14] U [1<=p6 & 1<=p17]]]] & p4<=0]]]
normalized: EG [[1<=p0 | [E [true U ~ [E [[1<=p7 & 1<=p14] U [1<=p6 & 1<=p17]]]] & p4<=0]]]
abstracting: (p4<=0)
states: 403
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p0)
states: 161
.
EG iterations: 1
-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: EX [[AX [EX [p3<=0]] | AG [[~ [A [1<=p4 U 1<=p0]] | [[p2<=0 | [p9<=0 | p13<=0]] & AF [p2<=0]]]]]]
normalized: EX [[~ [E [true U ~ [[[~ [EG [~ [p2<=0]]] & [[p9<=0 | p13<=0] | p2<=0]] | ~ [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p4] & ~ [1<=p0]]]]]]]]]] | ~ [EX [~ [EX [p3<=0]]]]]]
abstracting: (p3<=0)
states: 349
..abstracting: (1<=p0)
states: 161
abstracting: (1<=p4)
states: 81
abstracting: (1<=p0)
states: 161
abstracting: (1<=p0)
states: 161
.
EG iterations: 1
abstracting: (p2<=0)
states: 331
abstracting: (p13<=0)
states: 403
abstracting: (p9<=0)
states: 241
abstracting: (p2<=0)
states: 331
........
EG iterations: 8
.-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [EG [[AX [[p9<=0 | p12<=0]] | [AX [p3<=0] & ~ [A [[1<=p6 & 1<=p17] U ~ [[p5<=0 | p19<=0]]]]]]]]
normalized: E [true U EG [[[~ [[~ [EG [[p5<=0 | p19<=0]]] & ~ [E [[p5<=0 | p19<=0] U [~ [[1<=p6 & 1<=p17]] & [p5<=0 | p19<=0]]]]]] & ~ [EX [~ [p3<=0]]]] | ~ [EX [~ [[p9<=0 | p12<=0]]]]]]]
abstracting: (p12<=0)
states: 403
abstracting: (p9<=0)
states: 241
.abstracting: (p3<=0)
states: 349
.abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
.....
EG iterations: 5
.
EG iterations: 1
-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [[AF [[1<=p7 & 1<=p14]] & EF [[1<=p1 | [E [[1<=p7 & 1<=p14] U [1<=p7 & 1<=p14]] & 1<=p3]]]]]
normalized: EX [[E [true U [[E [[1<=p7 & 1<=p14] U [1<=p7 & 1<=p14]] & 1<=p3] | 1<=p1]] & ~ [EG [~ [[1<=p7 & 1<=p14]]]]]]
abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
.....
EG iterations: 5
abstracting: (1<=p1)
states: 159
abstracting: (1<=p3)
states: 135
abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
.-> the formula is FALSE
FORMULA AirplaneLD-COL-0200-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [AG [[[~ [A [[1<=p6 & 1<=p17] U [1<=p7 & 1<=p15]]] | EX [1<=p0]] | [p3<=0 | [p1<=0 | [AG [[p5<=0 | p19<=0]] & [p7<=0 | p15<=0]]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[[p7<=0 | p15<=0] & ~ [E [true U ~ [[p5<=0 | p19<=0]]]]] | p1<=0] | p3<=0] | [EX [1<=p0] | ~ [[~ [EG [~ [[1<=p7 & 1<=p15]]]] & ~ [E [~ [[1<=p7 & 1<=p15]] U [~ [[1<=p6 & 1<=p17]] & ~ [[1<=p7 & 1<=p15]]]]]]]]]]]]]
abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
.....
EG iterations: 5
abstracting: (1<=p0)
states: 161
.abstracting: (p3<=0)
states: 349
abstracting: (p1<=0)
states: 325
abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
abstracting: (p15<=0)
states: 331
abstracting: (p7<=0)
states: 457
.
EG iterations: 1
-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [~ [E [AF [[AX [[1<=p9 & 1<=p12]] & [1<=p6 & 1<=p17]]] U ~ [EF [[[1<=p9 & 1<=p12] | [1<=p8 & 1<=p11]]]]]] & EX [[AF [AG [p0<=0]] & [A [1<=p4 U [1<=p9 & 1<=p13]] | EF [[1<=p8 & 1<=p10]]]]]]
normalized: [EX [[[E [true U [1<=p8 & 1<=p10]] | [~ [EG [~ [[1<=p9 & 1<=p13]]]] & ~ [E [~ [[1<=p9 & 1<=p13]] U [~ [1<=p4] & ~ [[1<=p9 & 1<=p13]]]]]]] & ~ [EG [E [true U ~ [p0<=0]]]]]] & ~ [E [~ [EG [~ [[[1<=p6 & 1<=p17] & ~ [EX [~ [[1<=p9 & 1<=p12]]]]]]]] U ~ [E [true U [[1<=p8 & 1<=p11] | [1<=p9 & 1<=p12]]]]]]]
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p11)
states: 135
abstracting: (1<=p8)
states: 81
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
.abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
EG iterations: 0
abstracting: (p0<=0)
states: 323
..........
EG iterations: 10
abstracting: (1<=p13)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p4)
states: 81
abstracting: (1<=p13)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p13)
states: 81
abstracting: (1<=p9)
states: 243
.
EG iterations: 1
abstracting: (1<=p10)
states: 135
abstracting: (1<=p8)
states: 81
.-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: A [[~ [[~ [EG [[1<=p5 & 1<=p18]]] & AX [EG [[1<=p5 & 1<=p18]]]]] | EF [1<=p3]] U E [~ [AF [1<=p2]] U E [[AX [~ [[p5<=0 | p19<=0]]] | [E [1<=p0 U [1<=p9 & 1<=p12]] | AF [[1<=p9 & 1<=p12]]]] U EF [EX [[1<=p6 & 1<=p17]]]]]]
normalized: [~ [EG [~ [E [EG [~ [1<=p2]] U E [[[~ [EG [~ [[1<=p9 & 1<=p12]]]] | E [1<=p0 U [1<=p9 & 1<=p12]]] | ~ [EX [[p5<=0 | p19<=0]]]] U E [true U EX [[1<=p6 & 1<=p17]]]]]]]] & ~ [E [~ [E [EG [~ [1<=p2]] U E [[[~ [EG [~ [[1<=p9 & 1<=p12]]]] | E [1<=p0 U [1<=p9 & 1<=p12]]] | ~ [EX [[p5<=0 | p19<=0]]]] U E [true U EX [[1<=p6 & 1<=p17]]]]]] U [~ [E [EG [~ [1<=p2]] U E [[[~ [EG [~ [[1<=p9 & 1<=p12]]]] | E [1<=p0 U [1<=p9 & 1<=p12]]] | ~ [EX [[p5<=0 | p19<=0]]]] U E [true U EX [[1<=p6 & 1<=p17]]]]]] & ~ [[E [true U 1<=p3] | ~ [[~ [EX [~ [EG [[1<=p5 & 1<=p18]]]]] & ~ [EG [[1<=p5 & 1<=p18]]]]]]]]]]]
abstracting: (1<=p18)
states: 161
abstracting: (1<=p5)
states: 3
..
EG iterations: 2
abstracting: (1<=p18)
states: 161
abstracting: (1<=p5)
states: 3
..
EG iterations: 2
.abstracting: (1<=p3)
states: 135
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
.abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
.abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p0)
states: 161
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
.
EG iterations: 1
abstracting: (1<=p2)
states: 153
.
EG iterations: 1
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
.abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
.abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p0)
states: 161
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
.
EG iterations: 1
abstracting: (1<=p2)
states: 153
.
EG iterations: 1
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
.abstracting: (p19<=0)
states: 323
abstracting: (p5<=0)
states: 481
.abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p0)
states: 161
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
.
EG iterations: 1
abstracting: (1<=p2)
states: 153
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA AirplaneLD-COL-0200-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [AF [EG [[E [1<=p4 U [1<=p6 & 1<=p16]] | [AX [[1<=p8 & 1<=p10]] & A [1<=p1 U [1<=p8 & 1<=p10]]]]]] & [A [[EX [[1<=p0 & [1<=p7 & 1<=p15]]] & [1<=p7 & 1<=p15]] U EF [~ [[1<=p8 & [1<=p10 & 1<=p2]]]]] & EF [p2<=0]]]
normalized: [[E [true U p2<=0] & [~ [EG [~ [E [true U ~ [[[1<=p10 & 1<=p2] & 1<=p8]]]]]] & ~ [E [~ [E [true U ~ [[[1<=p10 & 1<=p2] & 1<=p8]]]] U [~ [[[1<=p7 & 1<=p15] & EX [[[1<=p7 & 1<=p15] & 1<=p0]]]] & ~ [E [true U ~ [[[1<=p10 & 1<=p2] & 1<=p8]]]]]]]]] & ~ [EG [~ [EG [[[[~ [EG [~ [[1<=p8 & 1<=p10]]]] & ~ [E [~ [[1<=p8 & 1<=p10]] U [~ [1<=p1] & ~ [[1<=p8 & 1<=p10]]]]]] & ~ [EX [~ [[1<=p8 & 1<=p10]]]]] | E [1<=p4 U [1<=p6 & 1<=p16]]]]]]]]
abstracting: (1<=p16)
states: 159
abstracting: (1<=p6)
states: 9
abstracting: (1<=p4)
states: 81
abstracting: (1<=p10)
states: 135
abstracting: (1<=p8)
states: 81
.abstracting: (1<=p10)
states: 135
abstracting: (1<=p8)
states: 81
abstracting: (1<=p1)
states: 159
abstracting: (1<=p10)
states: 135
abstracting: (1<=p8)
states: 81
abstracting: (1<=p10)
states: 135
abstracting: (1<=p8)
states: 81
.....
EG iterations: 5
...
EG iterations: 3
EG iterations: 0
abstracting: (1<=p8)
states: 81
abstracting: (1<=p2)
states: 153
abstracting: (1<=p10)
states: 135
abstracting: (1<=p0)
states: 161
abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
.abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p8)
states: 81
abstracting: (1<=p2)
states: 153
abstracting: (1<=p10)
states: 135
abstracting: (1<=p8)
states: 81
abstracting: (1<=p2)
states: 153
abstracting: (1<=p10)
states: 135
.
EG iterations: 1
abstracting: (p2<=0)
states: 331
-> the formula is FALSE
FORMULA AirplaneLD-COL-0200-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [[A [[[[1<=p6 & 1<=p17] | EX [[1<=p6 & 1<=p17]]] & 1<=p3] U [1<=p7 & 1<=p14]] | [AF [[AF [[p5<=0 | p18<=0]] & E [[1<=p7 & 1<=p14] U [1<=p9 & 1<=p12]]]] | ~ [A [E [[[1<=p6 & 1<=p16] | 1<=p3] U ~ [[1<=p9 & 1<=p12]]] U [E [[1<=p7 & 1<=p15] U [1<=p9 & 1<=p13]] & ~ [[1<=p9 & 1<=p12]]]]]]]]
normalized: ~ [EX [~ [[[~ [[~ [EG [~ [[~ [[1<=p9 & 1<=p12]] & E [[1<=p7 & 1<=p15] U [1<=p9 & 1<=p13]]]]]] & ~ [E [~ [[~ [[1<=p9 & 1<=p12]] & E [[1<=p7 & 1<=p15] U [1<=p9 & 1<=p13]]]] U [~ [E [[[1<=p6 & 1<=p16] | 1<=p3] U ~ [[1<=p9 & 1<=p12]]]] & ~ [[~ [[1<=p9 & 1<=p12]] & E [[1<=p7 & 1<=p15] U [1<=p9 & 1<=p13]]]]]]]]] | ~ [EG [~ [[E [[1<=p7 & 1<=p14] U [1<=p9 & 1<=p12]] & ~ [EG [~ [[p5<=0 | p18<=0]]]]]]]]] | [~ [EG [~ [[1<=p7 & 1<=p14]]]] & ~ [E [~ [[1<=p7 & 1<=p14]] U [~ [[[EX [[1<=p6 & 1<=p17]] | [1<=p6 & 1<=p17]] & 1<=p3]] & ~ [[1<=p7 & 1<=p14]]]]]]]]]]
abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p3)
states: 135
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
abstracting: (1<=p17)
states: 159
abstracting: (1<=p6)
states: 9
.abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
.....
EG iterations: 5
abstracting: (p18<=0)
states: 323
abstracting: (p5<=0)
states: 481
..
EG iterations: 2
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p14)
states: 153
abstracting: (1<=p7)
states: 27
.
EG iterations: 1
abstracting: (1<=p13)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p3)
states: 135
abstracting: (1<=p16)
states: 159
abstracting: (1<=p6)
states: 9
abstracting: (1<=p13)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p13)
states: 81
abstracting: (1<=p9)
states: 243
abstracting: (1<=p15)
states: 153
abstracting: (1<=p7)
states: 27
abstracting: (1<=p12)
states: 81
abstracting: (1<=p9)
states: 243
.
EG iterations: 1
.-> the formula is FALSE
FORMULA AirplaneLD-COL-0200-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 15799 (1.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8582 29975 38557
used/not used/entry size/cache size: 39269 67069595 16 1024MB
basic ops cache: hits/miss/sum: 3468 10000 13468
used/not used/entry size/cache size: 17628 16759588 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 478 958 1436
used/not used/entry size/cache size: 958 8387650 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 67093350
1 15235
2 274
3 4
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.800sec
BK_STOP 1678676376734
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:127 (6), effective:19 (0)
initing FirstDep: 0m 0.000sec
iterations count:22 (1), effective:2 (0)
iterations count:68 (3), effective:9 (0)
iterations count:20 (1), effective:0 (0)
iterations count:25 (1), effective:3 (0)
iterations count:21 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:38 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:38 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:38 (1), effective:1 (0)
iterations count:68 (3), effective:9 (0)
iterations count:31 (1), effective:3 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:22 (1), effective:1 (0)
iterations count:31 (1), effective:3 (0)
iterations count:20 (1), effective:0 (0)
iterations count:40 (2), effective:6 (0)
iterations count:22 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:40 (2), effective:6 (0)
iterations count:22 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:138 (6), effective:18 (0)
iterations count:40 (2), effective:6 (0)
iterations count:22 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:21 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:21 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (0)
iterations count:28 (1), effective:1 (0)
iterations count:20 (1), effective:0 (0)
iterations count:23 (1), effective:2 (0)
iterations count:20 (1), effective:0 (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-0200"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is AirplaneLD-COL-0200, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813598700202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0200.tgz
mv AirplaneLD-COL-0200 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;