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.r231-tall-167856415900324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Kanban-PT-20000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415900324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.3K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:58 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.7K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 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 14K 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 Kanban-PT-20000-LTLFireability-00
FORMULA_NAME Kanban-PT-20000-LTLFireability-01
FORMULA_NAME Kanban-PT-20000-LTLFireability-02
FORMULA_NAME Kanban-PT-20000-LTLFireability-03
FORMULA_NAME Kanban-PT-20000-LTLFireability-04
FORMULA_NAME Kanban-PT-20000-LTLFireability-05
FORMULA_NAME Kanban-PT-20000-LTLFireability-06
FORMULA_NAME Kanban-PT-20000-LTLFireability-07
FORMULA_NAME Kanban-PT-20000-LTLFireability-08
FORMULA_NAME Kanban-PT-20000-LTLFireability-09
FORMULA_NAME Kanban-PT-20000-LTLFireability-10
FORMULA_NAME Kanban-PT-20000-LTLFireability-11
FORMULA_NAME Kanban-PT-20000-LTLFireability-12
FORMULA_NAME Kanban-PT-20000-LTLFireability-13
FORMULA_NAME Kanban-PT-20000-LTLFireability-14
FORMULA_NAME Kanban-PT-20000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679444507676

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-20000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:21:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 00:21:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:21:49] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-22 00:21:49] [INFO ] Transformed 16 places.
[2023-03-22 00:21:49] [INFO ] Transformed 16 transitions.
[2023-03-22 00:21:49] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 73 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 Kanban-PT-20000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 00:21:49] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-22 00:21:49] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-22 00:21:49] [INFO ] Invariant cache hit.
[2023-03-22 00:21:49] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-22 00:21:49] [INFO ] Invariant cache hit.
[2023-03-22 00:21:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 13 out of 16 places after structural reductions.
[2023-03-22 00:21:49] [INFO ] Flatten gal took : 14 ms
[2023-03-22 00:21:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 00:21:49] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 20001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=1333 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:21:49] [INFO ] Invariant cache hit.
[2023-03-22 00:21:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 00:21:49] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:21:49] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:21:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:21:49] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:21:50] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:21:50] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 00:21:50] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 39851 steps, including 0 resets, run visited all 1 properties in 91 ms. (steps per millisecond=437 )
Parikh walk visited 1 properties in 92 ms.
FORMULA Kanban-PT-20000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Kanban-PT-20000-LTLFireability-00 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' '!(X(X(G(p0))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 00:21:50] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:21:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 00:21:50] [INFO ] Invariant cache hit.
[2023-03-22 00:21:50] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 00:21:50] [INFO ] Invariant cache hit.
[2023-03-22 00:21:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA Kanban-PT-20000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-01 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0) U p1))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 00:21:51] [INFO ] Invariant cache hit.
[2023-03-22 00:21:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 00:21:51] [INFO ] Invariant cache hit.
[2023-03-22 00:21:51] [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-22 00:21:51] [INFO ] Invariant cache hit.
[2023-03-22 00:21:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(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][false, false]]
Product exploration explored 100000 steps with 2189 reset in 198 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-02 finished in 380 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(X(p1))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 3 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 00:21:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:21:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 00:21:51] [INFO ] Invariant cache hit.
[2023-03-22 00:21:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 00:21:51] [INFO ] Invariant cache hit.
[2023-03-22 00:21:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s11 1) (GEQ s3 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 10705 reset in 107 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-03 finished in 422 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(F(!p0))))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 00:21:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:21:51] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 00:21:51] [INFO ] Invariant cache hit.
[2023-03-22 00:21:51] [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-22 00:21:51] [INFO ] Invariant cache hit.
[2023-03-22 00:21:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 84 ms :[p0, p0, p0]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 79 ms.
Product exploration explored 100000 steps with 33333 reset in 97 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)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-20000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-20000-LTLFireability-04 finished in 434 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)))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 00:21:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:21:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 00:21:52] [INFO ] Invariant cache hit.
[2023-03-22 00:21:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 00:21:52] [INFO ] Invariant cache hit.
[2023-03-22 00:21:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1848 reset in 112 ms.
Stack based approach found an accepted trace after 23 steps with 1 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-05 finished in 333 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 U X(p1))&&G(F(p0))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 00:21:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:21:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 00:21:52] [INFO ] Invariant cache hit.
[2023-03-22 00:21:52] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-22 00:21:52] [INFO ] Invariant cache hit.
[2023-03-22 00:21:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s6 1), p1:(GEQ s13 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4132 reset in 83 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-20000-LTLFireability-06 finished in 386 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(p1)) U G(p1)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 2830 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 00:21:55] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 00:21:55] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:21:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 00:21:55] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 00:21:55] [INFO ] Invariant cache hit.
[2023-03-22 00:21:55] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-22 00:21:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:21:55] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 00:21:55] [INFO ] Invariant cache hit.
[2023-03-22 00:21:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2934 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-07 finished in 2991 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((G(!p0)||(X(!p0)&&F(!p1))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Applied a total of 3 rules in 3 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 00:21:55] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 00:21:55] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:21:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 00:21:55] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 00:21:55] [INFO ] Invariant cache hit.
[2023-03-22 00:21:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:21:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 00:21:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:21:56] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 00:21:56] [INFO ] Invariant cache hit.
[2023-03-22 00:21:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-20000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-08 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G((p1||G(p2)))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 12
Applied a total of 5 rules in 2846 ms. Remains 12 /16 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2023-03-22 00:21:59] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 12 cols
[2023-03-22 00:21:59] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 00:21:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 00:21:59] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 00:21:59] [INFO ] Invariant cache hit.
[2023-03-22 00:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:21:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 00:21:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:21:59] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 00:21:59] [INFO ] Invariant cache hit.
[2023-03-22 00:21:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2933 ms. Remains : 12/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s4 1), p2:(GEQ s6 1), p0:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1228 steps with 22 reset in 7 ms.
FORMULA Kanban-PT-20000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-09 finished in 3176 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))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 3060 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2023-03-22 00:22:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2023-03-22 00:22:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:22:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 00:22:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 00:22:02] [INFO ] Invariant cache hit.
[2023-03-22 00:22:02] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 00:22:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:22:02] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 00:22:02] [INFO ] Invariant cache hit.
[2023-03-22 00:22:02] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3135 ms. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-20000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-LTLFireability-11 finished in 3178 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((X(p0)||G(p1))) U p2))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 00:22:02] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:22:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 00:22:02] [INFO ] Invariant cache hit.
[2023-03-22 00:22:02] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 00:22:02] [INFO ] Invariant cache hit.
[2023-03-22 00:22:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s3 1) (GEQ s4 1)), p1:(GEQ s3 1), p0:(GEQ s7 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29968 reset in 113 ms.
Product exploration explored 100000 steps with 29905 reset in 83 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 p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 644 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), false, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=2222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:22:03] [INFO ] Invariant cache hit.
[2023-03-22 00:22:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:22:03] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:22:03] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 00:22:03] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 139534 steps, including 0 resets, run visited all 1 properties in 250 ms. (steps per millisecond=558 )
Parikh walk visited 1 properties in 249 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND p0 p1)), (F (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 676 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, false, false, (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[true, false, false, (NOT p1)]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 00:22:05] [INFO ] Invariant cache hit.
[2023-03-22 00:22:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 00:22:05] [INFO ] Invariant cache hit.
[2023-03-22 00:22:05] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 00:22:05] [INFO ] Invariant cache hit.
[2023-03-22 00:22:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 15/15 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 199 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 906124 steps, run visited all 1 properties in 814 ms. (steps per millisecond=1113 )
Probabilistic random walk after 906124 steps, saw 703821 distinct states, run finished after 814 ms. (steps per millisecond=1113 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 13 edges and 15 vertex of which 8 / 15 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 5 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2023-03-22 00:22:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:22:07] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 11 cols
[2023-03-22 00:22:07] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:22:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/15 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32 ms. Remains : 11/15 places, 12/16 transitions.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2023-03-22 00:22:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:22:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 00:22:07] [INFO ] Invariant cache hit.
[2023-03-22 00:22:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 00:22:07] [INFO ] Invariant cache hit.
[2023-03-22 00:22:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 15/15 places, 16/16 transitions.
Treatment of property Kanban-PT-20000-LTLFireability-12 finished in 4726 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(p1)) U (p2 U X(X(G(p3))))))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 3 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 13 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 2 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2023-03-22 00:22:07] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:22:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 00:22:07] [INFO ] Invariant cache hit.
[2023-03-22 00:22:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:07] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 00:22:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:22:07] [INFO ] Invariant cache hit.
[2023-03-22 00:22:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/16 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 13/16 places, 14/16 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : Kanban-PT-20000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 1), p3:(GEQ s7 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 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 56 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 p0) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p3))]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 2) seen :1
Finished Best-First random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-22 00:22:08] [INFO ] Invariant cache hit.
[2023-03-22 00:22:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 00:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 00:22:08] [INFO ] Computed and/alt/rep : 13/18/13 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 00:22:08] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 2 out of 13 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-22 00:22:08] [INFO ] Invariant cache hit.
[2023-03-22 00:22:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 00:22:08] [INFO ] Invariant cache hit.
[2023-03-22 00:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:08] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-22 00:22:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:22:08] [INFO ] Invariant cache hit.
[2023-03-22 00:22:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 13/13 places, 14/14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p3))]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 2) seen :1
Finished Best-First random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND (NOT p0) p3)), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p3))]
[2023-03-22 00:22:08] [INFO ] Invariant cache hit.
[2023-03-22 00:22:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:22:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 00:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:08] [INFO ] [Real]Added 1 Read/Feed constraints in 22 ms returned sat
[2023-03-22 00:22:08] [INFO ] Computed and/alt/rep : 13/18/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 00:22:08] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Support contains 2 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 14/14 transitions.
Graph (trivial) has 7 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 11 /13 variables (removed 2) and now considering 12/14 (removed 2) transitions.
[2023-03-22 00:22:08] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 00:22:08] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-22 00:22:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 00:22:08] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 00:22:08] [INFO ] Invariant cache hit.
[2023-03-22 00:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 00:22:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:22:08] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 00:22:08] [INFO ] Invariant cache hit.
[2023-03-22 00:22:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/13 places, 12/14 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 11/13 places, 12/14 transitions.
Treatment of property Kanban-PT-20000-LTLFireability-14 finished in 1750 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((X(p0)||G(p1))) U p2))'
Found a Lengthening insensitive property : Kanban-PT-20000-LTLFireability-12
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 4 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 00:22:09] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 00:22:09] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:22:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 00:22:09] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:09] [INFO ] Invariant cache hit.
[2023-03-22 00:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 00:22:09] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:09] [INFO ] Invariant cache hit.
[2023-03-22 00:22:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 86 ms. Remains : 12/16 places, 13/16 transitions.
Running random walk in product with property : Kanban-PT-20000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s2 1) (GEQ s3 1)), p1:(GEQ s2 1), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30020 reset in 67 ms.
Product exploration explored 100000 steps with 30070 reset in 73 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 p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 662 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), false, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:22:10] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:10] [INFO ] Invariant cache hit.
[2023-03-22 00:22:10] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 00:22:10] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 00:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:10] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:22:10] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:22:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-22 00:22:10] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:22:10] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:22:10] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 00:22:10] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20000 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=1818 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (AND p1 (NOT p0))), (X p2), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND p0 p1)), (F (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 582 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, false, false, (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[true, false, false, (NOT p1)]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 00:22:11] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:11] [INFO ] Invariant cache hit.
[2023-03-22 00:22:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 00:22:11] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:11] [INFO ] Invariant cache hit.
[2023-03-22 00:22:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 00:22:11] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:11] [INFO ] Invariant cache hit.
[2023-03-22 00:22:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 12/12 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 164 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 778025 steps, run visited all 1 properties in 538 ms. (steps per millisecond=1446 )
Probabilistic random walk after 778025 steps, saw 449756 distinct states, run finished after 539 ms. (steps per millisecond=1443 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Graph (trivial) has 10 edges and 12 vertex of which 4 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 3 ms. Remains 10 /12 variables (removed 2) and now considering 11/13 (removed 2) transitions.
[2023-03-22 00:22:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:22:12] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2023-03-22 00:22:12] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:22:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 11/13 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 ms. Remains : 10/12 places, 11/13 transitions.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 00:22:12] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 00:22:12] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:22:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 00:22:12] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:12] [INFO ] Invariant cache hit.
[2023-03-22 00:22:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:22:12] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 00:22:12] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:22:12] [INFO ] Invariant cache hit.
[2023-03-22 00:22:12] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 12/12 places, 13/13 transitions.
Treatment of property Kanban-PT-20000-LTLFireability-12 finished in 3915 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(p1)) U (p2 U X(X(G(p3))))))))'
[2023-03-22 00:22:12] [INFO ] Flatten gal took : 5 ms
[2023-03-22 00:22:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 00:22:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 0 ms.
Total runtime 23977 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Kanban-PT-20000
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA Kanban-PT-20000-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-20000-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679444534026

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Kanban-PT-20000-LTLFireability-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Kanban-PT-20000-LTLFireability-12
lola: result : false
lola: markings : 40007
lola: fired transitions : 40007
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Kanban-PT-20000-LTLFireability-14
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Kanban-PT-20000-LTLFireability-14
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Kanban-PT-20000-LTLFireability-12: LTL false LTL model checker
Kanban-PT-20000-LTLFireability-14: LTL true LTL model checker


Time elapsed: 1 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-20000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Kanban-PT-20000, 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 r231-tall-167856415900324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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