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-167856415800275.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-00200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415800275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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.9K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 12K Feb 25 12:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 12:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 119K 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-00200-LTLCardinality-00
FORMULA_NAME Kanban-PT-00200-LTLCardinality-01
FORMULA_NAME Kanban-PT-00200-LTLCardinality-02
FORMULA_NAME Kanban-PT-00200-LTLCardinality-03
FORMULA_NAME Kanban-PT-00200-LTLCardinality-04
FORMULA_NAME Kanban-PT-00200-LTLCardinality-05
FORMULA_NAME Kanban-PT-00200-LTLCardinality-06
FORMULA_NAME Kanban-PT-00200-LTLCardinality-07
FORMULA_NAME Kanban-PT-00200-LTLCardinality-08
FORMULA_NAME Kanban-PT-00200-LTLCardinality-09
FORMULA_NAME Kanban-PT-00200-LTLCardinality-10
FORMULA_NAME Kanban-PT-00200-LTLCardinality-11
FORMULA_NAME Kanban-PT-00200-LTLCardinality-12
FORMULA_NAME Kanban-PT-00200-LTLCardinality-13
FORMULA_NAME Kanban-PT-00200-LTLCardinality-14
FORMULA_NAME Kanban-PT-00200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679443768868

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-00200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 00:09:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 00:09:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:09:30] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-22 00:09:30] [INFO ] Transformed 16 places.
[2023-03-22 00:09:30] [INFO ] Transformed 16 transitions.
[2023-03-22 00:09:30] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 16 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:09:30] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-22 00:09:30] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-22 00:09:30] [INFO ] Invariant cache hit.
[2023-03-22 00:09:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-22 00:09:30] [INFO ] Invariant cache hit.
[2023-03-22 00:09:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 00:09:31] [INFO ] Flatten gal took : 13 ms
[2023-03-22 00:09:31] [INFO ] Flatten gal took : 3 ms
[2023-03-22 00:09:31] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10063 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=214 ) properties (out of 37) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:09:31] [INFO ] Invariant cache hit.
[2023-03-22 00:09:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-22 00:09:31] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:09:31] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:09:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:09:31] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-22 00:09:31] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:09:31] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 00:09:31] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 1582 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=316 )
Parikh walk visited 3 properties in 29 ms.
FORMULA Kanban-PT-00200-LTLCardinality-07 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' '!(((p0||X(G(p1))) U X((!p1 U X(p0)))))'
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 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:09:32] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:09:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 00:09:32] [INFO ] Invariant cache hit.
[2023-03-22 00:09:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-22 00:09:32] [INFO ] Invariant cache hit.
[2023-03-22 00:09:32] [INFO ] Dead Transitions using invariants and state equation in 25 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 91 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 663 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}, { cond=p1, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 3 s3), p1:(GT s12 s13)], 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, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Product exploration explored 100000 steps with 33333 reset in 111 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 p1), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-00200-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-00200-LTLCardinality-00 finished in 1298 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||G((p1 U X(p2))))) U G(p3)))'
Support contains 6 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 0 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:09:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 00:09:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 00:09:33] [INFO ] Invariant cache hit.
[2023-03-22 00:09:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-22 00:09:33] [INFO ] Invariant cache hit.
[2023-03-22 00:09:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND p3 p0), acceptance={} source=7 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p3), acceptance={} source=9 dest: 6}, { cond=p3, acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(OR (GT s0 s1) (LEQ s4 s13)), p0:(LEQ s4 s8), p1:(LEQ 3 s10), p2:(LEQ s4 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 124 ms.
Product exploration explored 100000 steps with 49 reset in 278 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 p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1576 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10058 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 00:09:36] [INFO ] Invariant cache hit.
[2023-03-22 00:09:36] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 00:09:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:09:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:09:36] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 00:09:36] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 00:09:36] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1605 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=321 )
Parikh walk visited 2 properties in 26 ms.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p0) (NOT p1)))), (F (NOT (AND p3 (NOT p0)))), (F (NOT p2)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (AND (NOT p3) p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p3) p0 (NOT p1))), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p2) p1)), (F (AND p3 (NOT p2))), (F (NOT p3)), (F (AND (NOT p3) (NOT p2))), (F (AND p3 p0 (NOT p1))), (F p0), (F (AND p3 p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 31 factoid took 2097 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 395 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 6 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 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 00:09:39] [INFO ] Invariant cache hit.
[2023-03-22 00:09:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 00:09:39] [INFO ] Invariant cache hit.
[2023-03-22 00:09:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 00:09:39] [INFO ] Invariant cache hit.
[2023-03-22 00:09:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 16/16 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 p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1592 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10052 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1116 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 00:09:41] [INFO ] Invariant cache hit.
[2023-03-22 00:09:41] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 00:09:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:09:41] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:09:41] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 00:09:41] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 00:09:41] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 1130 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=376 )
Parikh walk visited 4 properties in 49 ms.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p0) (NOT p1)))), (F (NOT (AND p3 (NOT p0)))), (F (NOT p2)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p3) p0)), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0 (NOT p1))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p2) p1)), (F (NOT p3)), (F (AND p3 (NOT p2))), (F (AND (NOT p3) (NOT p2))), (F (AND p3 p0 (NOT p1))), (F p0), (F (AND p3 p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 31 factoid took 2379 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 426 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 423 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 26 reset in 107 ms.
Product exploration explored 100000 steps with 10 reset in 154 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 398 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 6 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 6 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 7 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 12 ms. Remains 14 /16 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2023-03-22 00:09:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:09:46] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 14 cols
[2023-03-22 00:09:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 00:09:46] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/16 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 14/16 places, 14/16 transitions.
Support contains 6 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 1 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:09:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:46] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 16/16 places, 16/16 transitions.
Treatment of property Kanban-PT-00200-LTLCardinality-01 finished in 13027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 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 4 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
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 14
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 14
Applied a total of 3 rules in 3 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:09:46] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-22 00:09:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:46] [INFO ] Dead Transitions using invariants and state equation in 30 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 164 ms. Remains : 13/16 places, 14/16 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (GT 3 s4) (GT s7 s0)) (GT s5 s10)), p1:(LEQ s11 s10)], 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 17 steps with 3 reset in 1 ms.
FORMULA Kanban-PT-00200-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-02 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&(p1||F(!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 6 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
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 14
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 14
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 13
Applied a total of 5 rules in 11 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 12 cols
[2023-03-22 00:09:46] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 00:09:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s5), p1:(AND (LEQ s9 s4) (LEQ 1 s3)), p2:(OR (LEQ 3 s5) (LEQ s11 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 191 steps with 2 reset in 2 ms.
FORMULA Kanban-PT-00200-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-03 finished in 257 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))) U !p0))'
Support contains 4 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 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
Applied a total of 1 rules in 4 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 00:09:46] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 12 cols
[2023-03-22 00:09:46] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 00:09:46] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-22 00:09:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:09:46] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2023-03-22 00:09:46] [INFO ] Invariant cache hit.
[2023-03-22 00:09:47] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=p0, 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}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3 s7), p1:(LEQ s4 s6)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 89675 steps with 0 reset in 178 ms.
FORMULA Kanban-PT-00200-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-04 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
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 4 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:09:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:09:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 00:09:47] [INFO ] Invariant cache hit.
[2023-03-22 00:09:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 00:09:47] [INFO ] Invariant cache hit.
[2023-03-22 00:09:47] [INFO ] Dead Transitions using invariants and state equation in 26 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 77 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 632 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-05 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 3 s1), p1:(LEQ s1 s5)], 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 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00200-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-05 finished in 732 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&&(p1||X(F((p1&&X(F(p0)))))))))'
Support contains 3 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 6 / 16 are part of one of the 3 SCC in 1 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 11 transition count 12
Iterating global reduction 0 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:09:48] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2023-03-22 00:09:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 00:09:48] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-22 00:09:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:09:48] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] Dead Transitions using invariants and state equation in 24 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 91 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s3 s5), p1:(LEQ 1 s9)], 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-06 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 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:09:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] Dead Transitions using invariants and state equation in 21 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 73 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-08 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:(LEQ 3 s5)], 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 0 ms.
FORMULA Kanban-PT-00200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-08 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(p0))'
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 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
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 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
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 11 transition count 12
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 5 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2023-03-22 00:09:48] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 00:09:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 00:09:48] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 00:09:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:09:48] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [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 92 ms. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s7 s3)], 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 16 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00200-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-09 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(((p0 U p1) U (!p0&&(p0 U p1)))))'
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 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:09:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] Dead Transitions using invariants and state equation in 21 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 65 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s11 s0), p1:(LEQ 1 s3)], 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 4983 reset in 79 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-00200-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-10 finished in 240 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 4 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:09:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 00:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [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:09:48] [INFO ] Invariant cache hit.
[2023-03-22 00:09:48] [INFO ] Dead Transitions using invariants and state equation in 20 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 80 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-11 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:(AND (LEQ s2 s13) (LEQ s1 s6))], 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 12 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00200-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-11 finished in 169 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 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
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 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2023-03-22 00:09:49] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2023-03-22 00:09:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 00:09:49] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-22 00:09:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:09:49] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] Dead Transitions using invariants and state equation in 18 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 91 ms. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-12 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 (LEQ 2 s5) (GT 2 s7))], 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 Kanban-PT-00200-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-12 finished in 159 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((G((p0||F(p1))) U (p2 U p3))))'
Support contains 6 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 6 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
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 3 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 00:09:49] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 00:09:49] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 00:09:49] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-22 00:09:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:09:49] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ s4 s10), p2:(LEQ 1 s7), p0:(LEQ s10 s9), p1:(LEQ s5 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 38079 steps with 0 reset in 42 ms.
FORMULA Kanban-PT-00200-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-13 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(F(p1) U p2)))'
Support contains 4 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:09:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] Dead Transitions using invariants and state equation in 21 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 68 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 2 s14), p1:(GT s3 s11), p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1134 reset in 105 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 0 ms.
FORMULA Kanban-PT-00200-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-14 finished in 366 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((F((p0&&F(p1)))&&G(p2))))))'
Support contains 5 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:09:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 00:09:49] [INFO ] Invariant cache hit.
[2023-03-22 00:09:49] [INFO ] Dead Transitions using invariants and state equation in 31 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 79 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s13 s6), p0:(LEQ s2 s12), p1:(LEQ 1 s0)], 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 336 reset in 118 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 63 in 0 ms.
FORMULA Kanban-PT-00200-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-00200-LTLCardinality-15 finished in 436 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||G((p1 U X(p2))))) U G(p3)))'
Found a Lengthening insensitive property : Kanban-PT-00200-LTLCardinality-01
Stuttering acceptance computed with spot in 337 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 6 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 6 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.
Applied a total of 1 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2023-03-22 00:09:50] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 14 cols
[2023-03-22 00:09:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 00:09:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 00:09:50] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 00:09:50] [INFO ] Invariant cache hit.
[2023-03-22 00:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:50] [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-22 00:09:50] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 00:09:50] [INFO ] Invariant cache hit.
[2023-03-22 00:09:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/16 places, 14/16 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 74 ms. Remains : 14/16 places, 14/16 transitions.
Running random walk in product with property : Kanban-PT-00200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND p3 p0), acceptance={} source=7 dest: 7}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p3), acceptance={} source=9 dest: 6}, { cond=p3, acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(OR (GT s0 s1) (LEQ s4 s11)), p0:(LEQ s4 s7), p1:(LEQ 3 s9), p2:(LEQ s4 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 104 ms.
Product exploration explored 100000 steps with 43 reset in 118 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 p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1773 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10056 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2514 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:09:53] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 00:09:53] [INFO ] Invariant cache hit.
[2023-03-22 00:09:53] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:09:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 00:09:53] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:09:53] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:53] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:53] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 00:09:53] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 14/14 transitions.
Drop transitions 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 3 rules applied. Total rules applied 3 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 13 transition count 10
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 6 place count 12 transition count 10
Applied a total of 6 rules in 3 ms. Remains 12 /14 variables (removed 2) and now considering 10/14 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 12/14 places, 10/14 transitions.
Incomplete random walk after 10052 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3350 ) 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 2519 steps, run visited all 1 properties in 12 ms. (steps per millisecond=209 )
Probabilistic random walk after 2519 steps, saw 1872 distinct states, run finished after 13 ms. (steps per millisecond=193 ) properties seen :1
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p0) (NOT p1)))), (F (NOT (AND p3 (NOT p0)))), (F (NOT p2)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (AND (NOT p3) p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p3) p0 (NOT p1))), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p2) p1)), (F (AND (NOT p3) (NOT p0))), (F (AND p3 (NOT p2))), (F (NOT p3)), (F (AND (NOT p3) (NOT p2))), (F (AND p3 p0 (NOT p1))), (F p0), (F (AND p3 p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 31 factoid took 2191 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 336 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-22 00:09:56] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 00:09:56] [INFO ] Invariant cache hit.
[2023-03-22 00:09:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 00:09:56] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 00:09:56] [INFO ] Invariant cache hit.
[2023-03-22 00:09:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 00:09:56] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 00:09:56] [INFO ] Invariant cache hit.
[2023-03-22 00:09:56] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 14/14 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 p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 1761 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10054 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1117 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 00:09:58] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-22 00:09:58] [INFO ] Invariant cache hit.
[2023-03-22 00:09:58] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 00:09:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:09:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 00:09:58] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 00:09:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 00:09:58] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 00:09:58] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 00:09:58] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 66 ms.
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 14/14 transitions.
Drop transitions 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 3 rules applied. Total rules applied 3 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 13 transition count 10
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 6 place count 12 transition count 10
Applied a total of 6 rules in 2 ms. Remains 12 /14 variables (removed 2) and now considering 10/14 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 12/14 places, 10/14 transitions.
Incomplete random walk after 10057 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3352 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-22 00:09:58] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 00:09:58] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:09:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 00:09:58] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:09:58] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:09:58] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 00:09:58] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1010 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=505 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X p3), (X (AND p3 (NOT p0) (NOT p1))), (X (AND p3 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p0) p1))), (X (X p3)), (X (X p2)), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p3 p0)))), true, (X (X (AND p3 (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p3 (NOT p0) (NOT p1)))), (F (NOT (AND p3 (NOT p0)))), (F (NOT p2)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p3) p0)), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p3) (NOT p0))), (F (NOT p3)), (F (AND p3 (NOT p2))), (F (AND (NOT p3) (NOT p2))), (F (AND p3 p0 (NOT p1))), (F p0), (F (AND p3 p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F p1)]
Knowledge based reduction with 31 factoid took 2099 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 331 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 318 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Entered a terminal (fully accepting) state of product in 44375 steps with 5 reset in 53 ms.
Treatment of property Kanban-PT-00200-LTLCardinality-01 finished in 11632 ms.
FORMULA Kanban-PT-00200-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-22 00:10:01] [INFO ] Flatten gal took : 6 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 31681 ms.
ITS solved all properties within timeout

BK_STOP 1679443803064

--------------------
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 LTLCardinality -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="Kanban-PT-00200"
export BK_EXAMINATION="LTLCardinality"
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-00200, examination is LTLCardinality"
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-167856415800275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00200.tgz
mv Kanban-PT-00200 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;