About the Execution of Marcie+red for GPPP-PT-C1000N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10840.415 | 98418.00 | 102421.00 | 1209.50 | TTFTFFTTTFTFTFFF | 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.r170-tall-167838857900882.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is GPPP-PT-C1000N0000000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857900882
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 10:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 26 10:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000000010-CTLFireability-00
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-01
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-02
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-03
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-04
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-05
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-06
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-07
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-08
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-09
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-10
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-11
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-12
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-13
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-14
FORMULA_NAME GPPP-PT-C1000N0000000010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678646646894
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=GPPP-PT-C1000N0000000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 18:44:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:44:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:44:08] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-12 18:44:08] [INFO ] Transformed 33 places.
[2023-03-12 18:44:08] [INFO ] Transformed 22 transitions.
[2023-03-12 18:44:08] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:08] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-12 18:44:08] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:08] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 18:44:08] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:08] [INFO ] Invariants computation overflowed in 3 ms
[2023-03-12 18:44:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:08] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:08] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 15 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 32) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-12 18:44:09] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 18:44:09] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 4 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 3 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 3 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 30 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 28 transition count 19
Applied a total of 8 rules in 12 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 28 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 28/33 places, 19/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 3 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 3 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 3 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:09] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 29 transition count 20
Applied a total of 6 rules in 3 ms. Remains 29 /33 variables (removed 4) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 29 cols
[2023-03-12 18:44:09] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 18:44:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 29/33 places, 20/22 transitions.
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:09] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:10] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:10] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 18:44:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:10] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 8 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 18:44:10] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:10] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 24/33 places, 15/22 transitions.
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:10] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:10] [INFO ] Invariants computation overflowed in 1 ms
[2023-03-12 18:44:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:10] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:10] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 18:44:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:10] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 18:44:10] [INFO ] Invariants computation overflowed in 0 ms
[2023-03-12 18:44:10] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:10] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 2 ms
[2023-03-12 18:44:10] [INFO ] Flatten gal took : 1 ms
[2023-03-12 18:44:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-12 18:44:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 0 ms.
Total runtime 1971 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: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.719sec
RS generation: 0m 0.118sec
-> reachability set: #nodes 19855 (2.0e+04) #states 14,184,612,091 (10)
starting MCC model checker
--------------------------
checking: AG [EX [EF [1<=p20]]]
normalized: ~ [E [true U ~ [EX [E [true U 1<=p20]]]]]
abstracting: (1<=p20)
states: 6,495,048,153 (9)
.-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.129sec
checking: EX [EX [AG [p24<=0]]]
normalized: EX [EX [~ [E [true U ~ [p24<=0]]]]]
abstracting: (p24<=0)
states: 14,184,612,090 (10)
..-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.068sec
checking: AF [[1<=p12 | EX [1<=p21]]]
normalized: ~ [EG [~ [[1<=p12 | EX [1<=p21]]]]]
abstracting: (1<=p21)
states: 6,495,048,153 (9)
.abstracting: (1<=p12)
states: 6,027,723,840 (9)
.....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 341
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.070sec
checking: EF [AX [~ [A [1<=p17 U ~ [EG [1<=p20]]]]]]
normalized: E [true U ~ [EX [[~ [EG [EG [1<=p20]]] & ~ [E [EG [1<=p20] U [~ [1<=p17] & EG [1<=p20]]]]]]]]
abstracting: (1<=p20)
states: 6,495,048,153 (9)
..............................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 366
abstracting: (1<=p17)
states: 6,027,723,840 (9)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
..............................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 366
abstracting: (1<=p20)
states: 6,495,048,153 (9)
..............................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 366
.
EG iterations: 1
.-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.114sec
checking: AF [[1<=p9 & 1<=p13]]
normalized: ~ [EG [~ [[1<=p9 & 1<=p13]]]]
abstracting: (1<=p13)
states: 942,157,236 (8)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
................................................................................................................................................................................................................................................................................................
EG iterations: 288
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.186sec
checking: A [[1<=p18 & 1<=p19] U EF [~ [E [AF [1<=p12] U [[[1<=p8 & 2000<=p29] | 1<=p17] | [1<=p20 | [1<=p9 & 1<=p10]]]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [~ [EG [~ [1<=p12]]] U [[1<=p20 | [1<=p9 & 1<=p10]] | [1<=p17 | [1<=p8 & 2000<=p29]]]]]]]]] & ~ [E [~ [E [true U ~ [E [~ [EG [~ [1<=p12]]] U [[1<=p20 | [1<=p9 & 1<=p10]] | [1<=p17 | [1<=p8 & 2000<=p29]]]]]]] U [~ [E [true U ~ [E [~ [EG [~ [1<=p12]]] U [[1<=p20 | [1<=p9 & 1<=p10]] | [1<=p17 | [1<=p8 & 2000<=p29]]]]]]] & ~ [[1<=p18 & 1<=p19]]]]]]
abstracting: (1<=p19)
states: 14,184,612,090 (10)
abstracting: (1<=p18)
states: 6,013,612,704 (9)
abstracting: (2000<=p29)
states: 596,317 (5)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
abstracting: (1<=p17)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 10,386,285 (7)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
.......................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 359
abstracting: (2000<=p29)
states: 596,317 (5)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
abstracting: (1<=p17)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 10,386,285 (7)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
.......................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 359
abstracting: (2000<=p29)
states: 596,317 (5)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
abstracting: (1<=p17)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 10,386,285 (7)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
.......................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 359
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.571sec
checking: E [EG [[EX [[[[1<=p5 & 1<=p6] & [1<=p8 & 2000<=p29]] | AX [1<=0]]] | ~ [[1<=p18 & 1<=p19]]]] U ~ [AG [AX [[1<=p11 & [1<=p12 & 7000<=p31]]]]]]
normalized: E [EG [[~ [[1<=p18 & 1<=p19]] | EX [[~ [EX [~ [1<=0]]] | [[1<=p8 & 2000<=p29] & [1<=p5 & 1<=p6]]]]]] U E [true U EX [~ [[1<=p11 & [1<=p12 & 7000<=p31]]]]]]
abstracting: (7000<=p31)
states: 26,713,066 (7)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
abstracting: (1<=p11)
states: 15,730,464 (7)
.abstracting: (1<=p6)
states: 12,955,699,758 (10)
abstracting: (1<=p5)
states: 13,466,675,506 (10)
abstracting: (2000<=p29)
states: 596,317 (5)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
abstracting: (1<=0)
states: 0
..abstracting: (1<=p19)
states: 14,184,612,090 (10)
abstracting: (1<=p18)
states: 6,013,612,704 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.302sec
checking: [EF [~ [A [[EG [1<=p20] & [[[1<=p8 & 2000<=p29] | [1<=p15 & 3000<=p27]] & AF [[1<=p9 & 1<=p13]]]] U 1<=p21]]] & AX [[1<=p23 & 1<=p3]]]
normalized: [E [true U ~ [[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [[[~ [EG [~ [[1<=p9 & 1<=p13]]]] & [[1<=p15 & 3000<=p27] | [1<=p8 & 2000<=p29]]] & EG [1<=p20]]] & ~ [1<=p21]]]]]]] & ~ [EX [~ [[1<=p23 & 1<=p3]]]]]
abstracting: (1<=p3)
states: 13,838,382,921 (10)
abstracting: (1<=p23)
states: 7,001,206,377 (9)
.abstracting: (1<=p21)
states: 6,495,048,153 (9)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
..............................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 366
abstracting: (2000<=p29)
states: 596,317 (5)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
abstracting: (3000<=p27)
states: 42
abstracting: (1<=p15)
states: 13,128,134,451 (10)
abstracting: (1<=p13)
states: 942,157,236 (8)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
................................................................................................................................................................................................................................................................................................
EG iterations: 288
abstracting: (1<=p21)
states: 6,495,048,153 (9)
abstracting: (1<=p21)
states: 6,495,048,153 (9)
.............................................................................................................................................................................................................................................................................................................................................................
EG iterations: 349
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.411sec
checking: AG [[AG [A [EG [[2<=p4 & [1<=p15 & 1<=p28]]] U EF [[1<=p11 & [1<=p12 & 7000<=p31]]]]] | AG [[[1<=p8 & 2000<=p29] | AX [AF [[2<=p4 & [1<=p15 & 1<=p28]]]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[~ [EX [EG [~ [[2<=p4 & [1<=p15 & 1<=p28]]]]]] | [1<=p8 & 2000<=p29]]]]] | ~ [E [true U ~ [[~ [EG [~ [E [true U [1<=p11 & [1<=p12 & 7000<=p31]]]]]] & ~ [E [~ [E [true U [1<=p11 & [1<=p12 & 7000<=p31]]]] U [~ [EG [[2<=p4 & [1<=p15 & 1<=p28]]]] & ~ [E [true U [1<=p11 & [1<=p12 & 7000<=p31]]]]]]]]]]]]]]]
abstracting: (7000<=p31)
states: 26,713,066 (7)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
abstracting: (1<=p11)
states: 15,730,464 (7)
abstracting: (1<=p28)
states: 14,184,612,049 (10)
abstracting: (1<=p15)
states: 13,128,134,451 (10)
abstracting: (2<=p4)
states: 12,967,632,465 (10)
...................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 371
abstracting: (7000<=p31)
states: 26,713,066 (7)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
abstracting: (1<=p11)
states: 15,730,464 (7)
abstracting: (7000<=p31)
states: 26,713,066 (7)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
abstracting: (1<=p11)
states: 15,730,464 (7)
.
EG iterations: 1
abstracting: (2000<=p29)
states: 596,317 (5)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
abstracting: (1<=p28)
states: 14,184,612,049 (10)
abstracting: (1<=p15)
states: 13,128,134,451 (10)
abstracting: (2<=p4)
states: 12,967,632,465 (10)
........................................................................................................................
EG iterations: 120
.-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18.241sec
checking: AF [E [EF [[AX [1<=p20] | [1<=p8 & 1<=p30]]] U [[EX [1<=p24] & EX [~ [[[1<=p15 & 3000<=p27] | [2<=p4 & [1<=p15 & 1<=p28]]]]]] & [1<=p18 & 1<=p19]]]]
normalized: ~ [EG [~ [E [E [true U [[1<=p8 & 1<=p30] | ~ [EX [~ [1<=p20]]]]] U [[EX [~ [[[2<=p4 & [1<=p15 & 1<=p28]] | [1<=p15 & 3000<=p27]]]] & EX [1<=p24]] & [1<=p18 & 1<=p19]]]]]]
abstracting: (1<=p19)
states: 14,184,612,090 (10)
abstracting: (1<=p18)
states: 6,013,612,704 (9)
abstracting: (1<=p24)
states: 1
.abstracting: (3000<=p27)
states: 42
abstracting: (1<=p15)
states: 13,128,134,451 (10)
abstracting: (1<=p28)
states: 14,184,612,049 (10)
abstracting: (1<=p15)
states: 13,128,134,451 (10)
abstracting: (2<=p4)
states: 12,967,632,465 (10)
.abstracting: (1<=p20)
states: 6,495,048,153 (9)
.abstracting: (1<=p30)
states: 14,184,015,774 (10)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
EG iterations: 0
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.431sec
checking: E [EX [[~ [[AG [1<=p17] & ~ [A [[1<=p15 & 3000<=p27] U [1<=p1 & 1<=p26]]]]] | 1<=p21]] U EG [[[EG [~ [[[7000<=p1 & 7000<=p25] | 2<=p7]]] & EX [[1<=p12 | 2<=p7]]] & [AG [[1<=p5 & 1<=p6]] & ~ [EF [1<=p20]]]]]]
normalized: E [EX [[1<=p21 | ~ [[~ [[~ [EG [~ [[1<=p1 & 1<=p26]]]] & ~ [E [~ [[1<=p1 & 1<=p26]] U [~ [[1<=p15 & 3000<=p27]] & ~ [[1<=p1 & 1<=p26]]]]]]] & ~ [E [true U ~ [1<=p17]]]]]]] U EG [[[~ [E [true U 1<=p20]] & ~ [E [true U ~ [[1<=p5 & 1<=p6]]]]] & [EX [[1<=p12 | 2<=p7]] & EG [~ [[2<=p7 | [7000<=p1 & 7000<=p25]]]]]]]]
abstracting: (7000<=p25)
states: 0
abstracting: (7000<=p1)
states: 0
abstracting: (2<=p7)
states: 12,846,993,996 (10)
........................................................................................................
EG iterations: 104
abstracting: (2<=p7)
states: 12,846,993,996 (10)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
.abstracting: (1<=p6)
states: 12,955,699,758 (10)
abstracting: (1<=p5)
states: 13,466,675,506 (10)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
.
EG iterations: 1
abstracting: (1<=p17)
states: 6,027,723,840 (9)
abstracting: (1<=p26)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (3000<=p27)
states: 42
abstracting: (1<=p15)
states: 13,128,134,451 (10)
abstracting: (1<=p26)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p26)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
..........................................................................................................................................................................................................................................................................................................
EG iterations: 298
abstracting: (1<=p21)
states: 6,495,048,153 (9)
.-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.968sec
checking: E [AG [[~ [[1<=p11 & [1<=p12 & 7000<=p31]]] & [1<=p12 & [AG [[1<=p19 & 1<=p22]] | [EF [[1<=p9 & 1<=p10]] | [A [[1<=p9 & 1<=p10] U 1<=p21] & AG [[1<=p3 & 1<=p23]]]]]]]] U ~ [AG [EF [EG [1<=p12]]]]]
normalized: E [~ [E [true U ~ [[[1<=p12 & [[[~ [E [true U ~ [[1<=p3 & 1<=p23]]]] & [~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [[1<=p9 & 1<=p10]] & ~ [1<=p21]]]]]] | E [true U [1<=p9 & 1<=p10]]] | ~ [E [true U ~ [[1<=p19 & 1<=p22]]]]]] & ~ [[1<=p11 & [1<=p12 & 7000<=p31]]]]]]] U E [true U ~ [E [true U EG [1<=p12]]]]]
abstracting: (1<=p12)
states: 6,027,723,840 (9)
.......................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 359
abstracting: (7000<=p31)
states: 26,713,066 (7)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
abstracting: (1<=p11)
states: 15,730,464 (7)
abstracting: (1<=p22)
states: 6,495,048,153 (9)
abstracting: (1<=p19)
states: 14,184,612,090 (10)
abstracting: (1<=p10)
states: 10,386,285 (7)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
abstracting: (1<=p21)
states: 6,495,048,153 (9)
abstracting: (1<=p10)
states: 10,386,285 (7)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
abstracting: (1<=p21)
states: 6,495,048,153 (9)
abstracting: (1<=p21)
states: 6,495,048,153 (9)
.............................................................................................................................................................................................................................................................................................................................................................
EG iterations: 349
abstracting: (1<=p23)
states: 7,001,206,377 (9)
abstracting: (1<=p3)
states: 13,838,382,921 (10)
abstracting: (1<=p12)
states: 6,027,723,840 (9)
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.139sec
checking: AG [[[[1<=p11 & 1<=p12] & [7000<=p31 & [p1<=0 | p14<=0]]] | [AX [[1<=p3 & 1<=p23]] & [~ [A [[1<=p1 & 1<=p14] U 2<=p7]] | EF [~ [E [[1<=p8 & 2000<=p29] U [1<=p9 & 1<=p13]]]]]]]]
normalized: ~ [E [true U ~ [[[[E [true U ~ [E [[1<=p8 & 2000<=p29] U [1<=p9 & 1<=p13]]]] | ~ [[~ [EG [~ [2<=p7]]] & ~ [E [~ [2<=p7] U [~ [[1<=p1 & 1<=p14]] & ~ [2<=p7]]]]]]] & ~ [EX [~ [[1<=p3 & 1<=p23]]]]] | [[7000<=p31 & [p1<=0 | p14<=0]] & [1<=p11 & 1<=p12]]]]]]
abstracting: (1<=p12)
states: 6,027,723,840 (9)
abstracting: (1<=p11)
states: 15,730,464 (7)
abstracting: (p14<=0)
states: 11,629,501,356 (10)
abstracting: (p1<=0)
states: 1,056,477,639 (9)
abstracting: (7000<=p31)
states: 26,713,066 (7)
abstracting: (1<=p23)
states: 7,001,206,377 (9)
abstracting: (1<=p3)
states: 13,838,382,921 (10)
.abstracting: (2<=p7)
states: 12,846,993,996 (10)
abstracting: (1<=p14)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (2<=p7)
states: 12,846,993,996 (10)
abstracting: (2<=p7)
states: 12,846,993,996 (10)
........................................................................................................
EG iterations: 104
abstracting: (1<=p13)
states: 942,157,236 (8)
abstracting: (1<=p9)
states: 13,342,003,323 (10)
abstracting: (2000<=p29)
states: 596,317 (5)
abstracting: (1<=p8)
states: 13,342,599,402 (10)
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.936sec
totally nodes used: 47243713 (4.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 134499530 89084139 223583669
used/not used/entry size/cache size: 56472944 10635920 16 1024MB
basic ops cache: hits/miss/sum: 33283290 17879013 51162303
used/not used/entry size/cache size: 14536914 2240302 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: 341553 190883 532436
used/not used/entry size/cache size: 188810 8199798 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 34530992
1 22514448
2 7671446
3 1866950
4 383847
5 79748
6 20748
7 6957
8 3189
9 2227
>= 10 28312
Total processing time: 1m34.008sec
BK_STOP 1678646745312
--------------------
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 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:1727 (78), effective:414 (18)
initing FirstDep: 0m 0.000sec
iterations count:186 (8), effective:28 (1)
iterations count:559 (25), effective:117 (5)
iterations count:22 (1), effective:0 (0)
iterations count:46 (2), effective:6 (0)
iterations count:1768 (80), effective:430 (19)
iterations count:131 (5), effective:19 (0)
iterations count:240 (10), effective:42 (1)
iterations count:131 (5), effective:19 (0)
iterations count:240 (10), effective:42 (1)
iterations count:131 (5), effective:19 (0)
iterations count:240 (10), effective:42 (1)
iterations count:37 (1), effective:3 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:36 (1), effective:7 (0)
iterations count:106 (4), effective:13 (0)
iterations count:106 (4), effective:13 (0)
iterations count:427 (19), effective:87 (3)
iterations count:106 (4), effective:13 (0)
iterations count:109 (4), effective:14 (0)
iterations count:1379 (62), effective:288 (13)
iterations count:22 (1), effective:0 (0)
iterations count:337 (15), effective:101 (4)
iterations count:42 (1), effective:10 (0)
iterations count:186 (8), effective:28 (1)
iterations count:50 (2), effective:7 (0)
iterations count:34 (1), effective:1 (0)
iterations count:162 (7), effective:23 (1)
iterations count:512 (23), effective:101 (4)
iterations count:50 (2), effective:7 (0)
iterations count:85 (3), effective:9 (0)
iterations count:29 (1), effective:1 (0)
iterations count:29 (1), effective:7 (0)
iterations count:32 (1), effective:2 (0)
iterations count:22 (1), effective:0 (0)
iterations count:242 (11), effective:44 (2)
iterations count:22 (1), effective:0 (0)
iterations count:29 (1), effective:1 (0)
iterations count:35 (1), effective:8 (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="GPPP-PT-C1000N0000000010"
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 GPPP-PT-C1000N0000000010, 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 r170-tall-167838857900882"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000010.tgz
mv GPPP-PT-C1000N0000000010 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 ;