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.r521-tall-167987246500338.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 ltsminxred
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 r521-tall-167987246500338
=====================================================================

--------------------
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 1680902982876

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 21:29:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 21:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 21:29:46] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-04-07 21:29:46] [INFO ] Transformed 18 places.
[2023-04-07 21:29:46] [INFO ] Transformed 21 transitions.
[2023-04-07 21:29:46] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 132 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 22 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 21:29:46] [INFO ] Computed 4 invariants in 3 ms
[2023-04-07 21:29:46] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
[2023-04-07 21:29:46] [INFO ] Invariant cache hit.
[2023-04-07 21:29:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-04-07 21:29:46] [INFO ] Invariant cache hit.
[2023-04-07 21:29:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:46] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-04-07 21:29:46] [INFO ] Invariant cache hit.
[2023-04-07 21:29:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 21:29:47] [INFO ] Flatten gal took : 17 ms
[2023-04-07 21:29:47] [INFO ] Flatten gal took : 11 ms
[2023-04-07 21:29:47] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 30) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 21:29:47] [INFO ] Invariant cache hit.
[2023-04-07 21:29:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 21:29:47] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 21:29:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 21:29:48] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:48] [INFO ] After 30ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:48] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 21:29:48] [INFO ] After 259ms 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 16 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 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:48] [INFO ] Invariant cache hit.
[2023-04-07 21:29:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 430705 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430705 steps, saw 277599 distinct states, run finished after 3014 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 21:29:51] [INFO ] Invariant cache hit.
[2023-04-07 21:29:51] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2023-04-07 21:29:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 25 ms returned sat
[2023-04-07 21:29:52] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 21:29:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-04-07 21:29:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 21:29:52] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:52] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:52] [INFO ] After 27ms 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 21:29:52] [INFO ] After 114ms 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 1 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 1 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 21:29:52] [INFO ] Invariant cache hit.
[2023-04-07 21:29:52] [INFO ] Implicit Places using invariants in 54 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 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 1 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 68 ms. Remains : 16/18 places, 21/21 transitions.
Incomplete random walk after 10042 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1673 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 339216 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339216 steps, saw 218194 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 21 rows 16 cols
[2023-04-07 21:29:55] [INFO ] Computed 2 invariants in 1 ms
[2023-04-07 21:29:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:29:55] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 21:29:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:55] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:55] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:55] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 21:29:56] [INFO ] After 188ms 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 31 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 4 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 4 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 21:29:56] [INFO ] Invariant cache hit.
[2023-04-07 21:29:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-04-07 21:29:56] [INFO ] Invariant cache hit.
[2023-04-07 21:29:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:56] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-04-07 21:29:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 21:29:56] [INFO ] Invariant cache hit.
[2023-04-07 21:29:56] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 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 21:29:56] [INFO ] Invariant cache hit.
[2023-04-07 21:29:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:29:56] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 21:29:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 21:29:56] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:29:56] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:56] [INFO ] After 16ms 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 21:29:56] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-04-07 21:29:56] [INFO ] Flatten gal took : 4 ms
[2023-04-07 21:29:56] [INFO ] Flatten gal took : 4 ms
[2023-04-07 21:29:56] [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 1 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 21:29:56] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 21:29:56] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:56] [INFO ] Flatten gal took : 4 ms
[2023-04-07 21:29:56] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:56] [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 21:29:56] [INFO ] Invariant cache hit.
[2023-04-07 21:29:57] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:57] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:57] [INFO ] Flatten gal took : 7 ms
[2023-04-07 21:29:57] [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 6 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 21:29:57] [INFO ] Invariant cache hit.
[2023-04-07 21:29:57] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:57] [INFO ] Flatten gal took : 3 ms
[2023-04-07 21:29:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:57] [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 21:29:57] [INFO ] Invariant cache hit.
[2023-04-07 21:29:58] [INFO ] Dead Transitions using invariants and state equation in 1242 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1247 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:58] [INFO ] Flatten gal took : 5 ms
[2023-04-07 21:29:58] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:58] [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 21:29:58] [INFO ] Invariant cache hit.
[2023-04-07 21:29:58] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:58] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:58] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:29:58] [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 21:29:58] [INFO ] Invariant cache hit.
[2023-04-07 21:29:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:29:58] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:58] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:29:58] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2021015 steps, run timeout after 3001 ms. (steps per millisecond=673 ) properties seen :{}
Probabilistic random walk after 2021015 steps, saw 1273424 distinct states, run finished after 3001 ms. (steps per millisecond=673 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 21:30:01] [INFO ] Invariant cache hit.
[2023-04-07 21:30:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:30:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 30 ms returned sat
[2023-04-07 21:30:01] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 21:30:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 21:30:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 10 ms returned sat
[2023-04-07 21:30:01] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 21:30:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 21:30:01] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 21:30:01] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 21:30:01] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 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 21:30:01] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 21:30:01] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 3/18 places, 4/21 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) 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 5 ms. (steps per millisecond=2 ) 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 1 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 21:30:03] [INFO ] Computed 4 invariants in 17 ms
[2023-04-07 21:30:03] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [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 21:30:03] [INFO ] Invariant cache hit.
[2023-04-07 21:30:03] [INFO ] Dead Transitions using invariants and state equation in 35 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 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 11 ms
[2023-04-07 21:30:03] [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 21:30:03] [INFO ] Invariant cache hit.
[2023-04-07 21:30:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [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 21:30:03] [INFO ] Invariant cache hit.
[2023-04-07 21:30:03] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 15 ms
[2023-04-07 21:30:03] [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 21:30:03] [INFO ] Invariant cache hit.
[2023-04-07 21:30:03] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 7 ms
[2023-04-07 21:30:03] [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 21:30:03] [INFO ] Invariant cache hit.
[2023-04-07 21:30:03] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:03] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:30:03] [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 21:30:03] [INFO ] Invariant cache hit.
[2023-04-07 21:30:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:30:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:04] [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 21:30:04] [INFO ] Invariant cache hit.
[2023-04-07 21:30:04] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 21:30:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:30:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:30:04] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 21:30:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 21:30:04] [INFO ] Flatten gal took : 1 ms
[2023-04-07 21:30:04] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-07 21:30:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 1 ms.
Total runtime 18065 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/590/ctl_0_ --ctl=/tmp/590/ctl_1_ --ctl=/tmp/590/ctl_2_ --ctl=/tmp/590/ctl_3_ --ctl=/tmp/590/ctl_4_ --ctl=/tmp/590/ctl_5_ --ctl=/tmp/590/ctl_6_ --ctl=/tmp/590/ctl_7_ --ctl=/tmp/590/ctl_8_ --ctl=/tmp/590/ctl_9_ --ctl=/tmp/590/ctl_10_ --ctl=/tmp/590/ctl_11_ --ctl=/tmp/590/ctl_12_ --mu-par --mu-opt
FORMULA Murphy-PT-D2N050-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-PT-D2N050-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680906221283

--------------------
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
mcc2023
ctl formula name Murphy-PT-D2N050-CTLFireability-00
ctl formula formula --ctl=/tmp/590/ctl_0_
ctl formula name Murphy-PT-D2N050-CTLFireability-01
ctl formula formula --ctl=/tmp/590/ctl_1_
ctl formula name Murphy-PT-D2N050-CTLFireability-02
ctl formula formula --ctl=/tmp/590/ctl_2_
ctl formula name Murphy-PT-D2N050-CTLFireability-03
ctl formula formula --ctl=/tmp/590/ctl_3_
ctl formula name Murphy-PT-D2N050-CTLFireability-04
ctl formula formula --ctl=/tmp/590/ctl_4_
ctl formula name Murphy-PT-D2N050-CTLFireability-06
ctl formula formula --ctl=/tmp/590/ctl_5_
ctl formula name Murphy-PT-D2N050-CTLFireability-07
ctl formula formula --ctl=/tmp/590/ctl_6_
ctl formula name Murphy-PT-D2N050-CTLFireability-08
ctl formula formula --ctl=/tmp/590/ctl_7_
ctl formula name Murphy-PT-D2N050-CTLFireability-10
ctl formula formula --ctl=/tmp/590/ctl_8_
ctl formula name Murphy-PT-D2N050-CTLFireability-11
ctl formula formula --ctl=/tmp/590/ctl_9_
ctl formula name Murphy-PT-D2N050-CTLFireability-12
ctl formula formula --ctl=/tmp/590/ctl_10_
ctl formula name Murphy-PT-D2N050-CTLFireability-13
ctl formula formula --ctl=/tmp/590/ctl_11_
ctl formula name Murphy-PT-D2N050-CTLFireability-15
ctl formula formula --ctl=/tmp/590/ctl_12_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 18 places, 21 transitions and 81 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 21->9 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 18; there are 9 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 37657 group checks and 0 next state calls
pnml2lts-sym: reachability took 3150.970 real 10290.120 user 2284.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.090 real 0.370 user 0.000 sys
pnml2lts-sym: state space has 41538421296 states, 199733 nodes
pnml2lts-sym: Formula /tmp/590/ctl_1_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_7_ holds for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_5_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_11_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_6_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/590/ctl_10_ does not hold for the initial state
pnml2lts-sym: group_next: 981332 nodes total
pnml2lts-sym: group_explored: 528499 nodes, 18081738 short vectors total
pnml2lts-sym: max token count: 151

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="ltsminxred"
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 ltsminxred"
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 r521-tall-167987246500338"
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 ;