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.r522-tall-167987247200338.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 Murphy-PT-D2N050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N050-CTLFireability-00
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-01
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-02
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-03
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-04
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-05
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-06
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-07
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-08
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-09
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-10
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-11
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-12
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-13
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-14
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680892747022

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=Murphy-PT-D2N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:39:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:39:08] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-07 18:39:08] [INFO ] Transformed 18 places.
[2023-04-07 18:39:08] [INFO ] Transformed 21 transitions.
[2023-04-07 18:39:08] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Murphy-PT-D2N050-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 9 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:39:08] [INFO ] Computed 4 invariants in 7 ms
[2023-04-07 18:39:08] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
[2023-04-07 18:39:08] [INFO ] Invariant cache hit.
[2023-04-07 18:39:08] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-04-07 18:39:08] [INFO ] Invariant cache hit.
[2023-04-07 18:39:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-04-07 18:39:08] [INFO ] Invariant cache hit.
[2023-04-07 18:39:08] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 18:39:09] [INFO ] Flatten gal took : 14 ms
[2023-04-07 18:39:09] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:39:09] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 30) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 18:39:09] [INFO ] Invariant cache hit.
[2023-04-07 18:39:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:09] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:39:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:09] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:09] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:09] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 18:39:09] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:09] [INFO ] Invariant cache hit.
[2023-04-07 18:39:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10018 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 446070 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446070 steps, saw 287010 distinct states, run finished after 3002 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 18:39:12] [INFO ] Invariant cache hit.
[2023-04-07 18:39:12] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:12] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:39:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:12] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:12] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:12] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 18:39:12] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:12] [INFO ] Invariant cache hit.
[2023-04-07 18:39:13] [INFO ] Implicit Places using invariants in 25 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31 ms. Remains : 16/18 places, 21/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 432888 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432888 steps, saw 278734 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 21 rows 16 cols
[2023-04-07 18:39:16] [INFO ] Computed 2 invariants in 1 ms
[2023-04-07 18:39:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:16] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:39:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:16] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:16] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:16] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 18:39:16] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 9 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:16] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-07 18:39:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 16/16 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:16] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 18:39:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:16] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:16] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:16] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 18:39:16] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:39:16] [INFO ] Computed 4 invariants in 2 ms
[2023-04-07 18:39:16] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 8 ms
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [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 26 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [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 33 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:16] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:16] [INFO ] Invariant cache hit.
[2023-04-07 18:39:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:16] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:16] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2584220 steps, run timeout after 3001 ms. (steps per millisecond=861 ) properties seen :{}
Probabilistic random walk after 2584220 steps, saw 1625441 distinct states, run finished after 3001 ms. (steps per millisecond=861 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:39:19] [INFO ] Invariant cache hit.
[2023-04-07 18:39:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:19] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:39:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:19] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:39:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:19] [INFO ] After 2ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:39:19] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 18:39:19] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Graph (complete) has 69 edges and 18 vertex of which 3 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 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 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /18 variables (removed 15) and now considering 4/21 (removed 17) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 18:39:19] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:39:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 3/18 places, 4/21 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 1) seen :0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N050-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:39:20] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:20] [INFO ] Invariant cache hit.
[2023-04-07 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:20] [INFO ] Invariant cache hit.
[2023-04-07 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:20] [INFO ] Invariant cache hit.
[2023-04-07 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:20] [INFO ] Invariant cache hit.
[2023-04-07 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:20] [INFO ] Invariant cache hit.
[2023-04-07 18:39:20] [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 : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:20] [INFO ] Invariant cache hit.
[2023-04-07 18:39:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:20] [INFO ] Invariant cache hit.
[2023-04-07 18:39:20] [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 : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:20] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 18:39:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:21] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:21] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-07 18:39:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 12644 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: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.756sec


RS generation: 0m 2.559sec


-> reachability set: #nodes 15348 (1.5e+04) #states 41,538,421,296 (10)



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

checking: AG [EX [[AF [p10<=0] | EX [EX [1<=p13]]]]]
normalized: ~ [E [true U ~ [EX [[~ [EG [~ [p10<=0]]] | EX [EX [1<=p13]]]]]]]

abstracting: (1<=p13)
states: 27,692,280,864 (10)
..abstracting: (p10<=0)
states: 20,769,210,648 (10)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.167sec

checking: EF [AG [AF [[p2<=2 | [p8<=0 | p14<=0]]]]]
normalized: E [true U ~ [E [true U EG [~ [[p2<=2 | [p8<=0 | p14<=0]]]]]]]

abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p8<=0)
states: 1,296,166,536 (9)
abstracting: (p2<=2)
states: 3,826,043,208 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.252sec

checking: EG [E [3<=p16 U EG [[2<=p11 & 1<=p14]]]]
normalized: EG [E [3<=p16 U EG [[2<=p11 & 1<=p14]]]]

abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0
.
EG iterations: 1
abstracting: (3<=p16)
states: 6,923,070,216 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [p9<=0] | EX [[1<=p2 & 1<=p5]]]
normalized: [EX [[1<=p2 & 1<=p5]] | ~ [EX [~ [p9<=0]]]]

abstracting: (p9<=0)
states: 20,769,210,648 (10)
.abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
.-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.253sec

checking: EX [EF [AX [[[2<=p11 & 1<=p14] & [1<=p0 & [1<=p3 & 1<=p6]]]]]]
normalized: EX [E [true U ~ [EX [~ [[[1<=p0 & [1<=p3 & 1<=p6]] & [2<=p11 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
..-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: EG [AG [A [AF [3<=p17] U AF [[[1<=p2 & 1<=p5] | [3<=p2 & [1<=p8 & 1<=p14]]]]]]]
normalized: EG [~ [E [true U ~ [[~ [EG [EG [~ [[[3<=p2 & [1<=p8 & 1<=p14]] | [1<=p2 & 1<=p5]]]]]] & ~ [E [EG [~ [[[3<=p2 & [1<=p8 & 1<=p14]] | [1<=p2 & 1<=p5]]]] U [EG [~ [3<=p17]] & EG [~ [[[3<=p2 & [1<=p8 & 1<=p14]] | [1<=p2 & 1<=p5]]]]]]]]]]]]

abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (3<=p2)
states: 37,712,378,088 (10)
.
EG iterations: 1
abstracting: (3<=p17)
states: 6,923,070,216 (9)
.
EG iterations: 1
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (3<=p2)
states: 37,712,378,088 (10)
.
EG iterations: 1
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (3<=p2)
states: 37,712,378,088 (10)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.240sec

checking: AG [AX [A [[A [[[1<=p6 & 1<=p12] & 3<=p0] U 1<=p12] | [p13<=0 | 1<=p14]] U EF [[1<=p1 & 1<=p4]]]]]
normalized: ~ [E [true U EX [~ [[~ [EG [~ [E [true U [1<=p1 & 1<=p4]]]]] & ~ [E [~ [E [true U [1<=p1 & 1<=p4]]] U [~ [[[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[3<=p0 & [1<=p6 & 1<=p12]]] & ~ [1<=p12]]]]] | [p13<=0 | 1<=p14]]] & ~ [E [true U [1<=p1 & 1<=p4]]]]]]]]]]]

abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
.
EG iterations: 1
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.447sec

checking: [EF [[1<=p9 & [AF [[p9<=0 & [p0<=2 | [p6<=0 | p12<=0]]]] & AG [[p11<=1 | p14<=0]]]]] | AG [AF [AX [[1<=p2 & [1<=p5 & 1<=p8]]]]]]
normalized: [~ [E [true U EG [EX [~ [[1<=p2 & [1<=p5 & 1<=p8]]]]]]] | E [true U [1<=p9 & [~ [E [true U ~ [[p11<=1 | p14<=0]]]] & ~ [EG [~ [[p9<=0 & [p0<=2 | [p6<=0 | p12<=0]]]]]]]]]]

abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p6<=0)
states: 1,296,166,536 (9)
abstracting: (p0<=2)
states: 3,826,043,208 (9)
abstracting: (p9<=0)
states: 20,769,210,648 (10)
.
EG iterations: 1
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p11<=1)
states: 41,538,421,296 (10)
abstracting: (1<=p9)
states: 20,769,210,648 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.355sec

checking: EF [AG [A [[p17<=2 | [A [[3<=p0 & [1<=p6 & 1<=p12]] U [1<=p1 & [1<=p4 & 1<=p7]]] | 3<=p16]] U ~ [[1<=p2 & [1<=p5 & 1<=p8]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [[1<=p2 & [1<=p5 & 1<=p8]]]] & ~ [E [[1<=p2 & [1<=p5 & 1<=p8]] U [~ [[p17<=2 | [3<=p16 | [~ [EG [~ [[1<=p1 & [1<=p4 & 1<=p7]]]]] & ~ [E [~ [[1<=p1 & [1<=p4 & 1<=p7]]] U [~ [[3<=p0 & [1<=p6 & 1<=p12]]] & ~ [[1<=p1 & [1<=p4 & 1<=p7]]]]]]]]]] & [1<=p2 & [1<=p5 & 1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
.
EG iterations: 1
abstracting: (3<=p16)
states: 6,923,070,216 (9)
abstracting: (p17<=2)
states: 34,615,351,080 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.755sec

checking: AX [AX [[[AX [[3<=p0 & [1<=p6 & 1<=p12]]] | p1<=2] | [p7<=0 | [p13<=0 | AX [[[p1<=0 | p4<=0] | [p7<=0 | [p0<=0 | p3<=0]]]]]]]]]
normalized: ~ [EX [EX [~ [[[p7<=0 | [p13<=0 | ~ [EX [~ [[[p7<=0 | [p0<=0 | p3<=0]] | [p1<=0 | p4<=0]]]]]]] | [p1<=2 | ~ [EX [~ [[3<=p0 & [1<=p6 & 1<=p12]]]]]]]]]]]

abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
.abstracting: (p1<=2)
states: 3,826,043,208 (9)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p3<=0)
states: 1,298,093,688 (9)
abstracting: (p0<=0)
states: 1,296,166,536 (9)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
.abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
..-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.937sec

checking: EF [AG [[[E [~ [[3<=p2 & [1<=p8 & 1<=p14]]] U [2<=p10 & 1<=p13]] | [1<=p14 & AX [p14<=0]]] & [1<=p11 | [EX [3<=p16] & E [[2<=p10 & 1<=p13] U 1<=p9]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[1<=p14 & ~ [EX [~ [p14<=0]]]] | E [~ [[3<=p2 & [1<=p8 & 1<=p14]]] U [2<=p10 & 1<=p13]]] & [1<=p11 | [E [[2<=p10 & 1<=p13] U 1<=p9] & EX [3<=p16]]]]]]]]

abstracting: (3<=p16)
states: 6,923,070,216 (9)
.abstracting: (1<=p9)
states: 20,769,210,648 (10)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p11)
states: 20,769,210,648 (10)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (3<=p2)
states: 37,712,378,088 (10)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
.abstracting: (1<=p14)
states: 27,692,280,864 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: AX [EX [[[3<=p15 | p12<=0] & [[~ [E [3<=p16 U [2<=p10 & 1<=p13]]] | EF [[p2<=2 | [p8<=0 | p14<=0]]]] & [1<=p11 | [[3<=p1 & [1<=p7 & 1<=p13]] | [[1<=p1 & 1<=p4] & [1<=p7 & [1<=p2 & 1<=p5]]]]]]]]]
normalized: ~ [EX [~ [EX [[[[1<=p11 | [[[1<=p7 & [1<=p2 & 1<=p5]] & [1<=p1 & 1<=p4]] | [3<=p1 & [1<=p7 & 1<=p13]]]] & [E [true U [p2<=2 | [p8<=0 | p14<=0]]] | ~ [E [3<=p16 U [2<=p10 & 1<=p13]]]]] & [3<=p15 | p12<=0]]]]]]

abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (3<=p15)
states: 6,923,070,216 (9)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
abstracting: (3<=p16)
states: 6,923,070,216 (9)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p8<=0)
states: 1,296,166,536 (9)
abstracting: (p2<=2)
states: 3,826,043,208 (9)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p11)
states: 20,769,210,648 (10)
..-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.259sec

checking: [EX [[[EX [p15<=2] | [~ [A [3<=p16 U [3<=p1 & [1<=p7 & 1<=p13]]]] | AX [[2<=p10 & 1<=p13]]]] | [[1<=p0 & [1<=p3 & 1<=p14]] | [EG [1<=p11] | [[[p9<=0 | [p2<=0 | p5<=0]] & p17<=2] & [[p0<=2 | [p6<=0 | p12<=0]] & [2<=p10 & 1<=p13]]]]]]] | [EX [AF [~ [A [1<=p10 U [1<=p2 & [1<=p5 & 1<=p8]]]]]] & ~ [A [[[EG [[2<=p9 & 1<=p12]] & ~ [[1<=p0 & 1<=p3]]] | 3<=p17] U [~ [[3<=p17 | [1<=p1 & [1<=p4 & 1<=p7]]]] | AF [[2<=p11 & 1<=p14]]]]]]]
normalized: [[~ [[~ [EG [~ [[~ [EG [~ [[2<=p11 & 1<=p14]]]] | ~ [[3<=p17 | [1<=p1 & [1<=p4 & 1<=p7]]]]]]]] & ~ [E [~ [[~ [EG [~ [[2<=p11 & 1<=p14]]]] | ~ [[3<=p17 | [1<=p1 & [1<=p4 & 1<=p7]]]]]] U [~ [[3<=p17 | [~ [[1<=p0 & 1<=p3]] & EG [[2<=p9 & 1<=p12]]]]] & ~ [[~ [EG [~ [[2<=p11 & 1<=p14]]]] | ~ [[3<=p17 | [1<=p1 & [1<=p4 & 1<=p7]]]]]]]]]]] & EX [~ [EG [[~ [EG [~ [[1<=p2 & [1<=p5 & 1<=p8]]]]] & ~ [E [~ [[1<=p2 & [1<=p5 & 1<=p8]]] U [~ [1<=p10] & ~ [[1<=p2 & [1<=p5 & 1<=p8]]]]]]]]]]] | EX [[[[[[[2<=p10 & 1<=p13] & [p0<=2 | [p6<=0 | p12<=0]]] & [p17<=2 & [p9<=0 | [p2<=0 | p5<=0]]]] | EG [1<=p11]] | [1<=p0 & [1<=p3 & 1<=p14]]] | [[~ [EX [~ [[2<=p10 & 1<=p13]]]] | ~ [[~ [EG [~ [[3<=p1 & [1<=p7 & 1<=p13]]]]] & ~ [E [~ [[3<=p1 & [1<=p7 & 1<=p13]]] U [~ [3<=p16] & ~ [[3<=p1 & [1<=p7 & 1<=p13]]]]]]]]] | EX [p15<=2]]]]]

abstracting: (p15<=2)
states: 34,615,351,080 (10)
.abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
abstracting: (3<=p16)
states: 6,923,070,216 (9)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
.
EG iterations: 1
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
.abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
abstracting: (1<=p11)
states: 20,769,210,648 (10)
.
EG iterations: 1
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (p9<=0)
states: 20,769,210,648 (10)
abstracting: (p17<=2)
states: 34,615,351,080 (10)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p6<=0)
states: 1,296,166,536 (9)
abstracting: (p0<=2)
states: 3,826,043,208 (9)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
.abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p10)
states: 20,769,210,648 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (3<=p17)
states: 6,923,070,216 (9)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0

EG iterations: 0
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (2<=p9)
states: 0
.
EG iterations: 1
abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
abstracting: (3<=p17)
states: 6,923,070,216 (9)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (3<=p17)
states: 6,923,070,216 (9)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0

EG iterations: 0
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (3<=p17)
states: 6,923,070,216 (9)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.230sec

totally nodes used: 2516495 (2.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 64596188 6047348 70643536
used/not used/entry size/cache size: 7585199 59523665 16 1024MB
basic ops cache: hits/miss/sum: 16618283 2555548 19173831
used/not used/entry size/cache size: 3833458 12943758 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: 641887 118836 760723
used/not used/entry size/cache size: 117940 8270668 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 64923280
1 1909736
2 256984
3 11955
4 4593
5 967
6 398
7 44
8 15
9 150
>= 10 742

Total processing time: 0m16.170sec


BK_STOP 1680892778172

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:7459 (355), effective:1786 (85)

initing FirstDep: 0m 0.000sec


iterations count:65 (3), effective:12 (0)

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

iterations count:1371 (65), effective:150 (7)

iterations count:75 (3), effective:11 (0)

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

iterations count:75 (3), effective:11 (0)

iterations count:75 (3), effective:11 (0)

iterations count:539 (25), effective:74 (3)

iterations count:319 (15), effective:149 (7)

iterations count:332 (15), effective:78 (3)

iterations count:72 (3), effective:11 (0)

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

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

iterations count:1364 (64), effective:149 (7)

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

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

iterations count:24 (1), effective:1 (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="Murphy-PT-D2N050"
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 Murphy-PT-D2N050, 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 r522-tall-167987247200338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N050.tgz
mv Murphy-PT-D2N050 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;