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.r078-tall-165260110400460.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 Eratosthenes-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110400460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 6.8K Apr 29 15:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 15:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 15:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 15:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.5K May 10 09:33 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 Eratosthenes-PT-010-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652685999522

Running Version 202205111006
[2022-05-16 07:26:40] [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-16 07:26:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:26:40] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2022-05-16 07:26:40] [INFO ] Transformed 9 places.
[2022-05-16 07:26:40] [INFO ] Transformed 8 transitions.
[2022-05-16 07:26:40] [INFO ] Parsed PT model containing 9 places and 8 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA Eratosthenes-PT-010-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 6/6 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 5
Applied a total of 1 rules in 8 ms. Remains 5 /5 variables (removed 0) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:26:40] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 07:26:41] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:26:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:41] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:26:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/5 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 5/6 transitions.
Support contains 5 out of 5 places after structural reductions.
[2022-05-16 07:26:41] [INFO ] Flatten gal took : 12 ms
[2022-05-16 07:26:41] [INFO ] Flatten gal took : 1 ms
[2022-05-16 07:26:41] [INFO ] Input system was already deterministic with 5 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 7 properties in 447 ms. (steps per millisecond=0 )
FORMULA Eratosthenes-PT-010-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2 transition count 2
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2 transition count 2
Applied a total of 6 rules in 2 ms. Remains 2 /5 variables (removed 3) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:26:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:42] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:26:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:26:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/5 places, 2/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 2/5 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-LTLFireability-00 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U F(X(!(F(p0)&&p1)))))))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Graph (complete) has 0 edges and 5 vertex of which 2 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 8 ms. Remains 2 /5 variables (removed 3) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:26:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:42] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:26:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 07:26:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:26:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:42] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/5 places, 2/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 2/5 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 36327 reset in 161 ms.
Product exploration explored 100000 steps with 36335 reset in 82 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-010-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-010-LTLFireability-01 finished in 669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(F(G(X(F((F(p1)&&p2))))))))'
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Graph (complete) has 0 edges and 5 vertex of which 3 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:43] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:43] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-16 07:26:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/5 places, 3/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s2 1), p2:(GEQ s0 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 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-LTLFireability-03 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p0)||G(p1)))&&F(!p1)))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 3 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:43] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:43] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/5 places, 3/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) p1), p1, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LT s2 1), p0:(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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-LTLFireability-05 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)||(X(p2)&&F(p2))))'
Support contains 4 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:43] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 07:26:43] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 5/5 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GEQ s0 1), p2:(AND (GEQ s1 1) (GEQ s2 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-010-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-010-LTLFireability-07 finished in 796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:44] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/5 places, 3/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 31796 reset in 57 ms.
Product exploration explored 100000 steps with 31764 reset in 84 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-010-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-010-LTLFireability-09 finished in 466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(!F(X(F(!F(p0))))) U X(p1))))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 2 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:44] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:44] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/5 places, 3/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 104 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 68 ms.
Product exploration explored 100000 steps with 16666 reset in 80 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 369 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-010-LTLFireability-11 finished in 751 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))&&(G(!(!p1 U p0))||X(p1)))))'
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:45] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:45] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:26:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:45] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/5 places, 3/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 0 ms.
FORMULA Eratosthenes-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-LTLFireability-13 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||(X((G(p1)&&p3))&&p2)))))'
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 0 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:26:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:26:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:26:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/5 places, 4/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/5 places, 4/5 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (NOT p1), (OR (NOT p3) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p3), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(GEQ s3 1), p0:(GEQ s1 1), p2:(AND (GEQ s1 1) (GEQ s2 1)), p3:(GEQ s2 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-LTLFireability-14 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(p0))))'
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Graph (complete) has 0 edges and 5 vertex of which 1 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /5 variables (removed 4) and now considering 1/5 (removed 4) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:26:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:26:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:26:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-16 07:26:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-16 07:26:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:26:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/5 places, 1/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/5 places, 1/5 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-010-LTLFireability-15 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:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 595 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-010-LTLFireability-15 finished in 916 ms.
All properties solved by simple procedures.
Total runtime 6452 ms.

BK_STOP 1652686007521

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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="Eratosthenes-PT-010"
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 Eratosthenes-PT-010, 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 r078-tall-165260110400460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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