fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950100212
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Philosophers-PT-000050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
375.720 17375.00 26525.00 320.30 FFFFFFTTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950100212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Philosophers-PT-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 60K Feb 25 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 387K Feb 25 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K Feb 25 13:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Feb 25 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 298K Feb 25 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 88K Feb 25 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 623K Feb 25 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 109K Mar 5 18:23 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-000050-LTLFireability-00
FORMULA_NAME Philosophers-PT-000050-LTLFireability-01
FORMULA_NAME Philosophers-PT-000050-LTLFireability-02
FORMULA_NAME Philosophers-PT-000050-LTLFireability-03
FORMULA_NAME Philosophers-PT-000050-LTLFireability-04
FORMULA_NAME Philosophers-PT-000050-LTLFireability-05
FORMULA_NAME Philosophers-PT-000050-LTLFireability-06
FORMULA_NAME Philosophers-PT-000050-LTLFireability-07
FORMULA_NAME Philosophers-PT-000050-LTLFireability-08
FORMULA_NAME Philosophers-PT-000050-LTLFireability-09
FORMULA_NAME Philosophers-PT-000050-LTLFireability-10
FORMULA_NAME Philosophers-PT-000050-LTLFireability-11
FORMULA_NAME Philosophers-PT-000050-LTLFireability-12
FORMULA_NAME Philosophers-PT-000050-LTLFireability-13
FORMULA_NAME Philosophers-PT-000050-LTLFireability-14
FORMULA_NAME Philosophers-PT-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679467094302

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:38:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:38:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:38:16] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-22 06:38:16] [INFO ] Transformed 250 places.
[2023-03-22 06:38:16] [INFO ] Transformed 250 transitions.
[2023-03-22 06:38:16] [INFO ] Found NUPN structural information;
[2023-03-22 06:38:16] [INFO ] Parsed PT model containing 250 places and 250 transitions and 800 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-PT-000050-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2023-03-22 06:38:16] [INFO ] Computed 100 place invariants in 23 ms
[2023-03-22 06:38:16] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-22 06:38:16] [INFO ] Invariant cache hit.
[2023-03-22 06:38:17] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-22 06:38:17] [INFO ] Invariant cache hit.
[2023-03-22 06:38:17] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2023-03-22 06:38:17] [INFO ] Flatten gal took : 59 ms
[2023-03-22 06:38:17] [INFO ] Flatten gal took : 25 ms
[2023-03-22 06:38:17] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 1662 steps, including 0 resets, run visited all 25 properties in 179 ms. (steps per millisecond=9 )
FORMULA Philosophers-PT-000050-LTLFireability-08 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:18] [INFO ] Invariant cache hit.
[2023-03-22 06:38:18] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-22 06:38:18] [INFO ] Invariant cache hit.
[2023-03-22 06:38:18] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-22 06:38:18] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 06:38:18] [INFO ] Invariant cache hit.
[2023-03-22 06:38:18] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s98 1) (EQ s155 1)) (AND (EQ s55 1) (EQ s103 1)) (AND (EQ s60 1) (EQ s102 1)) (AND (EQ s91 1) (EQ s132 1)) (AND (EQ s50 1) (EQ s108 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 48137 steps with 50 reset in 335 ms.
FORMULA Philosophers-PT-000050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-00 finished in 1182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((F(p1)||G(p2)))&&p0))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:19] [INFO ] Invariant cache hit.
[2023-03-22 06:38:19] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 06:38:19] [INFO ] Invariant cache hit.
[2023-03-22 06:38:19] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-22 06:38:19] [INFO ] Invariant cache hit.
[2023-03-22 06:38:19] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 485 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s98 0) (EQ s155 0)) (OR (EQ s55 0) (EQ s103 0)) (OR (EQ s60 0) (EQ s102 0)) (OR (EQ s91 0) (EQ s132 0)) (OR (EQ s50 0) (EQ s108 0)) (OR (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 254 reset in 722 ms.
Stack based approach found an accepted trace after 156 steps with 0 reset with depth 157 and stack size 157 in 3 ms.
FORMULA Philosophers-PT-000050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-01 finished in 1455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 22 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:20] [INFO ] Invariant cache hit.
[2023-03-22 06:38:21] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-22 06:38:21] [INFO ] Invariant cache hit.
[2023-03-22 06:38:21] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-22 06:38:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 06:38:21] [INFO ] Invariant cache hit.
[2023-03-22 06:38:21] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-02 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 s1 0) (EQ s3 0) (EQ s5 0) (EQ s7 0) (EQ s9 0) (EQ s11 0) (EQ s13 0) (EQ s15 0) (EQ s17 0) (EQ s19 0) (EQ s21 0) (EQ s23 0) (EQ s25 0) (EQ s27 ...], 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 22 reset in 451 ms.
Stack based approach found an accepted trace after 197 steps with 0 reset with depth 198 and stack size 198 in 2 ms.
FORMULA Philosophers-PT-000050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-02 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:22] [INFO ] Invariant cache hit.
[2023-03-22 06:38:22] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-22 06:38:22] [INFO ] Invariant cache hit.
[2023-03-22 06:38:22] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-22 06:38:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 06:38:22] [INFO ] Invariant cache hit.
[2023-03-22 06:38:22] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 503 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s96 1) (EQ s196 1)) (AND (EQ s60 1) (EQ s167 1)) (AND (EQ s74 1) (EQ s162 1)) (AND (EQ s81 1) (EQ s185 1)) (AND (EQ s70 1) (EQ s181 1)) (A...], 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 1394 steps with 0 reset in 13 ms.
FORMULA Philosophers-PT-000050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-03 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:22] [INFO ] Invariant cache hit.
[2023-03-22 06:38:22] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-22 06:38:22] [INFO ] Invariant cache hit.
[2023-03-22 06:38:22] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-22 06:38:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 06:38:22] [INFO ] Invariant cache hit.
[2023-03-22 06:38:23] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (NEQ s68 1) (NEQ s210 1)) (OR (NEQ s59 1) (NEQ s220 1)) (OR (NEQ s73 1) (NEQ s207 1)) (OR (NEQ s69 1) (NEQ s234 1)) (OR (NEQ s85 1) (NEQ s247 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 198 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-000050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-04 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(((!p1&&X(F(!p1)))||G(F(!p1)))))))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:23] [INFO ] Invariant cache hit.
[2023-03-22 06:38:23] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 06:38:23] [INFO ] Invariant cache hit.
[2023-03-22 06:38:23] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-22 06:38:23] [INFO ] Invariant cache hit.
[2023-03-22 06:38:23] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s96 0) (EQ s196 0)) (OR (EQ s60 0) (EQ s167 0)) (OR (EQ s74 0) (EQ s162 0)) (OR (EQ s81 0) (EQ s185 0)) (OR (EQ s70 0) (EQ s181 0)) (OR (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25935 reset in 1050 ms.
Stack based approach found an accepted trace after 3357 steps with 943 reset with depth 127 and stack size 127 in 40 ms.
FORMULA Philosophers-PT-000050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-05 finished in 1718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X(G(!p0)))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:25] [INFO ] Invariant cache hit.
[2023-03-22 06:38:25] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-22 06:38:25] [INFO ] Invariant cache hit.
[2023-03-22 06:38:25] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-22 06:38:25] [INFO ] Invariant cache hit.
[2023-03-22 06:38:25] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, p0, p0, p0]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s54 1) (EQ s217 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2909 steps with 1 reset in 12 ms.
FORMULA Philosophers-PT-000050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-09 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((F(p1)&&p0))))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:25] [INFO ] Invariant cache hit.
[2023-03-22 06:38:25] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-22 06:38:25] [INFO ] Invariant cache hit.
[2023-03-22 06:38:26] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-22 06:38:26] [INFO ] Invariant cache hit.
[2023-03-22 06:38:26] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s96 1) (EQ s239 1)), p0:(AND (EQ s96 1) (EQ s239 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14245 steps with 25 reset in 52 ms.
FORMULA Philosophers-PT-000050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-10 finished in 854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:26] [INFO ] Invariant cache hit.
[2023-03-22 06:38:26] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-22 06:38:26] [INFO ] Invariant cache hit.
[2023-03-22 06:38:26] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-22 06:38:26] [INFO ] Invariant cache hit.
[2023-03-22 06:38:27] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 565 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s97 1) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1871 steps with 348 reset in 15 ms.
FORMULA Philosophers-PT-000050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-11 finished in 660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1&&F(p2)))))'
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:27] [INFO ] Invariant cache hit.
[2023-03-22 06:38:27] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-22 06:38:27] [INFO ] Invariant cache hit.
[2023-03-22 06:38:27] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-22 06:38:27] [INFO ] Invariant cache hit.
[2023-03-22 06:38:27] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (EQ s30 1) (AND (EQ s57 1) (EQ s214 1))) (EQ s100 1) (EQ s200 1)), p1:(OR (EQ s57 0) (EQ s214 0)), p2:(AND (EQ s100 1) (EQ s243 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]]
Stuttering criterion allowed to conclude after 7955 steps with 23 reset in 36 ms.
FORMULA Philosophers-PT-000050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-12 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 98 rules applied. Total rules applied 98 place count 201 transition count 201
Applied a total of 98 rules in 35 ms. Remains 201 /250 variables (removed 49) and now considering 201/250 (removed 49) transitions.
// Phase 1: matrix 201 rows 201 cols
[2023-03-22 06:38:27] [INFO ] Computed 100 place invariants in 2 ms
[2023-03-22 06:38:28] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-22 06:38:28] [INFO ] Invariant cache hit.
[2023-03-22 06:38:28] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-22 06:38:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 06:38:28] [INFO ] Invariant cache hit.
[2023-03-22 06:38:28] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/250 places, 201/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 201/250 places, 201/250 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-13 automaton TGBA Formula[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:(EQ s0 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]]
Stuttering criterion allowed to conclude after 2224 steps with 4 reset in 17 ms.
FORMULA Philosophers-PT-000050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-13 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!((X(G(p0)) U p1) U p2) U X(p0)))'
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2023-03-22 06:38:28] [INFO ] Computed 100 place invariants in 4 ms
[2023-03-22 06:38:28] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-22 06:38:28] [INFO ] Invariant cache hit.
[2023-03-22 06:38:28] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-22 06:38:28] [INFO ] Invariant cache hit.
[2023-03-22 06:38:29] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 428 ms :[p0, p0, (AND p0 (NOT p1) p2), (AND p0 (NOT p2)), true, (AND p0 (NOT p1)), false, (AND p0 (NOT p2)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 9}], [{ cond=p0, acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 10}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 9}, { cond=(NOT p2), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p2:(NEQ s23 1), p1:(AND (EQ s70 1) (EQ s233 1)), p0:(AND (EQ s55 1) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 131 steps with 65 reset in 3 ms.
FORMULA Philosophers-PT-000050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-14 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(G((F(!p3)&&p2)))))'
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 06:38:29] [INFO ] Invariant cache hit.
[2023-03-22 06:38:29] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-22 06:38:29] [INFO ] Invariant cache hit.
[2023-03-22 06:38:29] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-22 06:38:29] [INFO ] Invariant cache hit.
[2023-03-22 06:38:30] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (NOT p2) p3), (NOT p0), (AND (NOT p0) p3), (NOT p1), (AND (NOT p1) p3), p3]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 6}], [{ cond=p3, acceptance={0} source=7 dest: 7}]], initial=2, aps=[p1:(AND (EQ s89 1) (EQ s127 1)), p0:(AND (EQ s59 1) (EQ s166 1)), p2:(AND (EQ s61 1) (EQ s109 1)), p3:(AND (EQ s93 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37096 steps with 894 reset in 267 ms.
FORMULA Philosophers-PT-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-15 finished in 1196 ms.
All properties solved by simple procedures.
Total runtime 14488 ms.
ITS solved all properties within timeout

BK_STOP 1679467111677

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-000050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-PT-000050, 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 r297-tall-167873950100212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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