Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545700444.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TCPcondis-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545700444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.9K Apr 29 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 24K 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 TCPcondis-PT-05-LTLFireability-00
FORMULA_NAME TCPcondis-PT-05-LTLFireability-01
FORMULA_NAME TCPcondis-PT-05-LTLFireability-02
FORMULA_NAME TCPcondis-PT-05-LTLFireability-03
FORMULA_NAME TCPcondis-PT-05-LTLFireability-04
FORMULA_NAME TCPcondis-PT-05-LTLFireability-05
FORMULA_NAME TCPcondis-PT-05-LTLFireability-06
FORMULA_NAME TCPcondis-PT-05-LTLFireability-07
FORMULA_NAME TCPcondis-PT-05-LTLFireability-08
FORMULA_NAME TCPcondis-PT-05-LTLFireability-09
FORMULA_NAME TCPcondis-PT-05-LTLFireability-10
FORMULA_NAME TCPcondis-PT-05-LTLFireability-11
FORMULA_NAME TCPcondis-PT-05-LTLFireability-12
FORMULA_NAME TCPcondis-PT-05-LTLFireability-13
FORMULA_NAME TCPcondis-PT-05-LTLFireability-14
FORMULA_NAME TCPcondis-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653136954754

Running Version 202205111006
[2022-05-21 12:42:35] [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-21 12:42:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 12:42:35] [WARNING] Skipping unknown tool specific annotation : Tina
[2022-05-21 12:42:35] [WARNING] Unknown XML tag in source file: size
[2022-05-21 12:42:35] [WARNING] Unknown XML tag in source file: color
[2022-05-21 12:42:35] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2022-05-21 12:42:36] [INFO ] Transformed 30 places.
[2022-05-21 12:42:36] [INFO ] Transformed 32 transitions.
[2022-05-21 12:42:36] [INFO ] Parsed PT model containing 30 places and 32 transitions in 146 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 5 formulas.
FORMULA TCPcondis-PT-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-05-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:36] [INFO ] Computed 9 place invariants in 7 ms
[2022-05-21 12:42:36] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:36] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 12:42:36] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:36] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 12:42:36] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Support contains 21 out of 30 places after structural reductions.
[2022-05-21 12:42:36] [INFO ] Flatten gal took : 36 ms
[2022-05-21 12:42:36] [INFO ] Flatten gal took : 6 ms
[2022-05-21 12:42:36] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 378 steps, including 0 resets, run visited all 19 properties in 43 ms. (steps per millisecond=8 )
FORMULA TCPcondis-PT-05-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G(((p0 U p1)||(F(p0)&&G(F(X(F(G(p2)))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Applied a total of 8 rules in 10 ms. Remains 26 /30 variables (removed 4) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 26 cols
[2022-05-21 12:42:36] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:36] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2022-05-21 12:42:36] [INFO ] Computed 9 place invariants in 10 ms
[2022-05-21 12:42:37] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-05-21 12:42:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2022-05-21 12:42:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:37] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 28/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 28/32 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s21 1), p0:(GEQ s0 1), p2:(OR (LT s12 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 266 ms.
Stack based approach found an accepted trace after 249 steps with 2 reset with depth 228 and stack size 228 in 3 ms.
FORMULA TCPcondis-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-00 finished in 765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((F((G(p2)&&p1))||G(p3)||p4)&&p0))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 6 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 12:42:37] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:37] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 12:42:37] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-21 12:42:37] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-21 12:42:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 12:42:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:37] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p4)))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p4) (NOT p1) (NOT p3)) (AND p0 (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p4) (NOT p1) p3) (AND p0 (NOT p4) p3 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p4) p1 (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p4) (NOT p1) (NOT p3)) (AND p0 (NOT p4) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p4) (NOT p1) p3) (AND p0 (NOT p4) p3 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p4) p1 (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p4) p1 p3 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p4) (NOT p1) p3) (AND p0 (NOT p4) p3 (NOT p2))), acceptance={0} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p1 p2) (AND (NOT p4) p1 (NOT p3) p2)), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p4) p1 p3 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2)) (AND (NOT p4) (NOT p1) p3) (AND (NOT p4) p3 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3) p2) (AND (NOT p4) p1 (NOT p3) p2)), acceptance={1} source=3 dest: 4}, { cond=(OR (AND (NOT p0) p1 p3 p2) (AND (NOT p4) p1 p3 p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p4) p3 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p4) (NOT p3) p2)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p4) p3 p2), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=5 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p4) p3 (NOT p2))), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p4) (NOT p3) p2)), acceptance={1} source=5 dest: 4}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p4) p3 p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s23 1)), p4:(AND (GEQ s6 1) (GEQ s17 1)), p1:(AND (GEQ s6 1) (GEQ s17 1)), p3:(AND (GEQ s10 1) (GEQ s23 1)), p2:(AND (GEQ s8 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2888 reset in 292 ms.
Stack based approach found an accepted trace after 1140 steps with 33 reset with depth 12 and stack size 12 in 3 ms.
FORMULA TCPcondis-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-01 finished in 762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(p0 U F(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:38] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 12:42:38] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:38] [INFO ] Computed 9 place invariants in 8 ms
[2022-05-21 12:42:38] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s17 1)), p0:(AND (GEQ s10 1) (GEQ s24 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 1 reset in 1 ms.
FORMULA TCPcondis-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-04 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:38] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:38] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 12:42:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:38] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:38] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s23 1) (GEQ s15 1)), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33219 reset in 91 ms.
Product exploration explored 100000 steps with 33365 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 361 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), true, (NOT p0)]
Finished random walk after 2852 steps, including 0 resets, run visited all 5 properties in 25 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA TCPcondis-PT-05-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-05-LTLFireability-07 finished in 1172 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(X(p0) U !X(X(p1)))||p2)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:39] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:39] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:39] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:40] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s19 1)), p0:(GEQ s0 1), p1:(AND (GEQ s4 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 5 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-09 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((G(F(p0))||p0) U F(p0))) U p0)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:40] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:40] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:40] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-10 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 s15 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 74 ms.
Product exploration explored 100000 steps with 50000 reset in 72 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 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-05-LTLFireability-10 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X((F((G(p0)||p0))&&p1))))||p2)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:40] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:40] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:40] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(AND (GEQ s5 1) (GEQ s21 1)), p0:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p1:(GEQ s3 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 5067 reset in 130 ms.
Stack based approach found an accepted trace after 37122 steps with 1884 reset with depth 27 and stack size 27 in 47 ms.
FORMULA TCPcondis-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-11 finished in 469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 9 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:41] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-21 12:42:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 224 steps with 0 reset with depth 225 and stack size 225 in 1 ms.
FORMULA TCPcondis-PT-05-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-13 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 7 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:41] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 12:42:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-21 12:42:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:41] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 339 steps with 0 reset with depth 340 and stack size 340 in 5 ms.
FORMULA TCPcondis-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-05-LTLFireability-14 finished in 315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X(p0) U p1))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 12:42:41] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 12:42:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 12:42:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : TCPcondis-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s24 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 6 factoid took 102 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-05-LTLFireability-15 finished in 455 ms.
All properties solved by simple procedures.
Total runtime 6329 ms.

BK_STOP 1653136962244

--------------------
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="TCPcondis-PT-05"
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 TCPcondis-PT-05, 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 r258-tall-165303545700444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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