Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 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 CircularTrains-PT-012-00
FORMULA_NAME CircularTrains-PT-012-01
FORMULA_NAME CircularTrains-PT-012-02
FORMULA_NAME CircularTrains-PT-012-03
FORMULA_NAME CircularTrains-PT-012-04
FORMULA_NAME CircularTrains-PT-012-05
FORMULA_NAME CircularTrains-PT-012-06
FORMULA_NAME CircularTrains-PT-012-07
FORMULA_NAME CircularTrains-PT-012-08
FORMULA_NAME CircularTrains-PT-012-09
FORMULA_NAME CircularTrains-PT-012-10
FORMULA_NAME CircularTrains-PT-012-11
FORMULA_NAME CircularTrains-PT-012-12
FORMULA_NAME CircularTrains-PT-012-13
FORMULA_NAME CircularTrains-PT-012-14
FORMULA_NAME CircularTrains-PT-012-15

=== Now, execution of the tool begins

BK_START 1620558695357

Running Version 0
[2021-05-09 11:11:36] [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]
[2021-05-09 11:11:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 11:11:36] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2021-05-09 11:11:36] [INFO ] Transformed 24 places.
[2021-05-09 11:11:36] [INFO ] Transformed 12 transitions.
[2021-05-09 11:11:36] [INFO ] Parsed PT model containing 24 places and 12 transitions in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 11:11:36] [INFO ] Initial state test concluded for 1 properties.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:36] [INFO ] Computed 13 place invariants in 6 ms
[2021-05-09 11:11:36] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:36] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-09 11:11:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:36] [INFO ] Computed 13 place invariants in 5 ms
[2021-05-09 11:11:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 12/12 transitions.
[2021-05-09 11:11:37] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 11:11:37] [INFO ] Flatten gal took : 14 ms
FORMULA CircularTrains-PT-012-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 11:11:37] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:11:37] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=684 ) properties (out of 16) seen :15
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:37] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-09 11:11:37] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2021-05-09 11:11:37] [INFO ] Initial state test concluded for 1 properties.
FORMULA CircularTrains-PT-012-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(((X(p1)&&F(p2))||X(G(p1))||p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:37] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-09 11:11:37] [INFO ] Implicit Places using invariants in 26 ms returned [5, 15, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:37] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 11:11:37] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:37] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 11:11:37] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CircularTrains-PT-012-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s15 1)), p2:(AND (GEQ s0 1) (GEQ s18 1) (OR (LT s10 1) (LT s15 1))), p1:(OR (LT s0 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7510 reset in 168 ms.
Product exploration explored 100000 steps with 7532 reset in 146 ms.
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 7557 reset in 91 ms.
Product exploration explored 100000 steps with 7547 reset in 138 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 12/12 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 21 transition count 12
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-09 11:11:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:38] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 12/12 transitions.
Product exploration explored 100000 steps with 7542 reset in 231 ms.
Product exploration explored 100000 steps with 7613 reset in 139 ms.
[2021-05-09 11:11:39] [INFO ] Flatten gal took : 3 ms
[2021-05-09 11:11:39] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:39] [INFO ] Time to serialize gal into /tmp/LTL2694611562777328882.gal : 1 ms
[2021-05-09 11:11:39] [INFO ] Time to serialize properties into /tmp/LTL14373248386090749313.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2694611562777328882.gal, -t, CGAL, -LTL, /tmp/LTL14373248386090749313.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2694611562777328882.gal -t CGAL -LTL /tmp/LTL14373248386090749313.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G((("((F6<1)||(Section_5<1))")||(X(G("((Section_4<1)||(F5<1))"))))||((X("((Section_4<1)||(F5<1))"))&&(F("(((Section_4>=1)&&(F5>=1))&&((F6<1)||(Section_5<1)))"))))))))
Formula 0 simplified : !XXG("((F6<1)||(Section_5<1))" | XG"((Section_4<1)||(F5<1))" | (X"((Section_4<1)||(F5<1))" & F"(((Section_4>=1)&&(F5>=1))&&((F6<1)||(Section_5<1)))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
24 unique states visited
0 strongly connected components in search stack
24 transitions explored
23 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.034941,18124,1,0,63,4298,36,25,485,4579,209
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-012-00 finished in 2086 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:39] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-09 11:11:39] [INFO ] Implicit Places using invariants in 23 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:39] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s8 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-01 finished in 139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0)) U p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:39] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-09 11:11:39] [INFO ] Implicit Places using invariants in 26 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
[2021-05-09 11:11:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:39] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 12/12 transitions.
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 20 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 18 transition count 8
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 8 place count 16 transition count 8
Applied a total of 8 rules in 2 ms. Remains 16 /20 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 16 cols
[2021-05-09 11:11:39] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:39] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 16 cols
[2021-05-09 11:11:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 11:11:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/24 places, 8/12 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s6 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 76 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA CircularTrains-PT-012-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-02 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:39] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:39] [INFO ] Implicit Places using invariants in 24 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 25 ms to find 4 implicit places.
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:39] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-09 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:39] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-012-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s12 1) (LT s18 1)), p0:(OR (LT s12 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22811 reset in 74 ms.
Product exploration explored 100000 steps with 22775 reset in 149 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22793 reset in 77 ms.
Product exploration explored 100000 steps with 22607 reset in 143 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 12/12 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-09 11:11:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:40] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:40] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 12/12 transitions.
Product exploration explored 100000 steps with 24175 reset in 147 ms.
Product exploration explored 100000 steps with 23989 reset in 103 ms.
[2021-05-09 11:11:40] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:40] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:40] [INFO ] Time to serialize gal into /tmp/LTL17711689869125016168.gal : 1 ms
[2021-05-09 11:11:40] [INFO ] Time to serialize properties into /tmp/LTL14730767375393461510.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17711689869125016168.gal, -t, CGAL, -LTL, /tmp/LTL14730767375393461510.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17711689869125016168.gal -t CGAL -LTL /tmp/LTL14730767375393461510.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((Section_3<1)||(F4<1))")||(G("((Section_3<1)||(F4<1))"))))))
Formula 0 simplified : !XF("((Section_3<1)||(F4<1))" | G"((Section_3<1)||(F4<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.018784,16596,1,0,54,2557,20,11,426,2078,106
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-012-04 finished in 1168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:40] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:40] [INFO ] Implicit Places using invariants in 24 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 25 ms to find 4 implicit places.
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:40] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:41] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-09 11:11:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22665 reset in 60 ms.
Product exploration explored 100000 steps with 22746 reset in 65 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22802 reset in 62 ms.
Product exploration explored 100000 steps with 22629 reset in 64 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 12/12 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2021-05-09 11:11:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:41] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-09 11:11:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 12/12 transitions.
Product exploration explored 100000 steps with 23954 reset in 83 ms.
Product exploration explored 100000 steps with 24122 reset in 86 ms.
[2021-05-09 11:11:41] [INFO ] Flatten gal took : 2 ms
[2021-05-09 11:11:41] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:41] [INFO ] Time to serialize gal into /tmp/LTL16085239343574505366.gal : 1 ms
[2021-05-09 11:11:41] [INFO ] Time to serialize properties into /tmp/LTL14206055290726845245.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16085239343574505366.gal, -t, CGAL, -LTL, /tmp/LTL14206055290726845245.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16085239343574505366.gal -t CGAL -LTL /tmp/LTL14206055290726845245.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((F7<1)||(Section_6<1))"))))
Formula 0 simplified : !XF"((F7<1)||(Section_6<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.017065,16476,1,0,54,2514,20,11,425,2104,106
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-012-05 finished in 806 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:41] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:41] [INFO ] Implicit Places using invariants in 32 ms returned [15, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
[2021-05-09 11:11:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:41] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 11:11:41] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 19 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 transition count 9
Applied a total of 6 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:41] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:41] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:41] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-012-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s9 1)), p0:(AND (GEQ s4 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25860 reset in 70 ms.
Product exploration explored 100000 steps with 25809 reset in 78 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25716 reset in 72 ms.
Product exploration explored 100000 steps with 25840 reset in 72 ms.
[2021-05-09 11:11:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:42] [INFO ] Time to serialize gal into /tmp/LTL3273363700160401746.gal : 0 ms
[2021-05-09 11:11:42] [INFO ] Time to serialize properties into /tmp/LTL7377119657963408488.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3273363700160401746.gal, -t, CGAL, -LTL, /tmp/LTL7377119657963408488.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3273363700160401746.gal -t CGAL -LTL /tmp/LTL7377119657963408488.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((Section_11>=1)&&(F12>=1))"))||("((F2>=1)&&(Section_1>=1))"))))
Formula 0 simplified : !F("((F2>=1)&&(Section_1>=1))" | G"((Section_11>=1)&&(F12>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.016378,16544,1,0,37,1326,28,8,397,939,112
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-012-06 finished in 559 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:42] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:42] [INFO ] Implicit Places using invariants in 19 ms returned [15, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 19 ms to find 3 implicit places.
[2021-05-09 11:11:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:42] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 11:11:42] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 12/12 transitions.
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 21 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 transition count 9
Applied a total of 6 rules in 1 ms. Remains 18 /21 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:42] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-09 11:11:42] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:42] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:42] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16242 reset in 81 ms.
Product exploration explored 100000 steps with 16279 reset in 75 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16372 reset in 66 ms.
Product exploration explored 100000 steps with 16306 reset in 80 ms.
[2021-05-09 11:11:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 11:11:42] [INFO ] Time to serialize gal into /tmp/LTL13315696215291359509.gal : 0 ms
[2021-05-09 11:11:42] [INFO ] Time to serialize properties into /tmp/LTL1726831890907262367.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13315696215291359509.gal, -t, CGAL, -LTL, /tmp/LTL1726831890907262367.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13315696215291359509.gal -t CGAL -LTL /tmp/LTL1726831890907262367.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((F2>=1)&&(Section_1>=1))"))))
Formula 0 simplified : !GF"((F2>=1)&&(Section_1>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.020722,16752,1,0,39,1963,24,1,405,1330,99
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CircularTrains-PT-012-07 finished in 565 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:42] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-09 11:11:42] [INFO ] Implicit Places using invariants in 21 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
[2021-05-09 11:11:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:42] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 20 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 18 transition count 9
Applied a total of 6 rules in 1 ms. Remains 18 /21 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:42] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 11:11:42] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:42] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-09 11:11:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s17 1) (OR (LT s12 1) (LT s16 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 88 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA CircularTrains-PT-012-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-08 finished in 216 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:43] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 36 ms returned [5, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
// Phase 1: matrix 12 rows 22 cols
[2021-05-09 11:11:43] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-09 11:11:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 22/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 22 cols
[2021-05-09 11:11:43] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CircularTrains-PT-012-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (LT s13 1) (LT s19 1)), p1:(AND (GEQ s14 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-09 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:43] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 21 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
[2021-05-09 11:11:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:43] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 19 transition count 9
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 6 place count 17 transition count 9
Applied a total of 6 rules in 1 ms. Remains 17 /20 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 17 cols
[2021-05-09 11:11:43] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 9 rows 17 cols
[2021-05-09 11:11:43] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(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}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s8 1)), p1:(AND (GEQ s7 1) (GEQ s10 1) (OR (LT s1 1) (LT s6 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 4 reset in 92 ms.
Stack based approach found an accepted trace after 99 steps with 10 reset with depth 32 and stack size 32 in 0 ms.
FORMULA CircularTrains-PT-012-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-10 finished in 264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:43] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 16 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 16 ms to find 4 implicit places.
[2021-05-09 11:11:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2021-05-09 11:11:43] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 12/12 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 20 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 17 transition count 9
Applied a total of 6 rules in 1 ms. Remains 17 /20 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 17 cols
[2021-05-09 11:11:43] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 9 rows 17 cols
[2021-05-09 11:11:43] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-012-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s4 1)), p1:(AND (GEQ s3 1) (GEQ s8 1) (GEQ s9 1) (GEQ s13 1))], nbAcceptance=2, 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 89 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA CircularTrains-PT-012-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-13 finished in 191 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)&&(p0 U !p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:43] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 24 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
[2021-05-09 11:11:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:43] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 20 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 18 transition count 9
Applied a total of 6 rules in 1 ms. Remains 18 /21 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:43] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 9 rows 18 cols
[2021-05-09 11:11:43] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (OR p1 p0), p0]
Running random walk in product with property : CircularTrains-PT-012-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s12 1) (GEQ s16 1)), p1:(OR (LT s7 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-14 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(X(!p0))&&(!p0 U !p1)&&(p2||G(!p1))) U X(!p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2021-05-09 11:11:43] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Implicit Places using invariants in 13 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:43] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 11:11:43] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 21 cols
[2021-05-09 11:11:43] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 11:11:43] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, (AND p1 p0), (AND p1 p0), true, p1]
Running random walk in product with property : CircularTrains-PT-012-15 automaton TGBA [mat=[[{ cond=(OR (AND p1 p0) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s11 1)), p0:(OR (LT s13 1) (LT s18 1)), p2:(AND (GEQ s3 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA CircularTrains-PT-012-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-15 finished in 261 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620558704448

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CircularTrains-PT-012"
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 CircularTrains-PT-012, 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 r045-oct2-162038291300053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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