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-165281572300444.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 Referendum-PT-0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572300444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 422K Apr 29 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 29 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 29 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 29 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 347K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 253K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 106K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 571K 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 Referendum-PT-0500-LTLFireability-00
FORMULA_NAME Referendum-PT-0500-LTLFireability-01
FORMULA_NAME Referendum-PT-0500-LTLFireability-02
FORMULA_NAME Referendum-PT-0500-LTLFireability-03
FORMULA_NAME Referendum-PT-0500-LTLFireability-04
FORMULA_NAME Referendum-PT-0500-LTLFireability-05
FORMULA_NAME Referendum-PT-0500-LTLFireability-06
FORMULA_NAME Referendum-PT-0500-LTLFireability-07
FORMULA_NAME Referendum-PT-0500-LTLFireability-08
FORMULA_NAME Referendum-PT-0500-LTLFireability-09
FORMULA_NAME Referendum-PT-0500-LTLFireability-10
FORMULA_NAME Referendum-PT-0500-LTLFireability-11
FORMULA_NAME Referendum-PT-0500-LTLFireability-12
FORMULA_NAME Referendum-PT-0500-LTLFireability-13
FORMULA_NAME Referendum-PT-0500-LTLFireability-14
FORMULA_NAME Referendum-PT-0500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653083962092

Running Version 202205111006
[2022-05-20 21:59:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:59:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:59:23] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2022-05-20 21:59:23] [INFO ] Transformed 1501 places.
[2022-05-20 21:59:23] [INFO ] Transformed 1001 transitions.
[2022-05-20 21:59:23] [INFO ] Found NUPN structural information;
[2022-05-20 21:59:23] [INFO ] Parsed PT model containing 1501 places and 1001 transitions in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0500-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 1500 place count 501 transition count 501
Applied a total of 1500 rules in 72 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:24] [INFO ] Computed 0 place invariants in 14 ms
[2022-05-20 21:59:24] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:24] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:59:24] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:24] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-20 21:59:24] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/1501 places, 501/1001 transitions.
Support contains 501 out of 501 places after structural reductions.
[2022-05-20 21:59:25] [INFO ] Flatten gal took : 215 ms
[2022-05-20 21:59:25] [INFO ] Flatten gal took : 108 ms
[2022-05-20 21:59:25] [INFO ] Input system was already deterministic with 501 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:26] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 21:59:26] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Referendum-PT-0500-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Referendum-PT-0500-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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' '!(X(G(X(F(G(p0))))))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 30 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:27] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:59:27] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:27] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:27] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2022-05-20 21:59:27] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:27] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-20 21:59:27] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-00 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 (EQ s106 0) (EQ s171 0) (EQ s366 0) (EQ s431 0) (EQ s236 0) (EQ s301 0) (EQ s25 0) (EQ s496 0) (EQ s90 0) (EQ s155 0) (EQ s350 0) (EQ s415 0) (EQ ...], 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 199 reset in 2041 ms.
Product exploration explored 100000 steps with 199 reset in 2194 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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 : [p0, (X (NOT p0)), (X (X (NOT 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 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-00 finished in 5523 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:32] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:32] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:32] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:33] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ s415 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 10 ms.
FORMULA Referendum-PT-0500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-01 finished in 887 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U false)||X(X(X(X(F(p1)))))))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 499 places :
Symmetric choice reduction at 0 with 499 rule applications. Total rules 499 place count 2 transition count 2
Iterating global reduction 0 with 499 rules applied. Total rules applied 998 place count 2 transition count 2
Applied a total of 998 rules in 29 ms. Remains 2 /501 variables (removed 499) and now considering 2/501 (removed 499) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:59:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:33] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:59:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:59:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:33] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/501 places, 2/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/501 places, 2/501 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s0 0)], 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 20000 reset in 89 ms.
Product exploration explored 100000 steps with 20000 reset in 63 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 : [(NOT p1), true, (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-03 finished in 654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(p0)))))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:33] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:34] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:34] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:34] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2022-05-20 21:59:34] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:34] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:34] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-04 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 (EQ s106 0) (EQ s171 0) (EQ s366 0) (EQ s431 0) (EQ s236 0) (EQ s301 0) (EQ s25 0) (EQ s496 0) (EQ s90 0) (EQ s155 0) (EQ s350 0) (EQ s415 0) (EQ ...], 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 199 reset in 1602 ms.
Product exploration explored 100000 steps with 199 reset in 1688 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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 : [p0, (X (NOT p0)), (X (X (NOT 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 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-04 finished in 4435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(G(p0))))))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 3 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:38] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:38] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:38] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-20 21:59:39] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s106 0) (EQ s171 0) (EQ s366 0) (EQ s431 0) (EQ s236 0) (EQ s301 0) (EQ s25 0) (EQ s496 0) (EQ s90 0) (EQ s155 0) (EQ s350 0) (EQ s415 0) (EQ ...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-05 finished in 808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(X(!(p1 U G(F(p2)))))||p0) U G(p1)))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 6 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:39] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:39] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-05-20 21:59:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:39] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), true, (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s0 1), p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-06 finished in 756 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!X(p0) U p1))||X(F(p1))||X(p0)))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 2 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:39] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:40] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:40] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 501 cols
[2022-05-20 21:59:40] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:40] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ s415 1) (EQ s...], 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 50000 reset in 1791 ms.
Product exploration explored 100000 steps with 50000 reset in 1869 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-07 finished in 4529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)&&F(p1)&&p2))))'
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Graph (complete) has 500 edges and 501 vertex of which 3 are kept as prefixes of interest. Removing 498 places using SCC suffix rule.3 ms
Discarding 498 places :
Also discarding 498 output transitions
Drop transitions removed 498 transitions
Applied a total of 1 rules in 6 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:44] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-20 21:59:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-20 21:59:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:44] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:59:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s1 0), p0:(EQ s0 1), p1:(EQ s2 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 1 ms.
FORMULA Referendum-PT-0500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-09 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0)||p0) U X(p1)) U (X(F(p0))||p1)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 8 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:44] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:44] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:44] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s2 1), p0:(EQ s0 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 41 ms.
Product exploration explored 100000 steps with 50000 reset in 49 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 (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-10 finished in 412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U !X(p0))))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 8 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:45] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ 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][false, false]]
Product exploration explored 100000 steps with 25004 reset in 34 ms.
Product exploration explored 100000 steps with 25085 reset in 41 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), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-PT-0500-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-13 finished in 438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(X(F(X(p1))))))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 17 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:45] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:45] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:59:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:59:45] [INFO ] Dead Transitions using invariants and state equation in 12 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2 0), p1:(EQ s0 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]]
Stuttering criterion allowed to conclude after 504 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-14 finished in 300 ms.
All properties solved by simple procedures.
Total runtime 22338 ms.

BK_STOP 1653083986311

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Referendum-PT-0500"
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 Referendum-PT-0500, 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-165281572300444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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