About the Execution of LTSMin+red for FMS-PT-02000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
361.867 | 10465.00 | 18750.00 | 409.80 | FFFTTTFFFFFFFFFF | 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.r169-tall-167838855600260.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 FMS-PT-02000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855600260
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.6K Feb 25 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 20:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.3K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:05 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 6.3K Feb 25 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 20:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:06 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 16K 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-02000-LTLFireability-00
FORMULA_NAME FMS-PT-02000-LTLFireability-01
FORMULA_NAME FMS-PT-02000-LTLFireability-02
FORMULA_NAME FMS-PT-02000-LTLFireability-03
FORMULA_NAME FMS-PT-02000-LTLFireability-04
FORMULA_NAME FMS-PT-02000-LTLFireability-05
FORMULA_NAME FMS-PT-02000-LTLFireability-06
FORMULA_NAME FMS-PT-02000-LTLFireability-07
FORMULA_NAME FMS-PT-02000-LTLFireability-08
FORMULA_NAME FMS-PT-02000-LTLFireability-09
FORMULA_NAME FMS-PT-02000-LTLFireability-10
FORMULA_NAME FMS-PT-02000-LTLFireability-11
FORMULA_NAME FMS-PT-02000-LTLFireability-12
FORMULA_NAME FMS-PT-02000-LTLFireability-13
FORMULA_NAME FMS-PT-02000-LTLFireability-14
FORMULA_NAME FMS-PT-02000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678502575941
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=FMS-PT-02000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 02:42:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:42:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:42:57] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-11 02:42:57] [INFO ] Transformed 22 places.
[2023-03-11 02:42:57] [INFO ] Transformed 20 transitions.
[2023-03-11 02:42:57] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FMS-PT-02000-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-02000-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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 9 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:42:57] [INFO ] Computed 6 place invariants in 11 ms
[2023-03-11 02:42:58] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-11 02:42:58] [INFO ] Invariant cache hit.
[2023-03-11 02:42:58] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-11 02:42:58] [INFO ] Invariant cache hit.
[2023-03-11 02:42:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 16 out of 22 places after structural reductions.
[2023-03-11 02:42:58] [INFO ] Flatten gal took : 221 ms
[2023-03-11 02:42:58] [INFO ] Flatten gal took : 4 ms
[2023-03-11 02:42:58] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 02:42:58] [INFO ] Invariant cache hit.
[2023-03-11 02:42:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 02:42:58] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:42:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 02:42:58] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 02:42:58] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 02:42:58] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 7048 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=440 )
Parikh walk visited 5 properties in 236 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((p1||X(G(p0))))||(F(p2)&&(p1||X(G(p0))))))'
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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 7 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 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 7 rules applied. Total rules applied 10 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 15 place count 14 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 17 place count 12 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 17 place count 12 transition count 11
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 19 place count 11 transition count 11
Applied a total of 19 rules in 11 ms. Remains 11 /22 variables (removed 11) and now considering 11/20 (removed 9) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-11 02:42:59] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 02:42:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:42:59] [INFO ] Invariant cache hit.
[2023-03-11 02:42:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-11 02:42:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:42:59] [INFO ] Invariant cache hit.
[2023-03-11 02:42:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 11/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 11/22 places, 11/20 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s1 1), p2:(LT s10 1), p1:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 5 ms.
FORMULA FMS-PT-02000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-00 finished in 542 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(G(p0))) U (!p1&&X(X(G(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 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:43:00] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 02:43:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : FMS-PT-02000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s19 1), p0:(AND (GEQ s13 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-01 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
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 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [INFO ] Dead Transitions using invariants and state equation in 26 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 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s0 1)), p1:(AND (GEQ s1 1) (LT s20 1))], 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 4 reset in 257 ms.
Stack based approach found an accepted trace after 968 steps with 0 reset with depth 969 and stack size 969 in 2 ms.
FORMULA FMS-PT-02000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-02000-LTLFireability-02 finished in 483 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(X(G(p1)))||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.
[2023-03-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [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-11 02:43:00] [INFO ] Invariant cache hit.
[2023-03-11 02:43:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FMS-PT-02000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 3}]], initial=5, aps=[p0:(LT s21 1), p2:(LT s0 1), p1:(OR (LT s8 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 124 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 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), true, (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-02000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-02000-LTLFireability-04 finished in 833 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 U !p2))))'
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 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 3 places and 0 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 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 17 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 13 place count 15 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 22 place count 10 transition count 10
Applied a total of 22 rules in 4 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-11 02:43:01] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 02:43:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:43:01] [INFO ] Invariant cache hit.
[2023-03-11 02:43:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 02:43:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:43:01] [INFO ] Invariant cache hit.
[2023-03-11 02:43:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 131 ms :[p2, p0, p2]
Running random walk in product with property : FMS-PT-02000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LT s0 1), p1:(GEQ s6 1), p0:(LT s8 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 9683 reset in 107 ms.
Stack based approach found an accepted trace after 8 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA FMS-PT-02000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-02000-LTLFireability-06 finished in 377 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)))'
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.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 02:43:02] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 02:43:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 02:43:02] [INFO ] Invariant cache hit.
[2023-03-11 02:43:02] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-11 02:43:02] [INFO ] Invariant cache hit.
[2023-03-11 02:43:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s20 1) (LT s3 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 40158 steps with 0 reset in 58 ms.
FORMULA FMS-PT-02000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-07 finished in 292 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)||(F(p1)&&X(p2))))))'
Support contains 5 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-11 02:43:02] [INFO ] Invariant cache hit.
[2023-03-11 02:43:02] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 02:43:02] [INFO ] Invariant cache hit.
[2023-03-11 02:43:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-11 02:43:02] [INFO ] Invariant cache hit.
[2023-03-11 02:43:02] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) p2)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s18 1)), p1:(OR (LT s8 1) (LT s10 1)), p2:(GEQ s9 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21078 reset in 118 ms.
Stack based approach found an accepted trace after 1496 steps with 327 reset with depth 11 and stack size 11 in 2 ms.
FORMULA FMS-PT-02000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-02000-LTLFireability-08 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X(F(p1))))))'
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-11 02:43:02] [INFO ] Invariant cache hit.
[2023-03-11 02:43:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 02:43:02] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LT s20 1), p0:(LT s19 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]]
Product exploration explored 100000 steps with 2 reset in 122 ms.
Stack based approach found an accepted trace after 396 steps with 0 reset with depth 397 and stack size 397 in 3 ms.
FORMULA FMS-PT-02000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-02000-LTLFireability-09 finished in 390 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)))))'
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 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 168 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LT s19 1), p1:(AND (GEQ s13 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FMS-PT-02000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-10 finished in 297 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)&&X(p1))) U G(!p0)))'
Support contains 5 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-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p0, (OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : FMS-PT-02000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LT s20 1), p1:(AND (GEQ s13 1) (GEQ s15 1) (GEQ s2 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39052 steps with 0 reset in 61 ms.
FORMULA FMS-PT-02000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-11 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(p1||X(G((p2 U p3))))))))'
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-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 02:43:03] [INFO ] Invariant cache hit.
[2023-03-11 02:43:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 02:43:04] [INFO ] Invariant cache hit.
[2023-03-11 02:43:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FMS-PT-02000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=3 dest: 5}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 5}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s9 1), p0:(GEQ s14 1), p3:(GEQ s1 1), p2:(GEQ s3 1)], nbAcceptance=1, 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 1163 reset in 110 ms.
Stack based approach found an accepted trace after 164 steps with 1 reset with depth 15 and stack size 15 in 1 ms.
FORMULA FMS-PT-02000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-02000-LTLFireability-12 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1)||G(((G(p0) U p3)&&p2))))'
Support contains 6 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 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 6 rules applied. Total rules applied 9 place count 17 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 16 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 14 place count 14 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 14 place count 14 transition count 13
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 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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 19 place count 11 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 11 transition count 12
Applied a total of 20 rules in 5 ms. Remains 11 /22 variables (removed 11) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-03-11 02:43:04] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 02:43:04] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 02:43:04] [INFO ] Invariant cache hit.
[2023-03-11 02:43:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-11 02:43:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 02:43:04] [INFO ] Invariant cache hit.
[2023-03-11 02:43:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 11/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), true, p1, (OR (NOT p3) (NOT p2)), (AND p1 (NOT p0)), (AND p1 (NOT p3)), (NOT p0), (NOT p3)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0) p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p0 p2) (AND p2 p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s6 1)), p0:(GEQ s3 1), p2:(AND (GEQ s2 1) (GEQ s9 1)), p3:(GEQ s1 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, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-13 finished in 407 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 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 10 edges and 17 vertex of which 6 / 17 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 13 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 11 transition count 11
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 18 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 9 transition count 8
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 23 place count 8 transition count 8
Applied a total of 23 rules in 9 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-11 02:43:04] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 02:43:04] [INFO ] Implicit Places using invariants in 17 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 7
Applied a total of 2 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-11 02:43:04] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 02:43:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 02:43:04] [INFO ] Invariant cache hit.
[2023-03-11 02:43:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/22 places, 7/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-14 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 s2 1) (GEQ s4 1) (LT s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-14 finished in 138 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 G((X(G(p2))&&p1)))))'
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-11 02:43:05] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-11 02:43:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 02:43:05] [INFO ] Invariant cache hit.
[2023-03-11 02:43:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-11 02:43:05] [INFO ] Invariant cache hit.
[2023-03-11 02:43:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (OR (AND (NOT p1) p2) (AND p1 (NOT p2))), (NOT p2)]
Running random walk in product with property : FMS-PT-02000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 5}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s18 1)), p0:(AND (GEQ s2 1) (GEQ s18 1)), p2:(OR (LT s8 1) (LT s10 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-02000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-02000-LTLFireability-15 finished in 361 ms.
All properties solved by simple procedures.
Total runtime 8002 ms.
ITS solved all properties within timeout
BK_STOP 1678502586406
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-02000"
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 FMS-PT-02000, 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 r169-tall-167838855600260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-02000.tgz
mv FMS-PT-02000 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 ;