Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416100613.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-007007, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416100613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 18K May 5 16:51 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 RefineWMG-PT-007007-00
FORMULA_NAME RefineWMG-PT-007007-01
FORMULA_NAME RefineWMG-PT-007007-02
FORMULA_NAME RefineWMG-PT-007007-03
FORMULA_NAME RefineWMG-PT-007007-04
FORMULA_NAME RefineWMG-PT-007007-05
FORMULA_NAME RefineWMG-PT-007007-06
FORMULA_NAME RefineWMG-PT-007007-07
FORMULA_NAME RefineWMG-PT-007007-08
FORMULA_NAME RefineWMG-PT-007007-09
FORMULA_NAME RefineWMG-PT-007007-10
FORMULA_NAME RefineWMG-PT-007007-11
FORMULA_NAME RefineWMG-PT-007007-12
FORMULA_NAME RefineWMG-PT-007007-13
FORMULA_NAME RefineWMG-PT-007007-14
FORMULA_NAME RefineWMG-PT-007007-15

=== Now, execution of the tool begins

BK_START 1621261582225

Running Version 0
[2021-05-17 14:26:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:26:24] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-17 14:26:24] [INFO ] Transformed 39 places.
[2021-05-17 14:26:24] [INFO ] Transformed 31 transitions.
[2021-05-17 14:26:24] [INFO ] Parsed PT model containing 39 places and 31 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:26:24] [INFO ] Initial state test concluded for 4 properties.
Support contains 30 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 14 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 13 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
[2021-05-17 14:26:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 14:26:24] [INFO ] Flatten gal took : 19 ms
FORMULA RefineWMG-PT-007007-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007007-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:26:24] [INFO ] Flatten gal took : 6 ms
[2021-05-17 14:26:24] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 2155 steps, including 0 resets, run visited all 22 properties in 12 ms. (steps per millisecond=179 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1||G(p0)))||F(((F(p2)&&G(p3))||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-007007-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 5}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(OR (LT s16 1) (LT s17 1) (LT s19 1)), p1:(AND (LT s33 1) (GEQ s4 5)), p0:(GEQ s4 5), p2:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 200 reset in 310 ms.
Stack based approach found an accepted trace after 117 steps with 0 reset with depth 118 and stack size 113 in 1 ms.
FORMULA RefineWMG-PT-007007-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-00 finished in 818 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : RefineWMG-PT-007007-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LT s22 1), p1:(GEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-01 finished in 279 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&(!p1||G((p2&&X(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 5 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-007007-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 2) (LT s2 2)), p1:(OR (LT s16 1) (LT s17 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 RefineWMG-PT-007007-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-02 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 19 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 27 place count 13 transition count 13
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 13 transition count 9
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 7 transition count 7
Applied a total of 39 rules in 18 ms. Remains 7 /39 variables (removed 32) and now considering 7/31 (removed 24) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:25] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:26:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:26] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/39 places, 7/31 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-04 finished in 109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:26] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-17 14:26:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:26] [INFO ] Computed 16 place invariants in 5 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 20 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 25 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 13 rules in 2 ms. Remains 25 /39 variables (removed 14) and now considering 18/31 (removed 13) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-17 14:26:26] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
[2021-05-17 14:26:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-17 14:26:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/39 places, 18/31 transitions.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
[2021-05-17 14:26:27] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:26:27] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:26:27] [INFO ] Time to serialize gal into /tmp/LTL9385095949083523283.gal : 2 ms
[2021-05-17 14:26:27] [INFO ] Time to serialize properties into /tmp/LTL7881694781364754840.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9385095949083523283.gal, -t, CGAL, -LTL, /tmp/LTL7881694781364754840.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9385095949083523283.gal -t CGAL -LTL /tmp/LTL7881694781364754840.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p2<1)"))))
Formula 0 simplified : !XF"(p2<1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.25064,21684,1,0,6,31726,20,0,1079,38011,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-007007-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RefineWMG-PT-007007-05 finished in 1627 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||(F(!p1)&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 9 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:27] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:27] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:27] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:27] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:27] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), true]
Running random walk in product with property : RefineWMG-PT-007007-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s24 1)), p1:(OR (LT s16 1) (LT s17 1) (LT s19 1)), p2:(OR (LT s26 1) (LT s27 1) (LT s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-06 finished in 299 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (p1||G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 16 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 17 transition count 16
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 17 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 14 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 29 place count 14 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 13 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 12 transition count 11
Applied a total of 33 rules in 3 ms. Remains 12 /39 variables (removed 27) and now considering 11/31 (removed 20) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:26:27] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:26:28] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:26:28] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-17 14:26:28] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:26:28] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/39 places, 11/31 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-007007-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s3 3), p2:(LT s5 1), p0:(OR (LT s7 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-07 finished in 180 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-007007-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s36 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-08 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 19 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 27 place count 13 transition count 13
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 13 transition count 8
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 37 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 7 transition count 7
Applied a total of 39 rules in 3 ms. Remains 7 /39 variables (removed 32) and now considering 7/31 (removed 24) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-17 14:26:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:26:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/39 places, 7/31 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-09 finished in 82 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-007007-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s20 1), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-007007-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-10 finished in 602 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U G(p1))||X((G(p1)||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:28] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:29] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:29] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:29] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:29] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-007007-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s10 1), p1:(GEQ s7 1), p2:(GEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 135 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 16 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 29 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 4 ms. Remains 29 /39 variables (removed 10) and now considering 22/31 (removed 9) transitions.
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 14:26:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 14:26:30] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
[2021-05-17 14:26:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 22 rows 29 cols
[2021-05-17 14:26:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 14:26:30] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/39 places, 22/31 transitions.
Product exploration explored 100000 steps with 33333 reset in 185 ms.
Product exploration explored 100000 steps with 33333 reset in 190 ms.
[2021-05-17 14:26:30] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:26:30] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:26:30] [INFO ] Time to serialize gal into /tmp/LTL15921019918948035881.gal : 1 ms
[2021-05-17 14:26:30] [INFO ] Time to serialize properties into /tmp/LTL17581612831591461402.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15921019918948035881.gal, -t, CGAL, -LTL, /tmp/LTL17581612831591461402.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15921019918948035881.gal -t CGAL -LTL /tmp/LTL17581612831591461402.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(p7<1)")U(G("(p4>=1)")))||(X((G("(p4>=1)"))||(F("(p29>=1)")))))))
Formula 0 simplified : !X(("(p7<1)" U G"(p4>=1)") | X(G"(p4>=1)" | F"(p29>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
26 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.277888,23120,1,0,7,31726,40,0,1098,38011,21
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-007007-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RefineWMG-PT-007007-11 finished in 2188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&(F(G(p1)) U p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 14 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 17 place count 21 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 18 transition count 15
Applied a total of 23 rules in 5 ms. Remains 18 /39 variables (removed 21) and now considering 15/31 (removed 16) transitions.
// Phase 1: matrix 15 rows 18 cols
[2021-05-17 14:26:31] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-17 14:26:31] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-17 14:26:31] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 14:26:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2021-05-17 14:26:31] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/39 places, 15/31 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-007007-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s12 1)), p2:(AND (GEQ s0 1) (GEQ s15 1) (GEQ s16 1)), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-12 finished in 210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (p1 U G(!p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 15 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 20 place count 19 transition count 17
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 19 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 16 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 16 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 15 transition count 13
Applied a total of 28 rules in 4 ms. Remains 15 /39 variables (removed 24) and now considering 13/31 (removed 18) transitions.
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 14:26:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/39 places, 13/31 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s12 1) (GEQ s13 1)), p0:(OR (LT s6 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-14 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||(G(p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 14 edges and 39 vertex of which 8 / 39 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 31 transition count 24
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 22 place count 19 transition count 18
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 19 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 16 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 16 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 15 transition count 14
Applied a total of 30 rules in 19 ms. Remains 15 /39 variables (removed 24) and now considering 14/31 (removed 17) transitions.
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:26:31] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 14:26:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-17 14:26:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/39 places, 14/31 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-007007-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LT s9 1) (OR (LT s0 1) (LT s12 1) (LT s13 1))), p2:(LT s6 1), p0:(AND (LT s9 1) (OR (LT s0 1) (LT s12 1) (LT s13 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-007007-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-15 finished in 228 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621261592183

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="RefineWMG-PT-007007"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-007007, 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 r178-tajo-162089416100613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007007.tgz
mv RefineWMG-PT-007007 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 ;