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-167838855500220.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-00050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855500220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.8K Feb 25 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 19:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 19:59 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.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 20:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 20:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 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-00050-LTLFireability-00
FORMULA_NAME FMS-PT-00050-LTLFireability-01
FORMULA_NAME FMS-PT-00050-LTLFireability-02
FORMULA_NAME FMS-PT-00050-LTLFireability-03
FORMULA_NAME FMS-PT-00050-LTLFireability-04
FORMULA_NAME FMS-PT-00050-LTLFireability-05
FORMULA_NAME FMS-PT-00050-LTLFireability-06
FORMULA_NAME FMS-PT-00050-LTLFireability-07
FORMULA_NAME FMS-PT-00050-LTLFireability-08
FORMULA_NAME FMS-PT-00050-LTLFireability-09
FORMULA_NAME FMS-PT-00050-LTLFireability-10
FORMULA_NAME FMS-PT-00050-LTLFireability-11
FORMULA_NAME FMS-PT-00050-LTLFireability-12
FORMULA_NAME FMS-PT-00050-LTLFireability-13
FORMULA_NAME FMS-PT-00050-LTLFireability-14
FORMULA_NAME FMS-PT-00050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678497135405

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-00050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 01:12:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 01:12:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:12:17] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-11 01:12:17] [INFO ] Transformed 22 places.
[2023-03-11 01:12:17] [INFO ] Transformed 20 transitions.
[2023-03-11 01:12:17] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 84 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 1 formulas.
FORMULA FMS-PT-00050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 01:12:17] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-11 01:12:17] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-11 01:12:17] [INFO ] Invariant cache hit.
[2023-03-11 01:12:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-11 01:12:17] [INFO ] Invariant cache hit.
[2023-03-11 01:12:17] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 19 out of 22 places after structural reductions.
[2023-03-11 01:12:17] [INFO ] Flatten gal took : 16 ms
[2023-03-11 01:12:17] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:12:17] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 607 steps, including 0 resets, run visited all 20 properties in 28 ms. (steps per millisecond=21 )
FORMULA FMS-PT-00050-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(G(!p0)&&X(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.
[2023-03-11 01:12:18] [INFO ] Invariant cache hit.
[2023-03-11 01:12:18] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 01:12:18] [INFO ] Invariant cache hit.
[2023-03-11 01:12:18] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-11 01:12:18] [INFO ] Invariant cache hit.
[2023-03-11 01:12:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 416 ms :[(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-00050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s10 1)), p0:(LT s0 1), p2:(GEQ s12 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 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0 (NOT p2))
Knowledge based reduction with 9 factoid took 285 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-00050-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00050-LTLFireability-00 finished in 1231 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 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 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 20 place count 11 transition count 11
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 22 place count 10 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 10 transition count 10
Applied a total of 23 rules in 13 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 01:12:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 01:12:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 01:12:19] [INFO ] Invariant cache hit.
[2023-03-11 01:12:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-11 01:12:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:12:19] [INFO ] Invariant cache hit.
[2023-03-11 01:12:19] [INFO ] Dead Transitions using invariants and state equation in 30 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 108 ms. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-00050-LTLFireability-01 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:(OR (LT s4 1) (LT s6 1)), p0:(AND (GEQ s0 1) (OR (LT s1 1) (LT s7 1)) (OR (LT s4 1) (LT s6 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 14527 reset in 147 ms.
Stack based approach found an accepted trace after 12 steps with 1 reset with depth 9 and stack size 9 in 1 ms.
FORMULA FMS-PT-00050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00050-LTLFireability-01 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0||X(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.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 01:12:19] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-11 01:12:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 01:12:19] [INFO ] Invariant cache hit.
[2023-03-11 01:12:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-11 01:12:19] [INFO ] Invariant cache hit.
[2023-03-11 01:12:19] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : FMS-PT-00050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(LT s0 1), p1:(OR (LT s6 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 699 steps with 0 reset with depth 700 and stack size 699 in 2 ms.
FORMULA FMS-PT-00050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00050-LTLFireability-02 finished in 395 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))||(G(!p1)&&(p2 U p3))))'
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 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-11 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (AND (NOT p1) (NOT p3)), false, p1, (AND (NOT p1) (NOT p3)), (OR (NOT p3) p1), (NOT p1)]
Running random walk in product with property : FMS-PT-00050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p3 p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 2}, { cond=(OR p1 (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 6}], [{ cond=(OR p1 (AND (NOT p3) (NOT p2))), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(GEQ s12 1), p3:(GEQ s16 1), p2:(LT s21 1), p0:(AND (GEQ s8 1) (GEQ s10 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00050-LTLFireability-03 finished in 415 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(X(G(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 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-11 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [INFO ] Dead Transitions using invariants and state equation in 28 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 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FMS-PT-00050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3 1), p1:(LT s0 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 15 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00050-LTLFireability-04 finished in 279 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 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 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 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 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 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 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 11 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-11 01:12:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 01:12:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-11 01:12:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:12:20] [INFO ] Invariant cache hit.
[2023-03-11 01:12:20] [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 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00050-LTLFireability-06 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:(LT 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 1 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00050-LTLFireability-06 finished in 180 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 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 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 01:12:21] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 01:12:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 01:12:21] [INFO ] Invariant cache hit.
[2023-03-11 01:12:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-11 01:12:21] [INFO ] Invariant cache hit.
[2023-03-11 01:12:21] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0]
Running random walk in product with property : FMS-PT-00050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s0 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 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00050-LTLFireability-08 finished in 196 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(p0)))||X((p1||F(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 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 01:12:21] [INFO ] Invariant cache hit.
[2023-03-11 01:12:21] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 01:12:21] [INFO ] Invariant cache hit.
[2023-03-11 01:12:21] [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-11 01:12:21] [INFO ] Invariant cache hit.
[2023-03-11 01:12:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FMS-PT-00050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s13 1) (LT s15 1)), p2:(AND (GEQ s5 1) (GEQ s7 1)), p1:(GEQ s16 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Product exploration explored 100000 steps with 33333 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-00050-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00050-LTLFireability-09 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||(p1 U (G(p1)||(F(p3)&&p2)))))'
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 01:12:21] [INFO ] Invariant cache hit.
[2023-03-11 01:12:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 01:12:22] [INFO ] Invariant cache hit.
[2023-03-11 01:12:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-11 01:12:22] [INFO ] Invariant cache hit.
[2023-03-11 01:12:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 382 ms :[(NOT p0), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : FMS-PT-00050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p3) p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=4, aps=[p3:(LT s0 1), p0:(GEQ s12 1), p2:(AND (LT s14 1) (OR (GEQ s14 1) (GEQ s12 1))), p1:(OR (GEQ s14 1) (GEQ s12 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1285 reset in 110 ms.
Stack based approach found an accepted trace after 71 steps with 1 reset with depth 18 and stack size 18 in 0 ms.
FORMULA FMS-PT-00050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00050-LTLFireability-10 finished in 616 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||X(!p1)))&&F(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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 16 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 11 place count 16 transition count 11
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 20 place count 11 transition count 11
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 23 place count 9 transition count 10
Applied a total of 23 rules in 6 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-11 01:12:22] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 01:12:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 01:12:22] [INFO ] Invariant cache hit.
[2023-03-11 01:12:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 01:12:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:12:22] [INFO ] Invariant cache hit.
[2023-03-11 01:12:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 10/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 9/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (NOT p2), (AND (NOT p0) p1)]
Running random walk in product with property : FMS-PT-00050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s1 1), p0:(GEQ s8 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00050-LTLFireability-11 finished in 279 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((p1&&G(p2)))&&p0)))'
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 01:12:22] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-11 01:12:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 01:12:22] [INFO ] Invariant cache hit.
[2023-03-11 01:12:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-11 01:12:22] [INFO ] Invariant cache hit.
[2023-03-11 01:12:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-00050-LTLFireability-12 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (LT s0 1) (GEQ s19 1)), p2:(OR (AND (GEQ s13 1) (GEQ s15 1)) (GEQ s19 1)), p1:(GEQ s19 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, 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-00050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00050-LTLFireability-12 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' '!(X((!p0&&F((X(p0)||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 01:12:23] [INFO ] Invariant cache hit.
[2023-03-11 01:12:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 01:12:23] [INFO ] Invariant cache hit.
[2023-03-11 01:12:23] [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-11 01:12:23] [INFO ] Invariant cache hit.
[2023-03-11 01:12:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : FMS-PT-00050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(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, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00050-LTLFireability-13 finished in 239 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((G(p0)||(X(p0)&&G(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 01:12:23] [INFO ] Invariant cache hit.
[2023-03-11 01:12:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 01:12:23] [INFO ] Invariant cache hit.
[2023-03-11 01:12:23] [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-11 01:12:23] [INFO ] Invariant cache hit.
[2023-03-11 01:12:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 305 ms :[false, false, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s0 1), p1:(LT s21 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1462 reset in 154 ms.
Stack based approach found an accepted trace after 620 steps with 12 reset with depth 112 and stack size 110 in 2 ms.
FORMULA FMS-PT-00050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00050-LTLFireability-14 finished in 577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(!p1)))))'
Support contains 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 4 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 6 rules applied. Total rules applied 9 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 20 place count 11 transition count 11
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 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 24 place count 9 transition count 9
Applied a total of 24 rules in 7 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-03-11 01:12:23] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 01:12:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 01:12:24] [INFO ] Invariant cache hit.
[2023-03-11 01:12:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-11 01:12:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 01:12:24] [INFO ] Invariant cache hit.
[2023-03-11 01:12:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 9/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : FMS-PT-00050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s0 1), p1:(OR (LT s4 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 5 steps with 1 reset with depth 3 and stack size 3 in 0 ms.
FORMULA FMS-PT-00050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00050-LTLFireability-15 finished in 361 ms.
All properties solved by simple procedures.
Total runtime 7223 ms.
ITS solved all properties within timeout

BK_STOP 1678497145321

--------------------
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-00050"
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-00050, 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-167838855500220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00050.tgz
mv FMS-PT-00050 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;