Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422400303.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422400303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 12K Apr 13 08:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 13 08:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 08:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 08:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 13 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 13 08:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:43 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 Philosophers-PT-000005-LTLFireability-00
FORMULA_NAME Philosophers-PT-000005-LTLFireability-01
FORMULA_NAME Philosophers-PT-000005-LTLFireability-02
FORMULA_NAME Philosophers-PT-000005-LTLFireability-03
FORMULA_NAME Philosophers-PT-000005-LTLFireability-04
FORMULA_NAME Philosophers-PT-000005-LTLFireability-05
FORMULA_NAME Philosophers-PT-000005-LTLFireability-06
FORMULA_NAME Philosophers-PT-000005-LTLFireability-07
FORMULA_NAME Philosophers-PT-000005-LTLFireability-08
FORMULA_NAME Philosophers-PT-000005-LTLFireability-09
FORMULA_NAME Philosophers-PT-000005-LTLFireability-10
FORMULA_NAME Philosophers-PT-000005-LTLFireability-11
FORMULA_NAME Philosophers-PT-000005-LTLFireability-12
FORMULA_NAME Philosophers-PT-000005-LTLFireability-13
FORMULA_NAME Philosophers-PT-000005-LTLFireability-14
FORMULA_NAME Philosophers-PT-000005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716994032712

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000005
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 14:47:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:47:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:47:15] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-29 14:47:15] [INFO ] Transformed 25 places.
[2024-05-29 14:47:15] [INFO ] Transformed 25 transitions.
[2024-05-29 14:47:15] [INFO ] Found NUPN structural information;
[2024-05-29 14:47:15] [INFO ] Parsed PT model containing 25 places and 25 transitions and 80 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000005-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 13 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 14:47:16] [INFO ] Computed 10 invariants in 7 ms
[2024-05-29 14:47:16] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-29 14:47:16] [INFO ] Invariant cache hit.
[2024-05-29 14:47:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-29 14:47:16] [INFO ] Invariant cache hit.
[2024-05-29 14:47:16] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 25/25 places, 25/25 transitions.
Support contains 25 out of 25 places after structural reductions.
[2024-05-29 14:47:16] [INFO ] Flatten gal took : 34 ms
[2024-05-29 14:47:16] [INFO ] Flatten gal took : 14 ms
[2024-05-29 14:47:16] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 37 steps, including 1 resets, run visited all 19 properties in 30 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Philosophers-PT-000005-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-29 14:47:17] [INFO ] Invariant cache hit.
[2024-05-29 14:47:17] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 14:47:17] [INFO ] Invariant cache hit.
[2024-05-29 14:47:17] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-29 14:47:17] [INFO ] Invariant cache hit.
[2024-05-29 14:47:17] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 25/25 places, 25/25 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s0 1) (EQ s5 1)) (AND (EQ s4 1) (EQ s9 1)) (AND (EQ s1 1) (EQ s6 1)) (AND (EQ s3 1) (EQ s8 1)) (AND (EQ s2 1) (EQ s7 1))), p1:(AND (OR (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 510 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 27 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000005-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000005-LTLFireability-00 finished in 1484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p0)))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-29 14:47:18] [INFO ] Invariant cache hit.
[2024-05-29 14:47:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 14:47:18] [INFO ] Invariant cache hit.
[2024-05-29 14:47:19] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-29 14:47:19] [INFO ] Invariant cache hit.
[2024-05-29 14:47:19] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s9 1) (EQ s13 1)) (AND (EQ s5 1) (EQ s10 1)) (AND (EQ s6 1) (EQ s11 1)) (AND (EQ s7 1) (EQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-01 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(p2)||p0))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-29 14:47:19] [INFO ] Invariant cache hit.
[2024-05-29 14:47:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 14:47:19] [INFO ] Invariant cache hit.
[2024-05-29 14:47:19] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 14:47:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:47:19] [INFO ] Invariant cache hit.
[2024-05-29 14:47:19] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (EQ s7 0) (EQ s17 0)) (OR (EQ s6 0) (EQ s18 0)) (OR (EQ s8 0) (EQ s20 0)) (OR (EQ s9 0) (EQ s16 0)) (OR (EQ s5 0) (EQ s15 0))), p0:(OR (AND (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14032 reset in 707 ms.
Product exploration explored 100000 steps with 14030 reset in 472 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2))))]
Knowledge based reduction with 6 factoid took 500 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 281 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:47:22] [INFO ] Invariant cache hit.
[2024-05-29 14:47:22] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) p1 p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000005-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000005-LTLFireability-02 finished in 3093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&G(p2)&&X(F(!p1)))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-29 14:47:22] [INFO ] Invariant cache hit.
[2024-05-29 14:47:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 14:47:22] [INFO ] Invariant cache hit.
[2024-05-29 14:47:22] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-29 14:47:22] [INFO ] Invariant cache hit.
[2024-05-29 14:47:22] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) p1), true, (NOT p2), p1, (NOT p2)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s0 1) (EQ s5 1)) (AND (EQ s4 1) (EQ s9 1)) (AND (EQ s1 1) (EQ s6 1)) (AND (EQ s3 1) (EQ s8 1)) (AND (EQ s2 1) (EQ s7 1))), p0:(OR (AND (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-03 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-29 14:47:22] [INFO ] Invariant cache hit.
[2024-05-29 14:47:22] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 14:47:22] [INFO ] Invariant cache hit.
[2024-05-29 14:47:23] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 14:47:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:47:23] [INFO ] Invariant cache hit.
[2024-05-29 14:47:23] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 111 ms :[p0, p0]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s4 1) (EQ s8 1)) (AND (EQ s1 1) (EQ s5 1)) (AND (EQ s3 1) (EQ s7 1)) (AND (EQ s2 1) (EQ s6 1)) (AND (EQ s0 1) (EQ s9 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 15638 reset in 319 ms.
Stack based approach found an accepted trace after 169 steps with 29 reset with depth 5 and stack size 5 in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-05 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 22
Applied a total of 6 rules in 11 ms. Remains 22 /25 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-29 14:47:23] [INFO ] Computed 10 invariants in 2 ms
[2024-05-29 14:47:23] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 14:47:23] [INFO ] Invariant cache hit.
[2024-05-29 14:47:23] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-29 14:47:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:47:23] [INFO ] Invariant cache hit.
[2024-05-29 14:47:23] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/25 places, 22/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 22/25 places, 22/25 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s5 1)), p1:(OR (EQ s0 0) (EQ s5 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 61 steps with 7 reset in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-08 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 23
Applied a total of 4 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-29 14:47:24] [INFO ] Computed 10 invariants in 8 ms
[2024-05-29 14:47:24] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 14:47:24] [INFO ] Invariant cache hit.
[2024-05-29 14:47:24] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 14:47:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:47:24] [INFO ] Invariant cache hit.
[2024-05-29 14:47:24] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/25 places, 23/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 23/25 places, 23/25 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-10 automaton TGBA Formula[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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s10 1)), p1:(AND (EQ s4 1) (EQ s9 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 24 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-10 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 22
Applied a total of 6 rules in 5 ms. Remains 22 /25 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-29 14:47:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 14:47:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 14:47:24] [INFO ] Invariant cache hit.
[2024-05-29 14:47:24] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 14:47:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:47:24] [INFO ] Invariant cache hit.
[2024-05-29 14:47:24] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/25 places, 22/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 22/25 places, 22/25 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-11 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(X(G(p1)))) U (X(p3)&&p2)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 14:47:24] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 14:47:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 14:47:24] [INFO ] Invariant cache hit.
[2024-05-29 14:47:24] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-29 14:47:24] [INFO ] Invariant cache hit.
[2024-05-29 14:47:24] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (NOT p3), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s8 1) (EQ s0 1) (EQ s5 1)), p0:(AND (EQ s4 1) (EQ s8 1)), p3:(AND (EQ s0 1) (EQ s5 1)), p1:(AND (EQ s5 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 9 steps with 4 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-12 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 22
Applied a total of 6 rules in 4 ms. Remains 22 /25 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-29 14:47:25] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 14:47:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 14:47:25] [INFO ] Invariant cache hit.
[2024-05-29 14:47:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-29 14:47:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:47:25] [INFO ] Invariant cache hit.
[2024-05-29 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/25 places, 22/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 22/25 places, 22/25 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-13 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 14:47:25] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 14:47:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 14:47:25] [INFO ] Invariant cache hit.
[2024-05-29 14:47:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 14:47:25] [INFO ] Invariant cache hit.
[2024-05-29 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(EQ s19 1), p1:(AND (EQ s5 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-LTLFireability-14 finished in 366 ms.
All properties solved by simple procedures.
Total runtime 10244 ms.

BK_STOP 1716994046865

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Philosophers-PT-000005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-PT-000005, 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 r285-smll-171654422400303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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