Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572300500.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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-007008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572300500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 02:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 18K May 10 09:34 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-007008-LTLFireability-00
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-01
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-02
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-03
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-04
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-05
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-06
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-07
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-08
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-09
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-10
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-11
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-12
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-13
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-14
FORMULA_NAME RefineWMG-PT-007008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653084474271

Running Version 202205111006
[2022-05-20 22:07:55] [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]
[2022-05-20 22:07:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:07:55] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2022-05-20 22:07:55] [INFO ] Transformed 39 places.
[2022-05-20 22:07:55] [INFO ] Transformed 31 transitions.
[2022-05-20 22:07:55] [INFO ] Parsed PT model containing 39 places and 31 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA RefineWMG-PT-007008-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007008-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007008-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007008-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007008-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 27 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:55] [INFO ] Computed 16 place invariants in 6 ms
[2022-05-20 22:07:55] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:07:56] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:56] [INFO ] Computed 16 place invariants in 7 ms
[2022-05-20 22:07:56] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:07:56] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Support contains 26 out of 39 places after structural reductions.
[2022-05-20 22:07:56] [INFO ] Flatten gal took : 18 ms
[2022-05-20 22:07:56] [INFO ] Flatten gal took : 8 ms
[2022-05-20 22:07:56] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 1037 steps, including 0 resets, run visited all 20 properties in 63 ms. (steps per millisecond=16 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:07:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:07:56] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:56] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-20 22:07:56] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:56] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:07:56] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:56] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-20 22:07:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 135 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-007008-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-007008-LTLFireability-00 finished in 913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(G(X(X(p0))))||G(G(F(p1)))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 3 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 11 ms. Remains 7 /39 variables (removed 32) and now considering 7/31 (removed 24) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:07:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:07:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:07:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:07:57] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:07:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:07:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-05-20 22:07:57] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:07:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:07:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/39 places, 7/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/39 places, 7/31 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 2) (LT s2 2)), p1:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-01 finished in 369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(X((F(X(p0))&&(G(p1)||p2)))))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 17 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 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 21 place count 17 transition count 15
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 17 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 16 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 23 place count 16 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 13 transition count 11
Applied a total of 29 rules in 12 ms. Remains 13 /39 variables (removed 26) and now considering 11/31 (removed 20) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:07:57] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:07:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:07:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:07:58] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:07:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:07:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-20 22:07:58] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:07:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:07:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/39 places, 11/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/39 places, 11/31 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s8 1), p2:(LT s5 1), p1:(LT s12 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 5 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-02 finished in 428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 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 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 24 place count 15 transition count 14
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 28 place count 15 transition count 10
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 32 place count 11 transition count 9
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 34 place count 10 transition count 9
Applied a total of 34 rules in 4 ms. Remains 10 /39 variables (removed 29) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:07:58] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-20 22:07:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:07:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:07:58] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:07:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:07:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-20 22:07:58] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:07:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:07:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/39 places, 9/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/39 places, 9/31 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-05 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 1) (LT s7 1) (LT s9 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]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-05 finished in 273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&(F(p1)||G(p2))))'
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 13 edges and 39 vertex of which 8 / 39 are part of one of the 4 SCC in 0 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 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 19 place count 21 transition count 19
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 21 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 20 transition count 18
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 23 place count 19 transition count 17
Applied a total of 23 rules in 18 ms. Remains 19 /39 variables (removed 20) and now considering 17/31 (removed 14) transitions.
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:07:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:07:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:07:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:07:58] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:07:58] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-20 22:07:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-20 22:07:58] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2022-05-20 22:07:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-20 22:07:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/39 places, 17/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/39 places, 17/31 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s15 1) (OR (LT s6 1) (LT s7 1) (LT s9 1))), p2:(GEQ s17 1), p0:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s15 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-06 finished in 409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!(F(p0) U p0)||F(X(F(p1)))))||p2)))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 0 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:59] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:07:59] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:59] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 22:07:59] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:59] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 22:07:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:07:59] [INFO ] Computed 16 place invariants in 5 ms
[2022-05-20 22:08:00] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s10 1), p2:(LT s13 1), p0:(GEQ s20 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6407 reset in 371 ms.
Stack based approach found an accepted trace after 89 steps with 1 reset with depth 88 and stack size 85 in 0 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-07 finished in 1691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)&&F(p2)))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 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 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 24 place count 15 transition count 14
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 27 place count 15 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 12 transition count 10
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 32 place count 11 transition count 10
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 34 place count 10 transition count 9
Applied a total of 34 rules in 4 ms. Remains 10 /39 variables (removed 29) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:08:00] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:00] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:08:00] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:00] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-20 22:08:00] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 22:08:00] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-20 22:08:00] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:08:00] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/39 places, 9/31 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/39 places, 9/31 transitions.
Stuttering acceptance computed with spot in 152 ms :[p1, true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s1 2) (GEQ s2 2)), p1:(GEQ s8 1), p2:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-08 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(!X(p1) U F(p2))&&p0)))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 22:08:01] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 8 ms
[2022-05-20 22:08:01] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:08:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:08:01] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p0) p2), p2, (OR (NOT p0) p2)]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LT s15 1), p0:(AND (LT s27 1) (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, stutter-sensitive, 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-007008-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-11 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X((F(p0)&&p0)) U (X(p1) U X(p0)))||G(p2)))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:08:01] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:08:01] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 22:08:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:01] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 22:08:01] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s35 1), p1:(GEQ s12 1), p2:(GEQ s3 3)], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1229 steps with 47 reset in 5 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-13 finished in 578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X((p1 U p2))||p3))))'
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-20 22:08:02] [INFO ] Computed 16 place invariants in 13 ms
[2022-05-20 22:08:02] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:02] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 22:08:02] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:02] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 22:08:02] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2022-05-20 22:08:02] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 22:08:02] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-007008-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 2) (LT s2 2)), p3:(GEQ s30 1), p2:(AND (GEQ s31 1) (GEQ s32 1) (GEQ s34 1)), p1:(GEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2811 reset in 219 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA RefineWMG-PT-007008-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-007008-LTLFireability-15 finished in 666 ms.
All properties solved by simple procedures.
Total runtime 7331 ms.

BK_STOP 1653084482911

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-007008"
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-007008, 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 r186-tajo-165281572300500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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