About the Execution of Marcie+red for JoinFreeModules-PT-0003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5448.584 | 8815.00 | 12866.00 | 343.00 | FFTFTFTTTTTTTFFT | 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.r234-tall-167856419900138.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 JoinFreeModules-PT-0003, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419900138
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.4K 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 JoinFreeModules-PT-0003-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0003-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679451865957
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=JoinFreeModules-PT-0003
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:24:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:24:27] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-22 02:24:27] [INFO ] Transformed 16 places.
[2023-03-22 02:24:27] [INFO ] Transformed 25 transitions.
[2023-03-22 02:24:27] [INFO ] Parsed PT model containing 16 places and 25 transitions and 71 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Reduce places removed 1 places and 0 transitions.
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 8 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2023-03-22 02:24:27] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-22 02:24:27] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
[2023-03-22 02:24:27] [INFO ] Invariant cache hit.
[2023-03-22 02:24:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 02:24:27] [INFO ] Invariant cache hit.
[2023-03-22 02:24:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 02:24:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 02:24:27] [INFO ] Invariant cache hit.
[2023-03-22 02:24:27] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 15/15 places, 25/25 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 16 ms
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:24:28] [INFO ] Input system was already deterministic with 25 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 38) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 02:24:28] [INFO ] Invariant cache hit.
[2023-03-22 02:24:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 02:24:28] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-22 02:24:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 02:24:28] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-22 02:24:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 02:24:28] [INFO ] After 3ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-22 02:24:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 02:24:28] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 25/25 transitions.
Graph (complete) has 36 edges and 15 vertex of which 5 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 5 ms. Remains 5 /15 variables (removed 10) and now considering 8/25 (removed 17) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 02:24:28] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 02:24:28] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 5/15 places, 8/25 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 33 states, properties seen :0
Probabilistic random walk after 102 steps, saw 33 distinct states, run finished after 14 ms. (steps per millisecond=7 ) properties seen :0
Explored full state space saw : 33 states, properties seen :0
Exhaustive walk after 102 steps, saw 33 distinct states, run finished after 1 ms. (steps per millisecond=102 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-22 02:24:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:24:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA JoinFreeModules-PT-0003-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0003-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:24:28] [INFO ] Input system was already deterministic with 25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 15 cols
[2023-03-22 02:24:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 02:24:28] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:28] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:28] [INFO ] Invariant cache hit.
[2023-03-22 02:24:28] [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 : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:28] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:28] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:28] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [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 28 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 02:24:29] [INFO ] Invariant cache hit.
[2023-03-22 02:24:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 15/15 places, 25/25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Input system was already deterministic with 25 transitions.
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:24:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:24:29] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 02:24:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 25 transitions and 69 arcs took 1 ms.
Total runtime 2240 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: 15 NrTr: 25 NrArc: 69)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.724sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 55 (5.5e+01) #states 35,937 (4)
starting MCC model checker
--------------------------
checking: EF [AG [p12<=0]]
normalized: E [true U ~ [E [true U ~ [p12<=0]]]]
abstracting: (p12<=0)
states: 15,246 (4)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [3<=p0]
normalized: EX [3<=p0]
abstracting: (3<=p0)
states: 13,068 (4)
.-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [EG [p13<=3]]
normalized: EX [EG [p13<=3]]
abstracting: (p13<=3)
states: 32,670 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [A [AF [p3<=3] U 5<=p9]]
normalized: ~ [[~ [EG [~ [5<=p9]]] & ~ [E [~ [5<=p9] U [EG [~ [p3<=3]] & ~ [5<=p9]]]]]]
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (p3<=3)
states: 32,670 (4)
.
EG iterations: 1
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (5<=p9)
states: 3,267 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EG [[EX [AF [EX [p13<=3]]] | [EG [p5<=4] & EX [p3<=3]]]]
normalized: EG [[EX [~ [EG [~ [EX [p13<=3]]]]] | [EX [p3<=3] & EG [p5<=4]]]]
abstracting: (p5<=4)
states: 33,759 (4)
.
EG iterations: 1
abstracting: (p3<=3)
states: 32,670 (4)
.abstracting: (p13<=3)
states: 32,670 (4)
..
EG iterations: 1
.
EG iterations: 0
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AX [[EG [p11<=1] & [AG [EF [1<=p7]] | [AG [AX [p8<=2]] | [p11<=1 & p10<=4]]]]]
normalized: ~ [EX [~ [[[[[p11<=1 & p10<=4] | ~ [E [true U EX [~ [p8<=2]]]]] | ~ [E [true U ~ [E [true U 1<=p7]]]]] & EG [p11<=1]]]]]
abstracting: (p11<=1)
states: 25,047 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 20,691 (4)
abstracting: (p8<=2)
states: 22,869 (4)
.abstracting: (p10<=4)
states: 33,759 (4)
abstracting: (p11<=1)
states: 25,047 (4)
.-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [[[EF [p9<=4] | EG [[4<=p3 & EF [2<=p1]]]] & [EG [EF [p12<=0]] | [p8<=2 & EX [p2<=1]]]]]
normalized: EG [[[EG [[E [true U 2<=p1] & 4<=p3]] | E [true U p9<=4]] & [[EX [p2<=1] & p8<=2] | EG [E [true U p12<=0]]]]]
abstracting: (p12<=0)
states: 15,246 (4)
EG iterations: 0
abstracting: (p8<=2)
states: 22,869 (4)
abstracting: (p2<=1)
states: 27,225 (4)
.abstracting: (p9<=4)
states: 32,670 (4)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (2<=p1)
states: 10,890 (4)
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [~ [A [[EG [AF [2<=p12]] | ~ [E [4<=p3 U 3<=p10]]] U A [[5<=p0 & 2<=p7] U A [4<=p8 U 5<=p4]]]]]
normalized: EG [~ [[~ [EG [~ [[~ [E [~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]] U [~ [[5<=p0 & 2<=p7]] & ~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]]]]]]]] & ~ [E [~ [[~ [E [~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]] U [~ [[5<=p0 & 2<=p7]] & ~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]]]]]] U [~ [[~ [E [4<=p3 U 3<=p10]] | EG [~ [EG [~ [2<=p12]]]]]] & ~ [[~ [E [~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]] U [~ [[5<=p0 & 2<=p7]] & ~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [4<=p8] & ~ [5<=p4]]]]]]]]]]]]]]]]
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (2<=p7)
states: 8,712 (3)
abstracting: (5<=p0)
states: 2,178 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (2<=p12)
states: 8,712 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=p10)
states: 13,068 (4)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (2<=p7)
states: 8,712 (3)
abstracting: (5<=p0)
states: 2,178 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (2<=p7)
states: 8,712 (3)
abstracting: (5<=p0)
states: 2,178 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EG [[[p8<=2 | EX [~ [E [4<=p13 U 5<=p5]]]] | [AX [EF [3<=p13]] | A [A [3<=p13 U 3<=p3] U 5<=p4]]]]
normalized: EG [[[[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [[~ [E [~ [3<=p3] U [~ [3<=p13] & ~ [3<=p3]]]] & ~ [EG [~ [3<=p3]]]]] & ~ [5<=p4]]]]] | ~ [EX [~ [E [true U 3<=p13]]]]] | [EX [~ [E [4<=p13 U 5<=p5]]] | p8<=2]]]
abstracting: (p8<=2)
states: 22,869 (4)
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (4<=p13)
states: 3,267 (3)
.abstracting: (3<=p13)
states: 13,068 (4)
.abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (3<=p3)
states: 13,068 (4)
.
EG iterations: 1
abstracting: (3<=p3)
states: 13,068 (4)
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (3<=p3)
states: 13,068 (4)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: E [3<=p13 U ~ [A [EF [~ [[3<=p8 & 2<=p1]]] U [~ [[EF [1<=p12] | [4<=p8 | 3<=p5]]] & 5<=p14]]]]
normalized: E [3<=p13 U ~ [[~ [E [~ [[~ [[[4<=p8 | 3<=p5] | E [true U 1<=p12]]] & 5<=p14]] U [~ [E [true U ~ [[3<=p8 & 2<=p1]]]] & ~ [[~ [[[4<=p8 | 3<=p5] | E [true U 1<=p12]]] & 5<=p14]]]]] & ~ [EG [~ [[~ [[[4<=p8 | 3<=p5] | E [true U 1<=p12]]] & 5<=p14]]]]]]]
abstracting: (5<=p14)
states: 3,267 (3)
abstracting: (1<=p12)
states: 20,691 (4)
abstracting: (3<=p5)
states: 13,068 (4)
abstracting: (4<=p8)
states: 3,267 (3)
EG iterations: 0
abstracting: (5<=p14)
states: 3,267 (3)
abstracting: (1<=p12)
states: 20,691 (4)
abstracting: (3<=p5)
states: 13,068 (4)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (2<=p1)
states: 10,890 (4)
abstracting: (3<=p8)
states: 13,068 (4)
abstracting: (5<=p14)
states: 3,267 (3)
abstracting: (1<=p12)
states: 20,691 (4)
abstracting: (3<=p5)
states: 13,068 (4)
abstracting: (4<=p8)
states: 3,267 (3)
abstracting: (3<=p13)
states: 13,068 (4)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [AG [[[~ [A [[5<=p0 | 3<=p5] U A [3<=p13 U 5<=p5]]] | p0<=4] | [p12<=0 | [EF [p7<=0] & EG [p2<=1]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[EG [p2<=1] & E [true U p7<=0]] | p12<=0] | [~ [[~ [EG [~ [[~ [EG [~ [5<=p5]]] & ~ [E [~ [5<=p5] U [~ [3<=p13] & ~ [5<=p5]]]]]]]] & ~ [E [~ [[~ [EG [~ [5<=p5]]] & ~ [E [~ [5<=p5] U [~ [3<=p13] & ~ [5<=p5]]]]]] U [~ [[5<=p0 | 3<=p5]] & ~ [[~ [EG [~ [5<=p5]]] & ~ [E [~ [5<=p5] U [~ [3<=p13] & ~ [5<=p5]]]]]]]]]]] | p0<=4]]]]]]
abstracting: (p0<=4)
states: 33,759 (4)
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (5<=p5)
states: 2,178 (3)
.
EG iterations: 1
abstracting: (3<=p5)
states: 13,068 (4)
abstracting: (5<=p0)
states: 2,178 (3)
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (5<=p5)
states: 2,178 (3)
.
EG iterations: 1
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (5<=p5)
states: 2,178 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p12<=0)
states: 15,246 (4)
abstracting: (p7<=0)
states: 15,246 (4)
abstracting: (p2<=1)
states: 27,225 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EF [[AF [[EX [1<=p12] | 3<=p5]] & [AX [p3<=3] | EX [AX [1<=p2]]]]] | EX [E [[[p2<=1 | 3<=p3] | [p0<=2 | 5<=p9]] U 3<=p0]]]
normalized: [E [true U [[~ [EX [~ [p3<=3]]] | EX [~ [EX [~ [1<=p2]]]]] & ~ [EG [~ [[EX [1<=p12] | 3<=p5]]]]]] | EX [E [[[p0<=2 | 5<=p9] | [p2<=1 | 3<=p3]] U 3<=p0]]]
abstracting: (3<=p0)
states: 13,068 (4)
abstracting: (3<=p3)
states: 13,068 (4)
abstracting: (p2<=1)
states: 27,225 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (p0<=2)
states: 22,869 (4)
.abstracting: (3<=p5)
states: 13,068 (4)
abstracting: (1<=p12)
states: 20,691 (4)
..
EG iterations: 1
abstracting: (1<=p2)
states: 20,691 (4)
..abstracting: (p3<=3)
states: 32,670 (4)
.-> the formula is TRUE
FORMULA JoinFreeModules-PT-0003-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [EG [~ [E [[[[3<=p2 & [3<=p7 & 3<=p12]] | 2<=p6] & [AF [5<=p14] & AG [5<=p10]]] U EF [4<=p13]]]] & [EX [p12<=1] | EX [3<=p3]]]
normalized: [[EX [3<=p3] | EX [p12<=1]] & EG [~ [E [[[~ [E [true U ~ [5<=p10]]] & ~ [EG [~ [5<=p14]]]] & [[[3<=p7 & 3<=p12] & 3<=p2] | 2<=p6]] U E [true U 4<=p13]]]]]
abstracting: (4<=p13)
states: 3,267 (3)
abstracting: (2<=p6)
states: 10,890 (4)
abstracting: (3<=p2)
states: 3,267 (3)
abstracting: (3<=p12)
states: 3,267 (3)
abstracting: (3<=p7)
states: 3,267 (3)
abstracting: (5<=p14)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (5<=p10)
states: 2,178 (3)
.
EG iterations: 1
abstracting: (p12<=1)
states: 27,225 (4)
.abstracting: (3<=p3)
states: 13,068 (4)
.-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [E [~ [EX [5<=p14]] U [4<=p13 | [[~ [E [2<=p6 U 2<=p6]] & EF [[3<=p2 & [3<=p7 & 3<=p12]]]] | [A [2<=p7 U 2<=p6] & ~ [[5<=p14 & 5<=p5]]]]]] U [AF [5<=p5] | A [[EF [5<=p4] | [[[5<=p9 | [3<=p2 & [3<=p7 & 3<=p12]]] & 4<=p13] | AF [3<=p10]]] U [E [4<=p3 U 5<=p9] | 3<=p13]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [[E [4<=p3 U 5<=p9] | 3<=p13]]]] & ~ [E [~ [[E [4<=p3 U 5<=p9] | 3<=p13]] U [~ [[[~ [EG [~ [3<=p10]]] | [[[[3<=p7 & 3<=p12] & 3<=p2] | 5<=p9] & 4<=p13]] | E [true U 5<=p4]]] & ~ [[E [4<=p3 U 5<=p9] | 3<=p13]]]]]] | ~ [EG [~ [5<=p5]]]]]]] & ~ [E [~ [[[~ [EG [~ [[E [4<=p3 U 5<=p9] | 3<=p13]]]] & ~ [E [~ [[E [4<=p3 U 5<=p9] | 3<=p13]] U [~ [[[~ [EG [~ [3<=p10]]] | [[[[3<=p7 & 3<=p12] & 3<=p2] | 5<=p9] & 4<=p13]] | E [true U 5<=p4]]] & ~ [[E [4<=p3 U 5<=p9] | 3<=p13]]]]]] | ~ [EG [~ [5<=p5]]]]] U [~ [E [~ [EX [5<=p14]] U [[[~ [[5<=p14 & 5<=p5]] & [~ [EG [~ [2<=p6]]] & ~ [E [~ [2<=p6] U [~ [2<=p7] & ~ [2<=p6]]]]]] | [E [true U [[3<=p7 & 3<=p12] & 3<=p2]] & ~ [E [2<=p6 U 2<=p6]]]] | 4<=p13]]] & ~ [[[~ [EG [~ [[E [4<=p3 U 5<=p9] | 3<=p13]]]] & ~ [E [~ [[E [4<=p3 U 5<=p9] | 3<=p13]] U [~ [[[~ [EG [~ [3<=p10]]] | [[[[3<=p7 & 3<=p12] & 3<=p2] | 5<=p9] & 4<=p13]] | E [true U 5<=p4]]] & ~ [[E [4<=p3 U 5<=p9] | 3<=p13]]]]]] | ~ [EG [~ [5<=p5]]]]]]]]]
abstracting: (5<=p5)
states: 2,178 (3)
.
EG iterations: 1
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p13)
states: 3,267 (3)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (3<=p2)
states: 3,267 (3)
abstracting: (3<=p12)
states: 3,267 (3)
abstracting: (3<=p7)
states: 3,267 (3)
abstracting: (3<=p10)
states: 13,068 (4)
.
EG iterations: 1
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (4<=p13)
states: 3,267 (3)
abstracting: (2<=p6)
states: 10,890 (4)
abstracting: (2<=p6)
states: 10,890 (4)
abstracting: (3<=p2)
states: 3,267 (3)
abstracting: (3<=p12)
states: 3,267 (3)
abstracting: (3<=p7)
states: 3,267 (3)
abstracting: (2<=p6)
states: 10,890 (4)
abstracting: (2<=p7)
states: 8,712 (3)
abstracting: (2<=p6)
states: 10,890 (4)
abstracting: (2<=p6)
states: 10,890 (4)
.
EG iterations: 1
abstracting: (5<=p5)
states: 2,178 (3)
abstracting: (5<=p14)
states: 3,267 (3)
abstracting: (5<=p14)
states: 3,267 (3)
.abstracting: (5<=p5)
states: 2,178 (3)
.
EG iterations: 1
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p13)
states: 3,267 (3)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (3<=p2)
states: 3,267 (3)
abstracting: (3<=p12)
states: 3,267 (3)
abstracting: (3<=p7)
states: 3,267 (3)
abstracting: (3<=p10)
states: 13,068 (4)
.
EG iterations: 1
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
.
EG iterations: 1
abstracting: (5<=p5)
states: 2,178 (3)
.
EG iterations: 1
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (5<=p4)
states: 3,267 (3)
abstracting: (4<=p13)
states: 3,267 (3)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (3<=p2)
states: 3,267 (3)
abstracting: (3<=p12)
states: 3,267 (3)
abstracting: (3<=p7)
states: 3,267 (3)
abstracting: (3<=p10)
states: 13,068 (4)
.
EG iterations: 1
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
abstracting: (3<=p13)
states: 13,068 (4)
abstracting: (5<=p9)
states: 3,267 (3)
abstracting: (4<=p3)
states: 3,267 (3)
.
EG iterations: 1
.........
EG iterations: 9
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0003-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
totally nodes used: 17398 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 30782 31676 62458
used/not used/entry size/cache size: 44197 67064667 16 1024MB
basic ops cache: hits/miss/sum: 16094 13410 29504
used/not used/entry size/cache size: 25831 16751385 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: 1242 911 2153
used/not used/entry size/cache size: 911 8387697 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 67092207
1 16217
2 327
3 46
4 26
5 8
6 19
7 6
8 3
9 0
>= 10 5
Total processing time: 0m 4.313sec
BK_STOP 1679451874772
--------------------
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:120 (4), effective:36 (1)
initing FirstDep: 0m 0.000sec
iterations count:51 (2), effective:6 (0)
iterations count:63 (2), effective:12 (0)
iterations count:49 (1), effective:6 (0)
iterations count:35 (1), effective:3 (0)
iterations count:31 (1), effective:3 (0)
iterations count:32 (1), effective:1 (0)
iterations count:47 (1), effective:7 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:27 (1), effective:1 (0)
iterations count:41 (1), effective:4 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:27 (1), effective:1 (0)
iterations count:61 (2), effective:13 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:27 (1), effective:1 (0)
iterations count:58 (2), effective:14 (0)
iterations count:42 (1), effective:4 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:51 (2), effective:6 (0)
iterations count:51 (2), effective:6 (0)
iterations count:31 (1), effective:2 (0)
iterations count:51 (2), effective:6 (0)
iterations count:25 (1), effective:0 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:1 (0)
iterations count:31 (1), effective:2 (0)
iterations count:28 (1), effective:1 (0)
iterations count:28 (1), effective:3 (0)
iterations count:25 (1), effective:0 (0)
iterations count:38 (1), effective:4 (0)
iterations count:48 (1), effective:7 (0)
iterations count:69 (2), effective:12 (0)
iterations count:28 (1), effective:1 (0)
iterations count:25 (1), effective:0 (0)
iterations count:58 (2), effective:12 (0)
iterations count:62 (2), effective:12 (0)
iterations count:58 (2), effective:12 (0)
iterations count:58 (2), effective:12 (0)
iterations count:25 (1), effective:0 (0)
iterations count:226 (9), effective:57 (2)
iterations count:32 (1), effective:2 (0)
iterations count:25 (1), effective:0 (0)
iterations count:58 (2), effective:12 (0)
iterations count:62 (2), effective:12 (0)
iterations count:58 (2), effective:12 (0)
iterations count:58 (2), effective:12 (0)
iterations count:58 (2), effective:12 (0)
iterations count:62 (2), effective:12 (0)
iterations count:58 (2), effective:12 (0)
iterations count:58 (2), effective:12 (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="JoinFreeModules-PT-0003"
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 JoinFreeModules-PT-0003, 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 r234-tall-167856419900138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0003.tgz
mv JoinFreeModules-PT-0003 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 ;