Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875700709.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 Eratosthenes-PT-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875700709
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K 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 99K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 18:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 18:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 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 126K 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 Eratosthenes-PT-100-00
FORMULA_NAME Eratosthenes-PT-100-01
FORMULA_NAME Eratosthenes-PT-100-02
FORMULA_NAME Eratosthenes-PT-100-03
FORMULA_NAME Eratosthenes-PT-100-04
FORMULA_NAME Eratosthenes-PT-100-05
FORMULA_NAME Eratosthenes-PT-100-06
FORMULA_NAME Eratosthenes-PT-100-07
FORMULA_NAME Eratosthenes-PT-100-08
FORMULA_NAME Eratosthenes-PT-100-09
FORMULA_NAME Eratosthenes-PT-100-10
FORMULA_NAME Eratosthenes-PT-100-11
FORMULA_NAME Eratosthenes-PT-100-12
FORMULA_NAME Eratosthenes-PT-100-13
FORMULA_NAME Eratosthenes-PT-100-14
FORMULA_NAME Eratosthenes-PT-100-15

=== Now, execution of the tool begins

BK_START 1620659284563

Running Version 0
[2021-05-10 15:08:06] [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-10 15:08:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:08:06] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-10 15:08:06] [INFO ] Transformed 99 places.
[2021-05-10 15:08:06] [INFO ] Transformed 283 transitions.
[2021-05-10 15:08:06] [INFO ] Parsed PT model containing 99 places and 283 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:08:06] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA Eratosthenes-PT-100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 74 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 64 transition count 201
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 64 transition count 201
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 157 place count 64 transition count 64
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 190 place count 31 transition count 31
Iterating global reduction 0 with 33 rules applied. Total rules applied 223 place count 31 transition count 31
Applied a total of 223 rules in 19 ms. Remains 31 /74 variables (removed 43) and now considering 31/211 (removed 180) transitions.
// Phase 1: matrix 31 rows 31 cols
[2021-05-10 15:08:06] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-10 15:08:06] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 31 rows 31 cols
[2021-05-10 15:08:06] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-10 15:08:06] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 31 cols
[2021-05-10 15:08:06] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:06] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/74 places, 31/211 transitions.
[2021-05-10 15:08:06] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-10 15:08:06] [INFO ] Flatten gal took : 20 ms
FORMULA Eratosthenes-PT-100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:08:06] [INFO ] Flatten gal took : 5 ms
[2021-05-10 15:08:06] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 76 steps, including 1 resets, run visited all 29 properties in 2 ms. (steps per millisecond=38 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U G((p1||X(!p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 4 transition count 4
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 4 transition count 4
Applied a total of 54 rules in 1 ms. Remains 4 /31 variables (removed 27) and now considering 4/31 (removed 27) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:06] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:06] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:06] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/31 places, 4/31 transitions.
Stuttering acceptance computed with spot in 224 ms :[false, false, false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s2 1), p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 302 steps with 4 reset in 6 ms.
FORMULA Eratosthenes-PT-100-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-00 finished in 311 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 2 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3 transition count 3
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 2 transition count 2
Applied a total of 55 rules in 6 ms. Remains 2 /31 variables (removed 29) and now considering 2/31 (removed 29) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:07] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:07] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-10 15:08:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:07] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/31 places, 2/31 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-01 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:(GEQ s1 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-01 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 5 transition count 5
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 4 transition count 4
Applied a total of 51 rules in 2 ms. Remains 4 /31 variables (removed 27) and now considering 4/31 (removed 27) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:07] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:07] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-10 15:08:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:07] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/31 places, 4/31 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-100-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LT s2 1) (LT s3 1)), p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 37473 reset in 192 ms.
Product exploration explored 100000 steps with 37490 reset in 117 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Eratosthenes-PT-100-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-100-02 finished in 462 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 4 transition count 4
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 3 transition count 3
Applied a total of 53 rules in 1 ms. Remains 3 /31 variables (removed 28) and now considering 3/31 (removed 28) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:07] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:07] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-10 15:08:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:08:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:07] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/31 places, 3/31 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-03 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=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s0 1), p1:(AND (LT s2 1) (LT s1 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 25962 reset in 107 ms.
Product exploration explored 100000 steps with 25977 reset in 136 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 25976 reset in 57 ms.
Product exploration explored 100000 steps with 25956 reset in 66 ms.
[2021-05-10 15:08:08] [INFO ] Flatten gal took : 1 ms
[2021-05-10 15:08:08] [INFO ] Flatten gal took : 1 ms
[2021-05-10 15:08:08] [INFO ] Time to serialize gal into /tmp/LTL3447392995337596857.gal : 1 ms
[2021-05-10 15:08:08] [INFO ] Time to serialize properties into /tmp/LTL13619184420301176140.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/LTL3447392995337596857.gal, -t, CGAL, -LTL, /tmp/LTL13619184420301176140.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/LTL3447392995337596857.gal -t CGAL -LTL /tmp/LTL13619184420301176140.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(p88<1)")))&&(F("((p40<1)&&(p93<1))")))))
Formula 0 simplified : !G(FG"(p88<1)" & F"((p40<1)&&(p93<1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
10 unique states visited
0 strongly connected components in search stack
10 transitions explored
4 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.016301,16864,1,0,17,65,37,20,56,113,92
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-100-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Eratosthenes-PT-100-03 finished in 766 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(G(!p0)&&(G(p1)||X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 5 transition count 5
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 5 transition count 5
Applied a total of 52 rules in 1 ms. Remains 5 /31 variables (removed 26) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:08] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:08] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-10 15:08:08] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/31 places, 5/31 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (OR p0 (AND (NOT p1) (NOT p2))), (NOT p0), p0, true]
Running random walk in product with property : Eratosthenes-PT-100-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 5}, { cond=p0, acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(GEQ s4 1), p2:(LT s2 1), p1:(AND (GEQ s1 1) (GEQ s3 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-04 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((((p1 U (p2||G(p1))) U (((p1 U (p2||G(p1)))&&X(p3))||G(p4)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 4 transition count 4
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 4 transition count 4
Applied a total of 54 rules in 0 ms. Remains 4 /31 variables (removed 27) and now considering 4/31 (removed 27) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:08] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/31 places, 4/31 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), true, (NOT p4), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p2) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-100-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p4) (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 p4 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p4) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p4 (NOT p2) p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={} source=3 dest: 2}, { cond=p4, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p4 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p4) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p4) p2 (NOT p3)) (AND (NOT p4) p1 (NOT p3))), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p4 p2 (NOT p3)) (AND p4 p1 (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(AND p4 (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p4 (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s1 1) (LT s3 1)), p4:(OR (LT s2 1) (AND (LT s3 1) (LT s2 1))), p2:(AND (LT s3 1) (LT s2 1)), p1:(LT s2 1), p3:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][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 Eratosthenes-PT-100-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-05 finished in 272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p1)||(p2&&X(p3))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 6 transition count 6
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 6 transition count 6
Applied a total of 50 rules in 0 ms. Remains 6 /31 variables (removed 25) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:08] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:08:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/31 places, 6/31 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : Eratosthenes-PT-100-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p3:(OR (LT s1 1) (LT s3 1)), p0:(OR (LT s2 1) (LT s4 1)), p1:(GEQ s1 1), p2:(OR (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 12 steps with 3 reset in 0 ms.
FORMULA Eratosthenes-PT-100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-11 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1)||X((p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 5 transition count 5
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 5 transition count 5
Applied a total of 52 rules in 0 ms. Remains 5 /31 variables (removed 26) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:09] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:09] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:09] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/31 places, 5/31 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-100-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1 p3) (AND p1 (NOT p3) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p3) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p3) p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s2 1), p1:(LT s3 1), p3:(AND (OR (LT s2 1) (LT s1 1)) (LT s4 1)), p2:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 Eratosthenes-PT-100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-13 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G((X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 5 transition count 5
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 5 transition count 5
Applied a total of 52 rules in 1 ms. Remains 5 /31 variables (removed 26) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:09] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:09] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:09] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/31 places, 5/31 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s4 1)), p2:(AND (GEQ s1 1) (GEQ s4 1)), p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-100-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-14 finished in 128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((X(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 31/31 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 5 transition count 5
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 5 transition count 5
Applied a total of 52 rules in 1 ms. Remains 5 /31 variables (removed 26) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:08:09] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:09] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:08:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:08:09] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/31 places, 5/31 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-100-15 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s1 1)), p2:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 76 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-15 finished in 144 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620659291832

--------------------
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="Eratosthenes-PT-100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Eratosthenes-PT-100, 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 r083-tall-162048875700709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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