About the Execution of LTSMin+red for Philosophers-PT-000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 316.403 | 12440.00 | 19683.00 | 291.20 | FFTFFFTFTFFFTFFF | 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-167873950100196.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-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100196
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 13K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 13:09 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 7.8K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Feb 25 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 197K Feb 25 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K 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 22K 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-000010-LTLFireability-00
FORMULA_NAME Philosophers-PT-000010-LTLFireability-01
FORMULA_NAME Philosophers-PT-000010-LTLFireability-02
FORMULA_NAME Philosophers-PT-000010-LTLFireability-03
FORMULA_NAME Philosophers-PT-000010-LTLFireability-04
FORMULA_NAME Philosophers-PT-000010-LTLFireability-05
FORMULA_NAME Philosophers-PT-000010-LTLFireability-06
FORMULA_NAME Philosophers-PT-000010-LTLFireability-07
FORMULA_NAME Philosophers-PT-000010-LTLFireability-08
FORMULA_NAME Philosophers-PT-000010-LTLFireability-09
FORMULA_NAME Philosophers-PT-000010-LTLFireability-10
FORMULA_NAME Philosophers-PT-000010-LTLFireability-11
FORMULA_NAME Philosophers-PT-000010-LTLFireability-12
FORMULA_NAME Philosophers-PT-000010-LTLFireability-13
FORMULA_NAME Philosophers-PT-000010-LTLFireability-14
FORMULA_NAME Philosophers-PT-000010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679466124403
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-000010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:22:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:22:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:22:06] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-22 06:22:06] [INFO ] Transformed 50 places.
[2023-03-22 06:22:06] [INFO ] Transformed 50 transitions.
[2023-03-22 06:22:06] [INFO ] Found NUPN structural information;
[2023-03-22 06:22:06] [INFO ] Parsed PT model containing 50 places and 50 transitions and 160 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000010-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2023-03-22 06:22:06] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-22 06:22:06] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-22 06:22:06] [INFO ] Invariant cache hit.
[2023-03-22 06:22:06] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-22 06:22:06] [INFO ] Invariant cache hit.
[2023-03-22 06:22:06] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 50/50 places, 50/50 transitions.
Support contains 50 out of 50 places after structural reductions.
[2023-03-22 06:22:07] [INFO ] Flatten gal took : 22 ms
[2023-03-22 06:22:07] [INFO ] Flatten gal took : 9 ms
[2023-03-22 06:22:07] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 181 steps, including 0 resets, run visited all 21 properties in 23 ms. (steps per millisecond=7 )
FORMULA Philosophers-PT-000010-LTLFireability-10 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' '!(G((F(G(p0))&&F(p1))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:07] [INFO ] Invariant cache hit.
[2023-03-22 06:22:07] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-22 06:22:07] [INFO ] Invariant cache hit.
[2023-03-22 06:22:07] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-22 06:22:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:22:07] [INFO ] Invariant cache hit.
[2023-03-22 06:22:07] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-00 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s7 1) (EQ s18 1)) (AND (EQ s5 1) (EQ s16 1)) (AND (EQ s9 1) (EQ s20 1)) (AND (EQ s4 1) (EQ s13 1)) (AND (EQ s3 1) (EQ s14 1)) (AND (EQ s0 ...], 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 559 steps with 53 reset in 12 ms.
FORMULA Philosophers-PT-000010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-00 finished in 628 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(X(X(p0))) U p1))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:08] [INFO ] Invariant cache hit.
[2023-03-22 06:22:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 06:22:08] [INFO ] Invariant cache hit.
[2023-03-22 06:22:08] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-22 06:22:08] [INFO ] Invariant cache hit.
[2023-03-22 06:22:08] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s15 1) (EQ s25 1)) (AND (EQ s11 1) (EQ s22 1)) (AND (EQ s13 1) (EQ s23 1)) (AND (EQ s17 1) (EQ s27 1)) (AND (EQ s14 1) (EQ s24 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 10 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-01 finished in 318 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' '!((p0 U G((X(G(p1))||F(!p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:08] [INFO ] Invariant cache hit.
[2023-03-22 06:22:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 06:22:08] [INFO ] Invariant cache hit.
[2023-03-22 06:22:08] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-22 06:22:08] [INFO ] Invariant cache hit.
[2023-03-22 06:22:08] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2, false]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=3 dest: 5}], [{ cond=p2, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p2 p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 p0 p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (EQ s3 1) (EQ s12 1)) (AND (EQ s0 1) (EQ s20 1)) (AND (EQ s1 1) (EQ s10 1)) (AND (EQ s5 1) (EQ s13 1)) (AND (EQ s2 1) (EQ s11 1)) (AND (EQ s6 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8279 reset in 512 ms.
Product exploration explored 100000 steps with 8291 reset in 485 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 p2) p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p0), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Knowledge based reduction with 10 factoid took 1008 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2, false]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:22:11] [INFO ] Invariant cache hit.
[2023-03-22 06:22:11] [INFO ] After 27ms 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 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p0), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (G (NOT (AND p2 (NOT p1)))), (G (NOT (AND p2 (NOT p1) p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (F (AND p2 p1)), (F p2), (F (AND p2 p1 p0)), (F (NOT p0)), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p2 (NOT p1))))
Knowledge based reduction with 12 factoid took 746 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000010-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000010-LTLFireability-02 finished in 3847 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 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-22 06:22:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-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 s15 1) (EQ s25 1)) (AND (EQ s11 1) (EQ s22 1)) (AND (EQ s13 1) (EQ s23 1)) (AND (EQ s17 1) (EQ s27 1)) (AND (EQ s14 1) (EQ s24 1)) (AND (E...], 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 73 steps with 0 reset in 2 ms.
FORMULA Philosophers-PT-000010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-03 finished in 221 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 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-22 06:22:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-04 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 s15 1) (EQ s25 1)) (AND (EQ s11 1) (EQ s22 1)) (AND (EQ s13 1) (EQ s23 1)) (AND (EQ s17 1) (EQ s27 1)) (AND (EQ s14 1) (EQ s24 1)) (AND (E...], 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 139 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-04 finished in 202 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(p0))&&(X(G(p0))||p1))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-22 06:22:12] [INFO ] Invariant cache hit.
[2023-03-22 06:22:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (OR (EQ s7 0) (EQ s18 0)) (OR (EQ s5 0) (EQ s16 0)) (OR (EQ s9 0) (EQ s20 0)) (OR (EQ s4 0) (EQ s13 0)) (OR (EQ s3 0) (EQ s14 0)) (OR (EQ s0 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-05 finished in 474 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((G(p0)||G(p1)||F(p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:13] [INFO ] Invariant cache hit.
[2023-03-22 06:22:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 06:22:13] [INFO ] Invariant cache hit.
[2023-03-22 06:22:13] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-22 06:22:13] [INFO ] Invariant cache hit.
[2023-03-22 06:22:13] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(OR (AND (EQ s7 1) (EQ s18 1)) (AND (EQ s5 1) (EQ s16 1)) (AND (EQ s9 1) (EQ s20 1)) (AND (EQ s4 1) (EQ s13 1)) (AND (EQ s3 1) (EQ s14 1)) (AND (EQ s0 ...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 313 ms.
Product exploration explored 100000 steps with 33333 reset in 273 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 p2 (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p1) (NOT p0))
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000010-LTLFireability-06 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' '!((G(p0)||X(p1)))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:14] [INFO ] Invariant cache hit.
[2023-03-22 06:22:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 06:22:14] [INFO ] Invariant cache hit.
[2023-03-22 06:22:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-22 06:22:14] [INFO ] Invariant cache hit.
[2023-03-22 06:22:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s13 1) (EQ s33 1)), p0:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-09 finished in 323 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) U (p1||X(p0))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-22 06:22:14] [INFO ] Invariant cache hit.
[2023-03-22 06:22:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 06:22:14] [INFO ] Invariant cache hit.
[2023-03-22 06:22:14] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-22 06:22:14] [INFO ] Invariant cache hit.
[2023-03-22 06:22:14] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, p0]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s25 1)), p0:(AND (EQ s0 1) (EQ s10 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-11 finished in 327 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)&&F(p1)))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 44 transition count 44
Applied a total of 12 rules in 13 ms. Remains 44 /50 variables (removed 6) and now considering 44/50 (removed 6) transitions.
// Phase 1: matrix 44 rows 44 cols
[2023-03-22 06:22:15] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 06:22:15] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-22 06:22:15] [INFO ] Invariant cache hit.
[2023-03-22 06:22:15] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-22 06:22:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 06:22:15] [INFO ] Invariant cache hit.
[2023-03-22 06:22:15] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/50 places, 44/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 44/50 places, 44/50 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s7 1) (EQ s18 1)), p0:(AND (EQ s14 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 225 steps with 3 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-13 finished in 293 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 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 42 transition count 42
Applied a total of 16 rules in 6 ms. Remains 42 /50 variables (removed 8) and now considering 42/50 (removed 8) transitions.
// Phase 1: matrix 42 rows 42 cols
[2023-03-22 06:22:15] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-22 06:22:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 06:22:15] [INFO ] Invariant cache hit.
[2023-03-22 06:22:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-22 06:22:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:22:15] [INFO ] Invariant cache hit.
[2023-03-22 06:22:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/50 places, 42/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 42/50 places, 42/50 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-14 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:(AND (EQ s1 1) (EQ s10 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 236 steps with 3 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-14 finished in 273 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((X((F(G(p2))&&p1))&&p0))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2023-03-22 06:22:15] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-22 06:22:15] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-22 06:22:15] [INFO ] Invariant cache hit.
[2023-03-22 06:22:15] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-22 06:22:15] [INFO ] Invariant cache hit.
[2023-03-22 06:22:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s19 1) (EQ s2 1) (EQ s11 1)), p1:(AND (EQ s10 1) (EQ s19 1)), p2:(EQ s42 1)], 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 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLFireability-15 finished in 357 ms.
All properties solved by simple procedures.
Total runtime 9686 ms.
ITS solved all properties within timeout
BK_STOP 1679466136843
--------------------
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-000010"
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-000010, 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-167873950100196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 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 ;