About the Execution of LTSMin+red for Philosophers-PT-000200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12000.396 | 1902603.00 | 7273150.00 | 802.50 | ?TFFFFTT?FTFFFFF | 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-167873950100228.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-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 171K Feb 25 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 960K Feb 25 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Feb 25 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 762K Feb 25 13:14 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 75K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 295K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 332K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 310K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Feb 25 16:33 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 445K 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-000200-LTLFireability-00
FORMULA_NAME Philosophers-PT-000200-LTLFireability-01
FORMULA_NAME Philosophers-PT-000200-LTLFireability-02
FORMULA_NAME Philosophers-PT-000200-LTLFireability-03
FORMULA_NAME Philosophers-PT-000200-LTLFireability-04
FORMULA_NAME Philosophers-PT-000200-LTLFireability-05
FORMULA_NAME Philosophers-PT-000200-LTLFireability-06
FORMULA_NAME Philosophers-PT-000200-LTLFireability-07
FORMULA_NAME Philosophers-PT-000200-LTLFireability-08
FORMULA_NAME Philosophers-PT-000200-LTLFireability-09
FORMULA_NAME Philosophers-PT-000200-LTLFireability-10
FORMULA_NAME Philosophers-PT-000200-LTLFireability-11
FORMULA_NAME Philosophers-PT-000200-LTLFireability-12
FORMULA_NAME Philosophers-PT-000200-LTLFireability-13
FORMULA_NAME Philosophers-PT-000200-LTLFireability-14
FORMULA_NAME Philosophers-PT-000200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679469935203
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-000200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:25:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:25:37] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-22 07:25:37] [INFO ] Transformed 1000 places.
[2023-03-22 07:25:37] [INFO ] Transformed 1000 transitions.
[2023-03-22 07:25:37] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 804 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 171 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-22 07:25:37] [INFO ] Computed 400 place invariants in 21 ms
[2023-03-22 07:25:38] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-22 07:25:38] [INFO ] Invariant cache hit.
[2023-03-22 07:25:38] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-22 07:25:38] [INFO ] Invariant cache hit.
[2023-03-22 07:25:39] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1747 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 804 out of 1000 places after structural reductions.
[2023-03-22 07:25:39] [INFO ] Flatten gal took : 119 ms
[2023-03-22 07:25:39] [INFO ] Flatten gal took : 83 ms
[2023-03-22 07:25:40] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 21) seen :20
Finished Best-First random walk after 401 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=80 )
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' '!(X((X(G(p0))||F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 30 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:25:41] [INFO ] Invariant cache hit.
[2023-03-22 07:25:41] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-22 07:25:41] [INFO ] Invariant cache hit.
[2023-03-22 07:25:42] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-22 07:25:42] [INFO ] Invariant cache hit.
[2023-03-22 07:25:42] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1620 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s282 1) (GEQ s454 1)) (AND (GEQ s333 1) (GEQ s551 1)) (AND (GEQ s277 1) (GEQ s457 1)) (AND (GEQ s338 1) (GEQ s556 1)) (AND (GEQ s406 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]]
Product exploration explored 100000 steps with 33217 reset in 6860 ms.
Product exploration explored 100000 steps with 33218 reset in 6822 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 (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2252 steps, including 0 resets, run visited all 3 properties in 42 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 305 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:00] [INFO ] Invariant cache hit.
[2023-03-22 07:26:01] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-22 07:26:01] [INFO ] Invariant cache hit.
[2023-03-22 07:26:01] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2023-03-22 07:26:01] [INFO ] Invariant cache hit.
[2023-03-22 07:26:02] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1680 ms. Remains : 1000/1000 places, 1000/1000 transitions.
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 (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 9141 steps, including 2 resets, run visited all 3 properties in 162 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 394 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33198 reset in 6080 ms.
Product exploration explored 100000 steps with 33211 reset in 6205 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 47 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:17] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 07:26:17] [INFO ] Invariant cache hit.
[2023-03-22 07:26:18] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 708 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:18] [INFO ] Invariant cache hit.
[2023-03-22 07:26:18] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-22 07:26:18] [INFO ] Invariant cache hit.
[2023-03-22 07:26:19] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2023-03-22 07:26:19] [INFO ] Invariant cache hit.
[2023-03-22 07:26:19] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1535 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-PT-000200-LTLFireability-00 finished in 39042 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((F(!p2)&&p1))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:20] [INFO ] Invariant cache hit.
[2023-03-22 07:26:20] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-22 07:26:20] [INFO ] Invariant cache hit.
[2023-03-22 07:26:20] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-03-22 07:26:21] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-22 07:26:21] [INFO ] Invariant cache hit.
[2023-03-22 07:26:21] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1502 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (NOT p0), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s366 1) (GEQ s729 1)) (AND (GEQ s271 1) (GEQ s698 1)) (AND (GEQ s371 1) (GEQ s726 1)) (AND (GEQ s321 1) (GEQ s716 1)) (AND (GEQ s218 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-03 finished in 1807 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))&&F(((p2 U X(p2))||p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:21] [INFO ] Invariant cache hit.
[2023-03-22 07:26:22] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-22 07:26:22] [INFO ] Invariant cache hit.
[2023-03-22 07:26:22] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
[2023-03-22 07:26:22] [INFO ] Invariant cache hit.
[2023-03-22 07:26:23] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1619 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s58 1) (GEQ s273 1)) (AND (GEQ s194 1) (GEQ s391 1)) (AND (GEQ s14 1) (GEQ s209 1)) (AND (GEQ s51 1) (GEQ s240 1)) (AND (GEQ s187 1) (GEQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 80 reset in 1552 ms.
Stack based approach found an accepted trace after 1393 steps with 2 reset with depth 980 and stack size 980 in 36 ms.
FORMULA Philosophers-PT-000200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-04 finished in 3383 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&&G(!p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:25] [INFO ] Invariant cache hit.
[2023-03-22 07:26:25] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-22 07:26:25] [INFO ] Invariant cache hit.
[2023-03-22 07:26:26] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2023-03-22 07:26:26] [INFO ] Invariant cache hit.
[2023-03-22 07:26:26] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1554 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s366 1) (GEQ s729 1)) (AND (GEQ s271 1) (GEQ s698 1)) (AND (GEQ s371 1) (GEQ s726 1)) (AND (GEQ s321 1) (GEQ s716 1)) (AND (GEQ s218 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 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-05 finished in 1721 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((G(p0)||X(p1)))||((G(p0)||X(p1))&&G(F(!p2))))))'
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 52 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:27] [INFO ] Invariant cache hit.
[2023-03-22 07:26:27] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-22 07:26:27] [INFO ] Invariant cache hit.
[2023-03-22 07:26:28] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2023-03-22 07:26:28] [INFO ] Invariant cache hit.
[2023-03-22 07:26:29] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2272 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 504 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=p2, acceptance={0} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 9}, { cond=true, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s161 1) (GEQ s351 1)), p1:(LT s767 1), p2:(OR (GEQ s770 1) (AND (GEQ s241 1) (GEQ s474 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, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25064 reset in 5169 ms.
Product exploration explored 100000 steps with 25116 reset in 5413 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 p1 (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 433 ms. Reduced automaton from 12 states, 24 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 563 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Finished random walk after 8602 steps, including 2 resets, run visited all 10 properties in 213 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 687 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 474 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 31 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:26:44] [INFO ] Invariant cache hit.
[2023-03-22 07:26:45] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-22 07:26:45] [INFO ] Invariant cache hit.
[2023-03-22 07:26:46] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2023-03-22 07:26:46] [INFO ] Invariant cache hit.
[2023-03-22 07:26:46] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2247 ms. Remains : 1000/1000 places, 1000/1000 transitions.
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 p1 (NOT p2)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 10) seen :8
Finished Best-First random walk after 1985 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 583 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 621 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 487 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 494 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Product exploration explored 100000 steps with 25015 reset in 5168 ms.
Product exploration explored 100000 steps with 24916 reset in 5326 ms.
Applying partial POR strategy [false, false, true, false, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 194 places in 0 ms
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 1000 transition count 1000
Deduced a syphon composed of 194 places in 0 ms
Applied a total of 194 rules in 341 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:27:02] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-22 07:27:02] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-22 07:27:03] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 1000/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 972 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-22 07:27:03] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-22 07:27:03] [INFO ] Implicit Places using invariants in 530 ms returned []
[2023-03-22 07:27:03] [INFO ] Invariant cache hit.
[2023-03-22 07:27:04] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2023-03-22 07:27:04] [INFO ] Invariant cache hit.
[2023-03-22 07:27:05] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2239 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-PT-000200-LTLFireability-08 finished in 38410 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)&&X(X((p1||X(F(p2))))))))'
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:27:05] [INFO ] Invariant cache hit.
[2023-03-22 07:27:06] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-22 07:27:06] [INFO ] Invariant cache hit.
[2023-03-22 07:27:07] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2023-03-22 07:27:07] [INFO ] Invariant cache hit.
[2023-03-22 07:27:07] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2259 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s207 1) (GEQ s218 1) (GEQ s384 1)), p1:(LT s852 1), p2:(OR (LT s38 1) (LT s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8126 steps with 0 reset in 84 ms.
FORMULA Philosophers-PT-000200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-09 finished in 2824 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 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 802 transition count 802
Applied a total of 396 rules in 71 ms. Remains 802 /1000 variables (removed 198) and now considering 802/1000 (removed 198) transitions.
// Phase 1: matrix 802 rows 802 cols
[2023-03-22 07:27:08] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-22 07:27:08] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-22 07:27:08] [INFO ] Invariant cache hit.
[2023-03-22 07:27:09] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2023-03-22 07:27:10] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-22 07:27:10] [INFO ] Invariant cache hit.
[2023-03-22 07:27:10] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/1000 places, 802/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2189 ms. Remains : 802/1000 places, 802/1000 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s363 1) (LT s794 1))], 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 0 reset in 823 ms.
Stack based approach found an accepted trace after 5156 steps with 0 reset with depth 5157 and stack size 5065 in 84 ms.
FORMULA Philosophers-PT-000200-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-11 finished in 3152 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)&&F(G(p1)))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 0 with 392 rules applied. Total rules applied 392 place count 804 transition count 804
Applied a total of 392 rules in 68 ms. Remains 804 /1000 variables (removed 196) and now considering 804/1000 (removed 196) transitions.
// Phase 1: matrix 804 rows 804 cols
[2023-03-22 07:27:11] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-22 07:27:12] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-22 07:27:12] [INFO ] Invariant cache hit.
[2023-03-22 07:27:13] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2023-03-22 07:27:13] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 07:27:13] [INFO ] Invariant cache hit.
[2023-03-22 07:27:13] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/1000 places, 804/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2055 ms. Remains : 804/1000 places, 804/1000 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s197 1) (GEQ s403 1)), p1:(AND (GEQ s249 1) (GEQ s415 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 809 ms.
Stack based approach found an accepted trace after 488 steps with 0 reset with depth 489 and stack size 489 in 17 ms.
FORMULA Philosophers-PT-000200-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-12 finished in 3014 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 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 802 transition count 802
Applied a total of 396 rules in 52 ms. Remains 802 /1000 variables (removed 198) and now considering 802/1000 (removed 198) transitions.
// Phase 1: matrix 802 rows 802 cols
[2023-03-22 07:27:14] [INFO ] Computed 400 place invariants in 7 ms
[2023-03-22 07:27:14] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-22 07:27:14] [INFO ] Invariant cache hit.
[2023-03-22 07:27:15] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2023-03-22 07:27:16] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 07:27:16] [INFO ] Invariant cache hit.
[2023-03-22 07:27:16] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/1000 places, 802/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2026 ms. Remains : 802/1000 places, 802/1000 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s192 1) (GEQ s393 1))], 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 0 reset in 792 ms.
Stack based approach found an accepted trace after 241 steps with 0 reset with depth 242 and stack size 242 in 11 ms.
FORMULA Philosophers-PT-000200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-13 finished in 2887 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((G(F((p0||G(F(p0)))))||(p1&&G(p2))))))'
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-22 07:27:17] [INFO ] Computed 400 place invariants in 8 ms
[2023-03-22 07:27:17] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-22 07:27:17] [INFO ] Invariant cache hit.
[2023-03-22 07:27:19] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2023-03-22 07:27:19] [INFO ] Invariant cache hit.
[2023-03-22 07:27:19] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2264 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s51 1) (LT s239 1)), p2:(LT s891 1), p0:(AND (GEQ s165 1) (GEQ s380 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]]
Product exploration explored 100000 steps with 58 reset in 1330 ms.
Stack based approach found an accepted trace after 24362 steps with 11 reset with depth 913 and stack size 912 in 336 ms.
FORMULA Philosophers-PT-000200-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-14 finished in 4262 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(F(p0))||G(p1))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-22 07:27:21] [INFO ] Invariant cache hit.
[2023-03-22 07:27:22] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-22 07:27:22] [INFO ] Invariant cache hit.
[2023-03-22 07:27:23] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
[2023-03-22 07:27:23] [INFO ] Invariant cache hit.
[2023-03-22 07:27:23] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2284 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s130 1) (LT s321 1)), p1:(AND (GEQ s147 1) (GEQ s367 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]]
Product exploration explored 100000 steps with 1094 reset in 4644 ms.
Stack based approach found an accepted trace after 22540 steps with 239 reset with depth 273 and stack size 273 in 1056 ms.
FORMULA Philosophers-PT-000200-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-15 finished in 8154 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))||F(p1))))'
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((G(p0)||X(p1)))||((G(p0)||X(p1))&&G(F(!p2))))))'
[2023-03-22 07:27:30] [INFO ] Flatten gal took : 62 ms
[2023-03-22 07:27:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2023-03-22 07:27:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1000 transitions and 3200 arcs took 6 ms.
Total runtime 112883 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1623/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 4166396 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16115408 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1623/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Philosophers-PT-000200-LTLFireability-00
Could not compute solution for formula : Philosophers-PT-000200-LTLFireability-08
BK_STOP 1679471837806
--------------------
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
mcc2023
ltl formula name Philosophers-PT-000200-LTLFireability-00
ltl formula formula --ltl=/tmp/1623/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1623/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1623/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1623/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1623/ltl_0_
Killing (15) : 1629 1630 1631 1632 1633
Killing (9) : 1629 1630 1631 1632 1633
ltl formula name Philosophers-PT-000200-LTLFireability-08
ltl formula formula --ltl=/tmp/1623/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.040 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1623/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1623/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1623/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1623/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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-000200"
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-000200, 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-167873950100228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 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 ;