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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 20:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 20:14 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 26K 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 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 20:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 127K Feb 25 20:16 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-00002-LTLFireability-00
FORMULA_NAME FMS-PT-00002-LTLFireability-01
FORMULA_NAME FMS-PT-00002-LTLFireability-02
FORMULA_NAME FMS-PT-00002-LTLFireability-03
FORMULA_NAME FMS-PT-00002-LTLFireability-04
FORMULA_NAME FMS-PT-00002-LTLFireability-05
FORMULA_NAME FMS-PT-00002-LTLFireability-06
FORMULA_NAME FMS-PT-00002-LTLFireability-07
FORMULA_NAME FMS-PT-00002-LTLFireability-08
FORMULA_NAME FMS-PT-00002-LTLFireability-09
FORMULA_NAME FMS-PT-00002-LTLFireability-10
FORMULA_NAME FMS-PT-00002-LTLFireability-11
FORMULA_NAME FMS-PT-00002-LTLFireability-12
FORMULA_NAME FMS-PT-00002-LTLFireability-13
FORMULA_NAME FMS-PT-00002-LTLFireability-14
FORMULA_NAME FMS-PT-00002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678495162946

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-00002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 00:39:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:39:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:39:24] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:39:24] [INFO ] Transformed 22 places.
[2023-03-11 00:39:24] [INFO ] Transformed 20 transitions.
[2023-03-11 00:39:24] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 8 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 00:39:24] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-11 00:39:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-11 00:39:24] [INFO ] Invariant cache hit.
[2023-03-11 00:39:24] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-11 00:39:24] [INFO ] Invariant cache hit.
[2023-03-11 00:39:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 20 out of 22 places after structural reductions.
[2023-03-11 00:39:25] [INFO ] Flatten gal took : 15 ms
[2023-03-11 00:39:25] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:39:25] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 165 steps, including 0 resets, run visited all 20 properties in 22 ms. (steps per millisecond=7 )
FORMULA FMS-PT-00002-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1)||X(X(G(p2))))))'
Support contains 6 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 00:39:25] [INFO ] Invariant cache hit.
[2023-03-11 00:39:25] [INFO ] Implicit Places using invariants in 30 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 21/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1)), p1:(AND (GEQ s8 1) (GEQ s10 1)), p2:(AND (GEQ s2 1) (GEQ s17 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, null, null][false, false, 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-00002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-LTLFireability-00 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 22 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 7 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 25 place count 7 transition count 6
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 28 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 5 transition count 5
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 31 place count 4 transition count 4
Applied a total of 31 rules in 15 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 00:39:26] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 00:39:26] [INFO ] Implicit Places using invariants in 24 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/22 places, 4/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 3/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 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 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-LTLFireability-01 finished in 137 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 00:39:26] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 00:39:26] [INFO ] Implicit Places using invariants in 31 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-02 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:(LT s1 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 89 steps with 0 reset in 4 ms.
FORMULA FMS-PT-00002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-LTLFireability-02 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U ((!p0 U p1) U X(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 00:39:26] [INFO ] Invariant cache hit.
[2023-03-11 00:39:26] [INFO ] Implicit Places using invariants in 34 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), false, (NOT p2)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}]], initial=0, aps=[p1:(GEQ s11 1), p0:(LT s13 1), p2:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17823 reset in 221 ms.
Stack based approach found an accepted trace after 155 steps with 27 reset with depth 6 and stack size 6 in 1 ms.
FORMULA FMS-PT-00002-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00002-LTLFireability-03 finished in 659 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)))'
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.
[2023-03-11 00:39:26] [INFO ] Invariant cache hit.
[2023-03-11 00:39:26] [INFO ] Implicit Places using invariants in 32 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : FMS-PT-00002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 98 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-00002-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00002-LTLFireability-05 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(!p0) U 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.
[2023-03-11 00:39:27] [INFO ] Invariant cache hit.
[2023-03-11 00:39:27] [INFO ] Implicit Places using invariants in 32 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 21/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1)), p0, (NOT p0)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1)), p1:(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, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-LTLFireability-06 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(((F(G(!p0))&&F(p1)) U (X(G(p3))&&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 3 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-11 00:39:27] [INFO ] Invariant cache hit.
[2023-03-11 00:39:27] [INFO ] Implicit Places using invariants in 36 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 21/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), p0, (NOT p1), (NOT p3), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : FMS-PT-00002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={0} source=1 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s7 1)), p1:(LT s4 1), p0:(AND (GEQ s5 1) (GEQ s7 1)), p3:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 121 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 77 in 1 ms.
FORMULA FMS-PT-00002-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00002-LTLFireability-07 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(!p1)))))'
Support contains 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 00:39:28] [INFO ] Invariant cache hit.
[2023-03-11 00:39:28] [INFO ] Implicit Places using invariants in 27 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s17 1), p1:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Product exploration explored 100000 steps with 33333 reset in 138 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 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-00002-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00002-LTLFireability-08 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(!p1))||(p2&&F(!p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 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 7 rules applied. Total rules applied 11 place count 16 transition count 15
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 15 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 14 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 14 place count 14 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 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 2 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 00:39:28] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 00:39:28] [INFO ] Implicit Places using invariants in 30 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 9/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35 ms. Remains : 8/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LT s4 1), p0:(LT s2 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15407 reset in 81 ms.
Stack based approach found an accepted trace after 36 steps with 5 reset with depth 4 and stack size 4 in 0 ms.
FORMULA FMS-PT-00002-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00002-LTLFireability-10 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(!p1))))'
Support contains 2 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 0 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.
Iterating post reduction 2 with 7 rules applied. Total rules applied 20 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 6 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 5 transition count 6
Applied a total of 29 rules in 7 ms. Remains 5 /22 variables (removed 17) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 5 cols
[2023-03-11 00:39:28] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 00:39:28] [INFO ] Implicit Places using invariants in 16 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 6/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24 ms. Remains : 4/22 places, 6/20 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND p0 p1)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 1), p1:(LT s1 1)], nbAcceptance=2, 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-00002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00002-LTLFireability-11 finished in 79 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(!p0)||(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.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:39:29] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-11 00:39:29] [INFO ] Implicit Places using invariants in 44 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 21/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : FMS-PT-00002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LT s6 1), p1:(GEQ s20 1), p2:(AND (GEQ s5 1) (GEQ s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA FMS-PT-00002-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00002-LTLFireability-12 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' '!(G(F(p0)))'
Support contains 4 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 18 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 16 place count 13 transition count 13
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 3 with 4 rules applied. Total rules applied 20 place count 11 transition count 11
Applied a total of 20 rules in 5 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 00:39:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 00:39:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 00:39:29] [INFO ] Invariant cache hit.
[2023-03-11 00:39:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-11 00:39:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 00:39:29] [INFO ] Invariant cache hit.
[2023-03-11 00:39:29] [INFO ] Dead Transitions using invariants and state equation in 26 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 89 ms. Remains : 11/22 places, 11/20 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-13 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:(OR (LT s6 1) (LT s8 1) (AND (LT s3 1) (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]]
Product exploration explored 100000 steps with 8887 reset in 110 ms.
Stack based approach found an accepted trace after 127 steps with 10 reset with depth 6 and stack size 6 in 1 ms.
FORMULA FMS-PT-00002-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00002-LTLFireability-13 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' '!(F(X((X(p0) U p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 00:39:29] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 00:39:29] [INFO ] Implicit Places using invariants in 23 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 21/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2368 reset in 112 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA FMS-PT-00002-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00002-LTLFireability-14 finished in 216 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(((!p1 U (p2||G(!p1)))||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.
[2023-03-11 00:39:29] [INFO ] Invariant cache hit.
[2023-03-11 00:39:29] [INFO ] Implicit Places using invariants in 25 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 20/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : FMS-PT-00002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s18 1) (LT s0 1)), p2:(AND (LT s0 1) (LT s18 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Product exploration explored 100000 steps with 33333 reset in 68 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 (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p2) (NOT p1))
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-00002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00002-LTLFireability-15 finished in 406 ms.
All properties solved by simple procedures.
Total runtime 5877 ms.
ITS solved all properties within timeout

BK_STOP 1678495171298

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

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00002.tgz
mv FMS-PT-00002 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 ;