About the Execution of LoLa+red for FMS-PT-00200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 357.495 | 12907.00 | 21550.00 | 456.70 | FFFFFFFTFFFFFFFF | 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.r167-tall-167838852700236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FMS-PT-00200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852700236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 8.3K Feb 25 20:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 20:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 20:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 20:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 20:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 20:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K Mar 5 18:22 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 FMS-PT-00200-LTLFireability-00
FORMULA_NAME FMS-PT-00200-LTLFireability-01
FORMULA_NAME FMS-PT-00200-LTLFireability-02
FORMULA_NAME FMS-PT-00200-LTLFireability-03
FORMULA_NAME FMS-PT-00200-LTLFireability-04
FORMULA_NAME FMS-PT-00200-LTLFireability-05
FORMULA_NAME FMS-PT-00200-LTLFireability-06
FORMULA_NAME FMS-PT-00200-LTLFireability-07
FORMULA_NAME FMS-PT-00200-LTLFireability-08
FORMULA_NAME FMS-PT-00200-LTLFireability-09
FORMULA_NAME FMS-PT-00200-LTLFireability-10
FORMULA_NAME FMS-PT-00200-LTLFireability-11
FORMULA_NAME FMS-PT-00200-LTLFireability-12
FORMULA_NAME FMS-PT-00200-LTLFireability-13
FORMULA_NAME FMS-PT-00200-LTLFireability-14
FORMULA_NAME FMS-PT-00200-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678446758631
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 11:12:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 11:12:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:12:40] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-10 11:12:40] [INFO ] Transformed 22 places.
[2023-03-10 11:12:40] [INFO ] Transformed 20 transitions.
[2023-03-10 11:12:40] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FMS-PT-00200-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00200-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:12:40] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-10 11:12:40] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-10 11:12:40] [INFO ] Invariant cache hit.
[2023-03-10 11:12:41] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-10 11:12:41] [INFO ] Invariant cache hit.
[2023-03-10 11:12:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-10 11:12:41] [INFO ] Flatten gal took : 15 ms
[2023-03-10 11:12:41] [INFO ] Flatten gal took : 4 ms
[2023-03-10 11:12:41] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 2343 steps, including 0 resets, run visited all 20 properties in 34 ms. (steps per millisecond=68 )
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(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:41] [INFO ] Invariant cache hit.
[2023-03-10 11:12:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-10 11:12:41] [INFO ] Invariant cache hit.
[2023-03-10 11:12:41] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-10 11:12:41] [INFO ] Invariant cache hit.
[2023-03-10 11:12:41] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2542 reset in 252 ms.
Stack based approach found an accepted trace after 942 steps with 19 reset with depth 4 and stack size 4 in 2 ms.
FORMULA FMS-PT-00200-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-00 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:42] [INFO ] Invariant cache hit.
[2023-03-10 11:12:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-10 11:12:42] [INFO ] Invariant cache hit.
[2023-03-10 11:12:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-10 11:12:42] [INFO ] Invariant cache hit.
[2023-03-10 11:12:42] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : FMS-PT-00200-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s19 1), p0:(GEQ s3 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FMS-PT-00200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-01 finished in 282 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)||((p0 U p1)&&X(G(p2))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 15 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:42] [INFO ] Invariant cache hit.
[2023-03-10 11:12:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-10 11:12:42] [INFO ] Invariant cache hit.
[2023-03-10 11:12:42] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-10 11:12:42] [INFO ] Invariant cache hit.
[2023-03-10 11:12:43] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (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))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s19 1), p1:(AND (GEQ s8 1) (GEQ s10 1)), p2:(LT s0 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 5869 reset in 189 ms.
Stack based approach found an accepted trace after 13 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-02 finished in 934 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&&X((p0 U (G(p0)||(!p1&&F(p2))))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:43] [INFO ] Invariant cache hit.
[2023-03-10 11:12:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 11:12:43] [INFO ] Invariant cache hit.
[2023-03-10 11:12:44] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-03-10 11:12:44] [INFO ] Invariant cache hit.
[2023-03-10 11:12:44] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1002 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p2), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(LT s0 1), p0:(LT s16 1), p1:(AND (GEQ s11 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29336 reset in 78 ms.
Stack based approach found an accepted trace after 66318 steps with 19493 reset with depth 24 and stack size 24 in 61 ms.
FORMULA FMS-PT-00200-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-03 finished in 1409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 23 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 2 transition count 4
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 17 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-10 11:12:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 11:12:45] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:12:45] [INFO ] Invariant cache hit.
[2023-03-10 11:12:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 11:12:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:12:45] [INFO ] Invariant cache hit.
[2023-03-10 11:12:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-04 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:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24050 steps with 0 reset in 38 ms.
FORMULA FMS-PT-00200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-04 finished in 207 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||((p1 U (p2||G(p1))) U (((p1 U (p2||G(p1)))&&p3)||G((p1 U (p2||G(p1))))))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 18 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 17 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 16 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 10 place count 16 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 16 place count 13 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 12 transition count 12
Applied a total of 18 rules in 8 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-10 11:12:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 11:12:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 11:12:45] [INFO ] Invariant cache hit.
[2023-03-10 11:12:45] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-10 11:12:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:12:45] [INFO ] Invariant cache hit.
[2023-03-10 11:12:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 12/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s0 1) (LT s3 1)), p1:(LT s3 1), p0:(LT s8 1), p3:(AND (GEQ s5 1) (GEQ s7 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 405 reset in 145 ms.
Stack based approach found an accepted trace after 114 steps with 5 reset with depth 33 and stack size 31 in 1 ms.
FORMULA FMS-PT-00200-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-05 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U !p1)&&(F(p1)||(!p0&&G(p2)))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:12:45] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 11:12:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-10 11:12:45] [INFO ] Invariant cache hit.
[2023-03-10 11:12:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-10 11:12:45] [INFO ] Invariant cache hit.
[2023-03-10 11:12:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) p0 p1), (OR (NOT p2) p0 p1), true, p1, (NOT p1)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s0 1), p0:(GEQ s19 1), p2:(OR (LT s13 1) (LT s15 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 FMS-PT-00200-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-06 finished in 313 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||G(p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 10 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 7 transition count 8
Applied a total of 26 rules in 10 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2023-03-10 11:12:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2023-03-10 11:12:45] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 11:12:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 11:12:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:45] [INFO ] Invariant cache hit.
[2023-03-10 11:12:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 11:12:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:12:46] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:46] [INFO ] Invariant cache hit.
[2023-03-10 11:12:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LT s5 1), p0:(AND (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24989 reset in 136 ms.
Product exploration explored 100000 steps with 25064 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 272 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 403 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 337 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 11:12:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:47] [INFO ] Invariant cache hit.
[2023-03-10 11:12:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 11:12:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:47] [INFO ] Invariant cache hit.
[2023-03-10 11:12:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-10 11:12:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:12:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:47] [INFO ] Invariant cache hit.
[2023-03-10 11:12:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 7/7 places, 8/8 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=202 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25129 reset in 78 ms.
Product exploration explored 100000 steps with 24892 reset in 71 ms.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 11:12:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:47] [INFO ] Invariant cache hit.
[2023-03-10 11:12:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 11:12:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:47] [INFO ] Invariant cache hit.
[2023-03-10 11:12:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-10 11:12:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:12:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-10 11:12:47] [INFO ] Invariant cache hit.
[2023-03-10 11:12:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 7/7 places, 8/8 transitions.
Treatment of property FMS-PT-00200-LTLFireability-07 finished in 2079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U G(!p1))&&X(p2)&&(!p3 U (p4||G(!p3))))))'
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:12:48] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 11:12:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 11:12:48] [INFO ] Invariant cache hit.
[2023-03-10 11:12:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 11:12:48] [INFO ] Invariant cache hit.
[2023-03-10 11:12:48] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p2) p1 (AND p3 (NOT p4))), p1, (NOT p2), (AND p3 (NOT p4)), p1, (AND (NOT p0) p1 (NOT p2)), (AND p1 p3 (NOT p4))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p0) (AND (NOT p4) p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={1} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p0) p4) (AND p1 (NOT p0) (NOT p3))), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) (NOT p3)) (AND (NOT p0) p4) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p1) p0 (NOT p3))), acceptance={1} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND p1 p0 (NOT p2)) (AND (NOT p4) p3 (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) p4 (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), acceptance={1} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p0) p4 (NOT p2)) (AND p1 (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p0) p4 (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 3}, { cond=(OR (AND (NOT p1) p0 p4 (NOT p2)) (AND (NOT p1) p0 (NOT p3) (NOT p2))), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p4) p3), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 p0) (AND p1 (NOT p4) p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={1} source=4 dest: 1}, { cond=(OR (AND p1 (NOT p0) p4) (AND p1 (NOT p0) (NOT p3))), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND p1 (NOT p0) p4) (AND p1 (NOT p0) (NOT p3))), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p4) p3)), acceptance={1} source=4 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p4) p3 (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(OR (AND p1 (NOT p0) p4 (NOT p2)) (AND p1 (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3 (NOT p2)), acceptance={1} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0) p4 (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p4) p3), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s13 1) (LT s15 1)), p0:(LT s16 1), p4:(AND (LT s19 1) (NOT (AND (GEQ s2 1) (GEQ s18 1)))), p3:(GEQ s19 1), p2:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 516 reset in 205 ms.
Stack based approach found an accepted trace after 624 steps with 1 reset with depth 165 and stack size 165 in 2 ms.
FORMULA FMS-PT-00200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-09 finished in 741 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))))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:48] [INFO ] Invariant cache hit.
[2023-03-10 11:12:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 11:12:48] [INFO ] Invariant cache hit.
[2023-03-10 11:12:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 11:12:48] [INFO ] Invariant cache hit.
[2023-03-10 11:12:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s6 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 14 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-10 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' '!(G((p0||(p1 U (G((p1||X(G(!p2))))||(G(p3)&&(p1||X(G(!p2)))))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1) p2), p2, (AND p0 (NOT p1) p2), (AND p2 p0 (NOT p1) (NOT p3)), true, (AND p2 (NOT p3)), (NOT p3)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p3 p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s12 1), p1:(LT s4 1), p3:(LT s16 1), p2:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-11 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s6 1) (GEQ s10 1) (GEQ s17 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 5619 reset in 88 ms.
Stack based approach found an accepted trace after 69 steps with 1 reset with depth 28 and stack size 28 in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-13 finished in 360 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&&(p1||X(p1))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-10 11:12:49] [INFO ] Invariant cache hit.
[2023-03-10 11:12:49] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s20 1), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25 reset in 141 ms.
Stack based approach found an accepted trace after 216 steps with 0 reset with depth 217 and stack size 217 in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00200-LTLFireability-14 finished in 414 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)||G(F(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 9 edges and 17 vertex of which 6 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 15 place count 12 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 20 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 7 transition count 7
Applied a total of 25 rules in 7 ms. Remains 7 /22 variables (removed 15) and now considering 7/20 (removed 13) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-10 11:12:50] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-10 11:12:50] [INFO ] Implicit Places using invariants in 38 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/22 places, 7/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00200-LTLFireability-15 finished in 144 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||G(p1))))'
[2023-03-10 11:12:50] [INFO ] Flatten gal took : 15 ms
[2023-03-10 11:12:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-10 11:12:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 1 ms.
Total runtime 10173 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FMS-PT-00200
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
FORMULA FMS-PT-00200-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678446771538
--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 FMS-PT-00200-LTLFireability-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for FMS-PT-00200-LTLFireability-07
lola: result : true
lola: markings : 402
lola: fired transitions : 802
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FMS-PT-00200-LTLFireability-07: LTL true LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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="FMS-PT-00200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FMS-PT-00200, 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 r167-tall-167838852700236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00200.tgz
mv FMS-PT-00200 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 ;