About the Execution of LoLa+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 |
| 387.260 | 16451.00 | 26473.00 | 407.50 | 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.r295-tall-167873947600212.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 lolaxred
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 r295-tall-167873947600212
=====================================================================
--------------------
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 1678803327906
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:15:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:15:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:15:29] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-14 14:15:29] [INFO ] Transformed 250 places.
[2023-03-14 14:15:29] [INFO ] Transformed 250 transitions.
[2023-03-14 14:15:29] [INFO ] Found NUPN structural information;
[2023-03-14 14:15:29] [INFO ] Parsed PT model containing 250 places and 250 transitions and 800 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 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 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2023-03-14 14:15:30] [INFO ] Computed 100 place invariants in 21 ms
[2023-03-14 14:15:30] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-14 14:15:30] [INFO ] Invariant cache hit.
[2023-03-14 14:15:30] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-14 14:15:30] [INFO ] Invariant cache hit.
[2023-03-14 14:15:30] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2023-03-14 14:15:30] [INFO ] Flatten gal took : 50 ms
[2023-03-14 14:15:30] [INFO ] Flatten gal took : 23 ms
[2023-03-14 14:15:31] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 545 steps, including 0 resets, run visited all 25 properties in 50 ms. (steps per millisecond=10 )
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-14 14:15:31] [INFO ] Invariant cache hit.
[2023-03-14 14:15:31] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-14 14:15:31] [INFO ] Invariant cache hit.
[2023-03-14 14:15:31] [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-14 14:15:31] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-14 14:15:31] [INFO ] Invariant cache hit.
[2023-03-14 14:15:32] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 634 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 186 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 9019 steps with 13 reset in 86 ms.
FORMULA Philosophers-PT-000050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-00 finished in 963 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 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:32] [INFO ] Invariant cache hit.
[2023-03-14 14:15:32] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-14 14:15:32] [INFO ] Invariant cache hit.
[2023-03-14 14:15:32] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-14 14:15:32] [INFO ] Invariant cache hit.
[2023-03-14 14:15:32] [INFO ] Dead Transitions using invariants and state equation in 126 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 205 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 257 reset in 723 ms.
Stack based approach found an accepted trace after 221 steps with 0 reset with depth 222 and stack size 222 in 3 ms.
FORMULA Philosophers-PT-000050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-01 finished in 1434 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 18 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:33] [INFO ] Invariant cache hit.
[2023-03-14 14:15:34] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-14 14:15:34] [INFO ] Invariant cache hit.
[2023-03-14 14:15:34] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-14 14:15:34] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 14:15:34] [INFO ] Invariant cache hit.
[2023-03-14 14:15:34] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 518 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-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 23 reset in 510 ms.
Stack based approach found an accepted trace after 264 steps with 0 reset with depth 265 and stack size 265 in 2 ms.
FORMULA Philosophers-PT-000050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-02 finished in 1078 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 18 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:35] [INFO ] Invariant cache hit.
[2023-03-14 14:15:35] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-14 14:15:35] [INFO ] Invariant cache hit.
[2023-03-14 14:15:35] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-14 14:15:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 14:15:35] [INFO ] Invariant cache hit.
[2023-03-14 14:15:35] [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 488 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 34 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 2192 steps with 0 reset in 15 ms.
FORMULA Philosophers-PT-000050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-03 finished in 561 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 10 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:35] [INFO ] Invariant cache hit.
[2023-03-14 14:15:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-14 14:15:35] [INFO ] Invariant cache hit.
[2023-03-14 14:15:35] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-14 14:15:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:15:35] [INFO ] Invariant cache hit.
[2023-03-14 14:15:35] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 118 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 75 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-04 finished in 556 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 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:36] [INFO ] Invariant cache hit.
[2023-03-14 14:15:36] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-14 14:15:36] [INFO ] Invariant cache hit.
[2023-03-14 14:15:36] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-14 14:15:36] [INFO ] Invariant cache hit.
[2023-03-14 14:15:36] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 204 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 26355 reset in 1106 ms.
Stack based approach found an accepted trace after 799 steps with 194 reset with depth 163 and stack size 163 in 14 ms.
FORMULA Philosophers-PT-000050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-05 finished in 1754 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 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:37] [INFO ] Invariant cache hit.
[2023-03-14 14:15:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-14 14:15:38] [INFO ] Invariant cache hit.
[2023-03-14 14:15:38] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-14 14:15:38] [INFO ] Invariant cache hit.
[2023-03-14 14:15:38] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 116 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 224 steps with 0 reset in 2 ms.
FORMULA Philosophers-PT-000050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-09 finished in 689 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 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:38] [INFO ] Invariant cache hit.
[2023-03-14 14:15:38] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-14 14:15:38] [INFO ] Invariant cache hit.
[2023-03-14 14:15:38] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-14 14:15:38] [INFO ] Invariant cache hit.
[2023-03-14 14:15:39] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 200 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 1157 steps with 0 reset in 6 ms.
FORMULA Philosophers-PT-000050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-10 finished in 711 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 7 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:39] [INFO ] Invariant cache hit.
[2023-03-14 14:15:39] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-14 14:15:39] [INFO ] Invariant cache hit.
[2023-03-14 14:15:39] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-14 14:15:39] [INFO ] Invariant cache hit.
[2023-03-14 14:15:39] [INFO ] Dead Transitions using invariants and state equation in 143 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 74 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 17063 steps with 2194 reset in 100 ms.
FORMULA Philosophers-PT-000050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-11 finished in 708 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 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:39] [INFO ] Invariant cache hit.
[2023-03-14 14:15:40] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-14 14:15:40] [INFO ] Invariant cache hit.
[2023-03-14 14:15:40] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-14 14:15:40] [INFO ] Invariant cache hit.
[2023-03-14 14:15:40] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 168 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 577 steps with 1 reset in 5 ms.
FORMULA Philosophers-PT-000050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-12 finished in 748 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 0 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 29 ms. Remains 201 /250 variables (removed 49) and now considering 201/250 (removed 49) transitions.
// Phase 1: matrix 201 rows 201 cols
[2023-03-14 14:15:40] [INFO ] Computed 100 place invariants in 2 ms
[2023-03-14 14:15:40] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-14 14:15:40] [INFO ] Invariant cache hit.
[2023-03-14 14:15:41] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-14 14:15:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 14:15:41] [INFO ] Invariant cache hit.
[2023-03-14 14:15:41] [INFO ] Dead Transitions using invariants and state equation in 100 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 458 ms. Remains : 201/250 places, 201/250 transitions.
Stuttering acceptance computed with spot in 66 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 24869 steps with 139 reset in 163 ms.
FORMULA Philosophers-PT-000050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-13 finished in 705 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 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2023-03-14 14:15:41] [INFO ] Computed 100 place invariants in 2 ms
[2023-03-14 14:15:41] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-14 14:15:41] [INFO ] Invariant cache hit.
[2023-03-14 14:15:41] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-14 14:15:41] [INFO ] Invariant cache hit.
[2023-03-14 14:15:41] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 521 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 519 steps with 259 reset in 6 ms.
FORMULA Philosophers-PT-000050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-14 finished in 1058 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 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-14 14:15:42] [INFO ] Invariant cache hit.
[2023-03-14 14:15:42] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-14 14:15:42] [INFO ] Invariant cache hit.
[2023-03-14 14:15:42] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-14 14:15:42] [INFO ] Invariant cache hit.
[2023-03-14 14:15:42] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 344 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 2658 steps with 9 reset in 14 ms.
FORMULA Philosophers-PT-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-15 finished in 826 ms.
All properties solved by simple procedures.
Total runtime 13844 ms.
ITS solved all properties within timeout
BK_STOP 1678803344357
--------------------
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="lolaxred"
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 lolaxred"
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 r295-tall-167873947600212"
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 '
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 ;