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.r519-tall-167987245200348.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 lolaxred
Input is Murphy-PT-D2N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245200348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 7 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 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-D2N100-LTLFireability-00
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-01
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-02
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-03
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-04
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-05
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-06
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-07
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-08
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-09
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-10
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-11
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-12
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-13
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-14
FORMULA_NAME Murphy-PT-D2N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680938657933

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-08 07:24:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 07:24:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:24:19] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-08 07:24:19] [INFO ] Transformed 18 places.
[2023-04-08 07:24:19] [INFO ] Transformed 21 transitions.
[2023-04-08 07:24:19] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D2N100-LTLFireability-02 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 7 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:24:19] [INFO ] Computed 4 invariants in 7 ms
[2023-04-08 07:24:19] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
[2023-04-08 07:24:19] [INFO ] Invariant cache hit.
[2023-04-08 07:24:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:24:19] [INFO ] Invariant cache hit.
[2023-04-08 07:24:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-08 07:24:19] [INFO ] Invariant cache hit.
[2023-04-08 07:24:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-08 07:24:20] [INFO ] Flatten gal took : 14 ms
[2023-04-08 07:24:20] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:24:20] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10071 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 25) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-04-08 07:24:20] [INFO ] Invariant cache hit.
[2023-04-08 07:24:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:20] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-04-08 07:24:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:20] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-04-08 07:24:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:20] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-04-08 07:24:20] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-08 07:24:20] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 56 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 10 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:20] [INFO ] Invariant cache hit.
[2023-04-08 07:24:20] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10061 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=503 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 349233 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349233 steps, saw 227070 distinct states, run finished after 3003 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-08 07:24:23] [INFO ] Invariant cache hit.
[2023-04-08 07:24:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:24] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-08 07:24:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:24:24] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-08 07:24:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:24] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-08 07:24:24] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-08 07:24:24] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 51 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-08 07:24:24] [INFO ] Invariant cache hit.
[2023-04-08 07:24:24] [INFO ] Implicit Places using invariants in 21 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 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 26 ms. Remains : 16/18 places, 21/21 transitions.
Incomplete random walk after 10087 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=403 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 360002 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 360002 steps, saw 232958 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 21 rows 16 cols
[2023-04-08 07:24:27] [INFO ] Computed 2 invariants in 3 ms
[2023-04-08 07:24:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:27] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-08 07:24:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:27] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-08 07:24:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:27] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-08 07:24:27] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-08 07:24:27] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 14 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-08 07:24:27] [INFO ] Invariant cache hit.
[2023-04-08 07:24:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 07:24:27] [INFO ] Invariant cache hit.
[2023-04-08 07:24:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:27] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 07:24:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:27] [INFO ] Invariant cache hit.
[2023-04-08 07:24:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 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 6 properties.
[2023-04-08 07:24:27] [INFO ] Invariant cache hit.
[2023-04-08 07:24:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:27] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-08 07:24:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:27] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-08 07:24:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:27] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-08 07:24:27] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-08 07:24:27] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL 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.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:24:27] [INFO ] Computed 4 invariants in 1 ms
[2023-04-08 07:24:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:24:27] [INFO ] Invariant cache hit.
[2023-04-08 07:24:28] [INFO ] Implicit Places using invariants in 26 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60 ms. Remains : 15/18 places, 21/21 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s14 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10455 reset in 215 ms.
Stack based approach found an accepted trace after 212 steps with 22 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-00 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1&&X((F(!p2)||G(p1)))))||p0))))'
Support contains 4 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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-08 07:24:28] [INFO ] Invariant cache hit.
[2023-04-08 07:24:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:28] [INFO ] Invariant cache hit.
[2023-04-08 07:24:28] [INFO ] Implicit Places using invariants in 20 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 17/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s4 1)), p0:(OR (LT s1 1) (LT s4 1) (LT s7 1) (GEQ s14 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 28680 reset in 155 ms.
Stack based approach found an accepted trace after 91 steps with 38 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-01 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U p1))&&X(p2))))'
Support contains 4 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 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:28] [INFO ] Invariant cache hit.
[2023-04-08 07:24:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:28] [INFO ] Invariant cache hit.
[2023-04-08 07:24:28] [INFO ] Implicit Places using invariants in 21 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(OR p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s2 3) (GEQ s6 1) (GEQ s12 1)), p0:(GEQ s9 1), p2:(AND (GEQ s9 2) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-03 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(!p1))))||G(p1)))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_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-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Implicit Places using invariants in 38 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL 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 SI_LTL mode , in 2 iterations and 69 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s9 1), p0:(OR (LT s0 1) (LT s3 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5 reset in 135 ms.
Stack based approach found an accepted trace after 14 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-04 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&X(G(p0)))))'
Support contains 6 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Implicit Places using invariants in 21 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s14 3), p1:(OR (NOT (AND (GEQ s7 2) (GEQ s10 1))) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-05 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Implicit Places using invariants in 29 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1892 steps with 0 reset in 10 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-06 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((!p0||F(!p1))) U G(p2)) U p3))'
Support contains 6 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 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-04-08 07:24:29] [INFO ] Invariant cache hit.
[2023-04-08 07:24:29] [INFO ] Implicit Places using invariants in 20 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL 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 LTL mode , in 2 iterations and 44 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p3), (AND p1 p0), (NOT p2), (AND p1 (NOT p2) p0), p1, (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1) (OR (AND (GEQ s0 3) (GEQ s10 1)) (AND (GEQ s9 2) (GEQ s12 1)))), p2:(AND (GEQ s0 3) (GEQ s6 1) (GEQ s10 1)), p0:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28447 reset in 135 ms.
Stack based approach found an accepted trace after 1454 steps with 421 reset with depth 4 and stack size 4 in 3 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-07 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p1)||G(p2)))||p0)))'
Support contains 3 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] Implicit Places using invariants in 23 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (GEQ s6 2) (GEQ s9 1)), p0:(OR (LT s6 2) (LT s9 1)), p2:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-PT-D2N100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-PT-D2N100-LTLFireability-08 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 3 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] Implicit Places using invariants in 26 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s8 1), p0:(AND (GEQ s7 2) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10489 reset in 105 ms.
Stack based approach found an accepted trace after 60 steps with 5 reset with depth 26 and stack size 26 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-09 finished in 271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 8 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:30] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-04-08 07:24:30] [INFO ] Invariant cache hit.
[2023-04-08 07:24:31] [INFO ] Implicit Places using invariants in 22 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 17/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s3 1) (AND (GEQ s2 1) (GEQ s5 1) (GEQ s7 1))), p0:(OR (LT s0 1) (LT s3 1) (AND (GEQ s1 3) (GEQ s6 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 36243 reset in 92 ms.
Stack based approach found an accepted trace after 272 steps with 98 reset with depth 16 and stack size 16 in 0 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-10 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_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-08 07:24:31] [INFO ] Invariant cache hit.
[2023-04-08 07:24:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:31] [INFO ] Invariant cache hit.
[2023-04-08 07:24:31] [INFO ] Implicit Places using invariants in 24 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 2) (LT s9 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10093 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1261 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2688753 steps, run timeout after 3001 ms. (steps per millisecond=895 ) properties seen :{}
Probabilistic random walk after 2688753 steps, saw 1726386 distinct states, run finished after 3001 ms. (steps per millisecond=895 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21 rows 15 cols
[2023-04-08 07:24:34] [INFO ] Computed 1 invariants in 4 ms
[2023-04-08 07:24:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:34] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-08 07:24:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:24:34] [INFO ] After 2ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:34] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:24:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:24:34] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:34] [INFO ] After 2ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:24:34] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-08 07:24:34] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 6 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 8
Applied a total of 3 rules in 2 ms. Remains 6 /15 variables (removed 9) and now considering 8/21 (removed 13) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-04-08 07:24:34] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:24:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 6/15 places, 8/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Probably explored full state space saw : 36 states, properties seen :0
Probabilistic random walk after 132 steps, saw 36 distinct states, run finished after 7 ms. (steps per millisecond=18 ) properties seen :0
Explored full state space saw : 36 states, properties seen :0
Exhaustive walk after 132 steps, saw 36 distinct states, run finished after 1 ms. (steps per millisecond=132 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-PT-D2N100-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-PT-D2N100-LTLFireability-11 finished in 3757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(!p1))))'
Support contains 3 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 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-08 07:24:35] [INFO ] Computed 4 invariants in 1 ms
[2023-04-08 07:24:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:35] [INFO ] Invariant cache hit.
[2023-04-08 07:24:35] [INFO ] Implicit Places using invariants in 20 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 180 ms :[p1, (AND p1 (NOT p0)), p1, true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (LT s14 3) (GEQ s7 1)), p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 128 steps with 28 reset in 1 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-12 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:35] [INFO ] Invariant cache hit.
[2023-04-08 07:24:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:24:35] [INFO ] Invariant cache hit.
[2023-04-08 07:24:35] [INFO ] Implicit Places using invariants in 21 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-13 finished in 138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0)))&&(X(p1) U p2)))'
Support contains 6 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:24:35] [INFO ] Invariant cache hit.
[2023-04-08 07:24:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:35] [INFO ] Invariant cache hit.
[2023-04-08 07:24:35] [INFO ] Implicit Places using invariants in 19 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
Starting structural reductions in LTL 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 LTL mode , in 2 iterations and 52 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p0), true]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s6 1)), p1:(AND (GEQ s8 2) (GEQ s11 1)), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-14 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&G(p1))||(p0&&F(p2))))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL 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-08 07:24:35] [INFO ] Invariant cache hit.
[2023-04-08 07:24:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:35] [INFO ] Invariant cache hit.
[2023-04-08 07:24:35] [INFO ] Implicit Places using invariants in 19 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
Starting structural reductions in SI_LTL 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 SI_LTL mode , in 2 iterations and 55 ms. Remains : 16/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Murphy-PT-D2N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s5 1) (LT s6 1)), p1:(AND (GEQ s7 2) (GEQ s10 1)), p2:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 108 reset in 151 ms.
Stack based approach found an accepted trace after 95 steps with 4 reset with depth 68 and stack size 68 in 1 ms.
FORMULA Murphy-PT-D2N100-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D2N100-LTLFireability-15 finished in 376 ms.
All properties solved by simple procedures.
Total runtime 16702 ms.
ITS solved all properties within timeout

BK_STOP 1680938677067

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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-D2N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Murphy-PT-D2N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r519-tall-167987245200348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N100.tgz
mv Murphy-PT-D2N100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;