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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 8.9K Apr 29 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 29 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 13:00 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 3.8K May 9 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 82K 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 Railroad-PT-010-LTLFireability-00
FORMULA_NAME Railroad-PT-010-LTLFireability-01
FORMULA_NAME Railroad-PT-010-LTLFireability-02
FORMULA_NAME Railroad-PT-010-LTLFireability-03
FORMULA_NAME Railroad-PT-010-LTLFireability-04
FORMULA_NAME Railroad-PT-010-LTLFireability-05
FORMULA_NAME Railroad-PT-010-LTLFireability-06
FORMULA_NAME Railroad-PT-010-LTLFireability-07
FORMULA_NAME Railroad-PT-010-LTLFireability-08
FORMULA_NAME Railroad-PT-010-LTLFireability-09
FORMULA_NAME Railroad-PT-010-LTLFireability-10
FORMULA_NAME Railroad-PT-010-LTLFireability-11
FORMULA_NAME Railroad-PT-010-LTLFireability-12
FORMULA_NAME Railroad-PT-010-LTLFireability-13
FORMULA_NAME Railroad-PT-010-LTLFireability-14
FORMULA_NAME Railroad-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653082379495

Running Version 202205111006
[2022-05-20 21:33:00] [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:33:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:33:01] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-20 21:33:01] [INFO ] Transformed 118 places.
[2022-05-20 21:33:01] [INFO ] Transformed 156 transitions.
[2022-05-20 21:33:01] [INFO ] Found NUPN structural information;
[2022-05-20 21:33:01] [INFO ] Parsed PT model containing 118 places and 156 transitions in 189 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 3 formulas.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 10 transitions.
FORMULA Railroad-PT-010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 146/146 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 146
Applied a total of 9 rules in 12 ms. Remains 78 /87 variables (removed 9) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 78 cols
[2022-05-20 21:33:01] [INFO ] Computed 32 place invariants in 17 ms
[2022-05-20 21:33:01] [INFO ] Implicit Places using invariants in 232 ms returned [35, 36, 39, 43, 44, 45, 55, 59, 62, 66, 74]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 266 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/87 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/87 places, 146/146 transitions.
Support contains 36 out of 67 places after structural reductions.
[2022-05-20 21:33:01] [INFO ] Flatten gal took : 36 ms
[2022-05-20 21:33:01] [INFO ] Flatten gal took : 17 ms
[2022-05-20 21:33:01] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 33 out of 67 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 32) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 67 cols
[2022-05-20 21:33:02] [INFO ] Computed 21 place invariants in 6 ms
[2022-05-20 21:33:02] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-20 21:33:02] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-20 21:33:02] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 21:33:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-20 21:33:02] [INFO ] [Nat]Absence check using 16 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-20 21:33:02] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 21:33:02] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-20 21:33:02] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 64 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 62 transition count 144
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 7 place count 62 transition count 137
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 21 place count 55 transition count 137
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 2 with 8 rules applied. Total rules applied 29 place count 51 transition count 133
Applied a total of 29 rules in 23 ms. Remains 51 /67 variables (removed 16) and now considering 133/146 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/67 places, 133/146 transitions.
Finished random walk after 1708 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=244 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(X(!X(X(p0)))))) U G(p1)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 5 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:02] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-20 21:33:02] [INFO ] Implicit Places using invariants in 74 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 522 ms :[(NOT p1), p0, (AND (NOT p1) p0), p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 6}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s21 1) (EQ s34 1)), p0:(AND (EQ s7 1) (EQ s14 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14278 reset in 297 ms.
Product exploration explored 100000 steps with 14265 reset in 213 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) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 10 states, 16 edges and 2 AP to 10 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 379 ms :[(NOT p1), p0, (AND (NOT p1) p0), p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 241 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 268 ms. Reduced automaton from 10 states, 16 edges and 2 AP to 10 states, 16 edges and 2 AP.
Stuttering acceptance computed with spot in 408 ms :[(NOT p1), p0, (AND (NOT p1) p0), p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 487 ms :[(NOT p1), p0, (AND (NOT p1) p0), p0, p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
// Phase 1: matrix 146 rows 60 cols
[2022-05-20 21:33:05] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-20 21:33:05] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-20 21:33:05] [INFO ] [Real]Absence check using 12 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-20 21:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:33:05] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-20 21:33:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:33:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-20 21:33:05] [INFO ] [Nat]Absence check using 12 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 21:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:33:05] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-20 21:33:06] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2022-05-20 21:33:06] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2022-05-20 21:33:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 181 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 10 states, 16 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Railroad-PT-010-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-010-LTLFireability-01 finished in 3735 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U G(X(((p1 U F(p1))||!p2))))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 5 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:06] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-20 21:33:06] [INFO ] Implicit Places using invariants in 99 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(AND (EQ s4 1) (EQ s16 1) (EQ s34 1)), p1:(AND (EQ s48 1) (EQ s55 1)), p0:(OR (AND (EQ s48 1) (EQ s55 1)) (AND (EQ s4 1) (EQ s18 1) (EQ s34 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 291 ms.
Product exploration explored 100000 steps with 4 reset in 463 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 p2) (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 866 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :1
Finished Best-First random walk after 9456 steps, including 2 resets, run visited all 1 properties in 16 ms. (steps per millisecond=591 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p1)]
Knowledge based reduction with 14 factoid took 738 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Support contains 5 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 60 cols
[2022-05-20 21:33:09] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 21:33:09] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 146 rows 60 cols
[2022-05-20 21:33:09] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-20 21:33:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 146 rows 60 cols
[2022-05-20 21:33:09] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 21:33:10] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 146/146 transitions.
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) (NOT p2)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Finished random walk after 3397 steps, including 1 resets, run visited all 2 properties in 23 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p1)]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Product exploration explored 100000 steps with 6 reset in 272 ms.
Product exploration explored 100000 steps with 3 reset in 291 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 146/146 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 60 transition count 146
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 58 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 58 transition count 144
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 17 place count 58 transition count 144
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 17 rules in 33 ms. Remains 58 /60 variables (removed 2) and now considering 144/146 (removed 2) transitions.
[2022-05-20 21:33:12] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 144 rows 58 cols
[2022-05-20 21:33:12] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-20 21:33:12] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/60 places, 144/146 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/60 places, 144/146 transitions.
Product exploration explored 100000 steps with 9 reset in 276 ms.
Stack based approach found an accepted trace after 44308 steps with 5 reset with depth 4384 and stack size 3901 in 158 ms.
FORMULA Railroad-PT-010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-02 finished in 6451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(G(p1))||G(!p1)))&&p0)))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 146
Applied a total of 2 rules in 4 ms. Remains 65 /67 variables (removed 2) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 65 cols
[2022-05-20 21:33:12] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-20 21:33:12] [INFO ] Implicit Places using invariants in 93 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 98 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), true, false, (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s60 1)), p1:(OR (NEQ s59 1) (NEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-03 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(X(X(p0)))||G(p1))&&p2)))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 2 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:13] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 21:33:13] [INFO ] Implicit Places using invariants in 56 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p2 p1), acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), 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: 1}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=p1, acceptance={} source=7 dest: 3}]], initial=5, aps=[p2:(OR (AND (EQ s8 1) (EQ s20 1) (EQ s34 1)) (AND (EQ s9 1) (EQ s34 1) (EQ s54 1))), p1:(AND (EQ s2 1) (EQ s34 1) (EQ s54 1)), p0:(AND (OR (EQ s9 0) (EQ s...], 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-04 finished in 327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((X(p1)&&p0)))&&F(p2)))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 2 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:13] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-20 21:33:13] [INFO ] Implicit Places using invariants in 88 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 91 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (AND p0 (NOT p1))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p2:(OR (EQ s7 0) (EQ s12 0) (EQ s34 0)), p0:(AND (EQ s8 1) (EQ s21 1) (EQ s34 1)), p1:(AND (EQ s7 1) (EQ s20 1) (EQ s34 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-05 finished in 298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 3 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:13] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 21:33:13] [INFO ] Implicit Places using invariants in 63 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), 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)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s7 1) (EQ s13 1) (EQ s34 1)), p1:(AND (EQ s3 1) (EQ s16 1) (EQ s34 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-06 finished in 266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(((!G(p1)&&p0) U p2))))))'
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 144
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 63 transition count 137
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 56 transition count 137
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 2 with 4 rules applied. Total rules applied 22 place count 54 transition count 135
Applied a total of 22 rules in 18 ms. Remains 54 /67 variables (removed 13) and now considering 135/146 (removed 11) transitions.
// Phase 1: matrix 135 rows 54 cols
[2022-05-20 21:33:14] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 21:33:14] [INFO ] Implicit Places using invariants in 60 ms returned [26, 27, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/67 places, 135/146 transitions.
Applied a total of 0 rules in 12 ms. Remains 51 /51 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 51/67 places, 135/146 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s34 1) (EQ s40 1)), p0:(AND (EQ s20 1) (EQ s45 1) (EQ s47 1)), p1:(OR (AND (EQ s2 1) (EQ s15 1) (EQ s27 1)) (NOT (AND (EQ s34 1) (EQ s40 1))))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2378 reset in 317 ms.
Stack based approach found an accepted trace after 240 steps with 6 reset with depth 10 and stack size 10 in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-07 finished in 552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||F(p0)))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 144
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4 place count 62 transition count 136
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 54 transition count 136
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 2 with 6 rules applied. Total rules applied 26 place count 51 transition count 133
Applied a total of 26 rules in 42 ms. Remains 51 /67 variables (removed 16) and now considering 133/146 (removed 13) transitions.
// Phase 1: matrix 133 rows 51 cols
[2022-05-20 21:33:14] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-20 21:33:14] [INFO ] Implicit Places using invariants in 109 ms returned [25, 26, 27, 46]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 112 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/67 places, 133/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 47 /47 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/67 places, 133/146 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s14 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17 reset in 366 ms.
Stack based approach found an accepted trace after 140 steps with 0 reset with depth 141 and stack size 141 in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-08 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X((X(p0)||G((F(X(p1))||p2))))))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 144
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 62 transition count 137
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 55 transition count 137
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 2 with 6 rules applied. Total rules applied 24 place count 52 transition count 134
Applied a total of 24 rules in 70 ms. Remains 52 /67 variables (removed 15) and now considering 134/146 (removed 12) transitions.
// Phase 1: matrix 134 rows 52 cols
[2022-05-20 21:33:15] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-20 21:33:15] [INFO ] Implicit Places using invariants in 85 ms returned [26, 28, 47]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/67 places, 134/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/67 places, 134/146 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s2 1) (EQ s14 1) (EQ s28 1) (EQ s17 1) (EQ s26 1) (EQ s46 1)), p0:(AND (EQ s17 1) (EQ s26 1) (EQ s46 1)), p1:(AND (EQ s2 1) (EQ s14 1) (EQ s28...], 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 11197 reset in 198 ms.
Stack based approach found an accepted trace after 802 steps with 83 reset with depth 7 and stack size 7 in 2 ms.
FORMULA Railroad-PT-010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-09 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||p1))))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 1 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:15] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-20 21:33:15] [INFO ] Implicit Places using invariants in 83 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s2 1) (EQ s34 1) (EQ s54 1)), p1:(AND (EQ s10 1) (EQ s21 1) (EQ s34 1))], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Railroad-PT-010-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-10 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(p1)&&p0))||p2)))'
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 1 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:15] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-20 21:33:15] [INFO ] Implicit Places using invariants in 65 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s11 1) (EQ s20 1) (EQ s34 1)), p0:(AND (EQ s2 1) (EQ s18 1) (EQ s34 1)), p1:(AND (EQ s2 1) (EQ s18 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 581 reset in 178 ms.
Stack based approach found an accepted trace after 721 steps with 4 reset with depth 43 and stack size 43 in 2 ms.
FORMULA Railroad-PT-010-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-11 finished in 367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F(G(X(X(p0)))))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 61 transition count 143
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 61 transition count 136
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 54 transition count 136
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 2 with 6 rules applied. Total rules applied 26 place count 51 transition count 133
Applied a total of 26 rules in 8 ms. Remains 51 /67 variables (removed 16) and now considering 133/146 (removed 13) transitions.
// Phase 1: matrix 133 rows 51 cols
[2022-05-20 21:33:16] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-20 21:33:16] [INFO ] Implicit Places using invariants in 85 ms returned [26, 27, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 86 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/67 places, 133/146 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 132
Applied a total of 2 rules in 4 ms. Remains 47 /48 variables (removed 1) and now considering 132/133 (removed 1) transitions.
// Phase 1: matrix 132 rows 47 cols
[2022-05-20 21:33:16] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 21:33:16] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 132 rows 47 cols
[2022-05-20 21:33:16] [INFO ] Computed 15 place invariants in 5 ms
[2022-05-20 21:33:16] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/67 places, 132/146 transitions.
Finished structural reductions, in 2 iterations. Remains : 47/67 places, 132/146 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Railroad-PT-010-LTLFireability-12 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 s21 1) (EQ s25 1) (EQ s44 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 191 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-010-LTLFireability-12 finished in 493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&((p1 U p2)||(G(p3)&&X(F(p4))))))))'
Support contains 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 146/146 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 146
Applied a total of 3 rules in 1 ms. Remains 64 /67 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 64 cols
[2022-05-20 21:33:16] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-20 21:33:16] [INFO ] Implicit Places using invariants in 54 ms returned [32, 33, 34, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 72 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 146/146 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/67 places, 146/146 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) (NOT p3) (NOT p4)), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (NOT p0), (OR (NOT p3) (NOT p0)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Railroad-PT-010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p3 (NOT p4)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p3 p4), acceptance={0} source=0 dest: 3}, { cond=(OR (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 8}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3 (NOT p4)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1 p3 (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1) p3 p4), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1 p3 p4), acceptance={0} source=1 dest: 4}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 8}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0} source=1 dest: 9}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 p3), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=4 dest: 4}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2), acceptance={} source=6 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 p2), acceptance={0} source=9 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=9 dest: 9}]], initial=7, aps=[p0:(AND (EQ s4 1) (EQ s15 1) (EQ s34 1)), p3:(AND (EQ s2 1) (EQ s14 1) (EQ s34 1)), p4:(AND (EQ s8 1) (EQ s13 1) (EQ s34 1)), p2:(AND (EQ s4 1) (EQ s20 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-010-LTLFireability-15 finished in 578 ms.
All properties solved by simple procedures.
Total runtime 16444 ms.

BK_STOP 1653082397404

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

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