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.r229-tall-167856413000299.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 itstools
Input is Kanban-PT-02000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413000299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 11:57 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.5K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 11:58 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-02000-LTLCardinality-00
FORMULA_NAME Kanban-PT-02000-LTLCardinality-01
FORMULA_NAME Kanban-PT-02000-LTLCardinality-02
FORMULA_NAME Kanban-PT-02000-LTLCardinality-03
FORMULA_NAME Kanban-PT-02000-LTLCardinality-04
FORMULA_NAME Kanban-PT-02000-LTLCardinality-05
FORMULA_NAME Kanban-PT-02000-LTLCardinality-06
FORMULA_NAME Kanban-PT-02000-LTLCardinality-07
FORMULA_NAME Kanban-PT-02000-LTLCardinality-08
FORMULA_NAME Kanban-PT-02000-LTLCardinality-09
FORMULA_NAME Kanban-PT-02000-LTLCardinality-10
FORMULA_NAME Kanban-PT-02000-LTLCardinality-11
FORMULA_NAME Kanban-PT-02000-LTLCardinality-12
FORMULA_NAME Kanban-PT-02000-LTLCardinality-13
FORMULA_NAME Kanban-PT-02000-LTLCardinality-14
FORMULA_NAME Kanban-PT-02000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679465686783

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-02000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-22 06:14:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 06:14:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:14:48] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-22 06:14:48] [INFO ] Transformed 16 places.
[2023-03-22 06:14:48] [INFO ] Transformed 16 transitions.
[2023-03-22 06:14:48] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Kanban-PT-02000-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 10 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 06:14:48] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-22 06:14:48] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-22 06:14:48] [INFO ] Invariant cache hit.
[2023-03-22 06:14:48] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-22 06:14:48] [INFO ] Invariant cache hit.
[2023-03-22 06:14:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:14:49] [INFO ] Flatten gal took : 1042 ms
[2023-03-22 06:14:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:14:49] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-22 06:14:50] [INFO ] Invariant cache hit.
[2023-03-22 06:14:50] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 06:14:50] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 06:14:50] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2023-03-22 06:14:50] [INFO ] After 23ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 06:14:50] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 06:14:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 06:14:50] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 06:14:50] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 06:14:50] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 06:14:50] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 27899 steps, including 0 resets, run visited all 10 properties in 564 ms. (steps per millisecond=49 )
Parikh walk visited 10 properties in 565 ms.
FORMULA Kanban-PT-02000-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((F(p1) U X(p2))))))'
Support contains 7 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 06:14:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:14:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 06:14:51] [INFO ] Invariant cache hit.
[2023-03-22 06:14:51] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 06:14:51] [INFO ] Invariant cache hit.
[2023-03-22 06:14:51] [INFO ] Dead Transitions using invariants and state equation in 24 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 78 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 502 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 2}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=9 dest: 9}]], initial=1, aps=[p1:(OR (LEQ s6 s5) (LEQ s4 s3)), p2:(LEQ s9 s7), p0:(LEQ s7 s8)], 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 33225 reset in 231 ms.
Product exploration explored 100000 steps with 33285 reset in 176 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 p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1217 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 06:14:54] [INFO ] Invariant cache hit.
[2023-03-22 06:14:54] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 06:14:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 06:14:54] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 06:14:54] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 06:14:54] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 44649 steps, including 1 resets, run visited all 1 properties in 55 ms. (steps per millisecond=811 )
Parikh walk visited 6 properties in 531 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 23 factoid took 1797 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 354 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 06:14:57] [INFO ] Invariant cache hit.
[2023-03-22 06:14:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 06:14:57] [INFO ] Invariant cache hit.
[2023-03-22 06:14:57] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 06:14:57] [INFO ] Invariant cache hit.
[2023-03-22 06:14:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 15/15 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1321 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 06:14:59] [INFO ] Invariant cache hit.
[2023-03-22 06:14:59] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 06:14:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 06:14:59] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 06:14:59] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 06:14:59] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 21685 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=1084 )
Parikh walk visited 6 properties in 583 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 23 factoid took 1865 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 330 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 363 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 33289 reset in 95 ms.
Product exploration explored 100000 steps with 33356 reset in 120 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 462 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 7 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 6 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 4 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 9 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2023-03-22 06:15:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:15:03] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2023-03-22 06:15:03] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:15:03] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/15 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41 ms. Remains : 13/15 places, 14/16 transitions.
Built C files in :
/tmp/ltsmin16075083527392955052
[2023-03-22 06:15:03] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16075083527392955052
Running compilation step : cd /tmp/ltsmin16075083527392955052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin16075083527392955052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16075083527392955052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1595546642138232071.hoa' '--buchi-type=spotba'
LTSmin run took 106 ms.
FORMULA Kanban-PT-02000-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-02000-LTLCardinality-00 finished in 13051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 14 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 9 transition count 10
Applied a total of 5 rules in 50 ms. Remains 9 /16 variables (removed 7) and now considering 10/16 (removed 6) transitions.
[2023-03-22 06:15:04] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2023-03-22 06:15:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:15:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 06:15:04] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 06:15:04] [INFO ] Invariant cache hit.
[2023-03-22 06:15:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 06:15:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:15:04] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 06:15:04] [INFO ] Invariant cache hit.
[2023-03-22 06:15:04] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/16 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 9/16 places, 10/16 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2001 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-22 06:15:04] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 06:15:04] [INFO ] Invariant cache hit.
[2023-03-22 06:15:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 06:15:04] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 06:15:04] [INFO ] Invariant cache hit.
[2023-03-22 06:15:04] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 06:15:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:15:04] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 06:15:04] [INFO ] Invariant cache hit.
[2023-03-22 06:15:05] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 9/9 places, 10/10 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4002 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Built C files in :
/tmp/ltsmin5027236635665840931
[2023-03-22 06:15:05] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2023-03-22 06:15:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 06:15:05] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2023-03-22 06:15:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 06:15:05] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2023-03-22 06:15:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 06:15:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5027236635665840931
Running compilation step : cd /tmp/ltsmin5027236635665840931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin5027236635665840931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5027236635665840931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9135804071539172322.hoa' '--buchi-type=spotba'
LTSmin run took 552 ms.
FORMULA Kanban-PT-02000-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-02000-LTLCardinality-01 finished in 2129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||(p1&&F(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
Applied a total of 1 rules in 0 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 06:15:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:15:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 06:15:06] [INFO ] Invariant cache hit.
[2023-03-22 06:15:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 06:15:06] [INFO ] Invariant cache hit.
[2023-03-22 06:15:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(GT s13 s9), p1:(GT s7 s0), p2:(GT s3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5374 reset in 78 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Kanban-PT-02000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-02000-LTLCardinality-02 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||X(F(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 3 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 06:15:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:15:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 06:15:06] [INFO ] Invariant cache hit.
[2023-03-22 06:15:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 06:15:06] [INFO ] Invariant cache hit.
[2023-03-22 06:15:06] [INFO ] Dead Transitions using invariants and state equation in 32 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 78 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s2), p1:(LEQ s9 s5), p2:(GT s7 s10)], nbAcceptance=0, 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 723 reset in 130 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Kanban-PT-02000-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-02000-LTLCardinality-03 finished in 421 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 p1)&&X(G((p2||X(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
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 06:15:07] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:15:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 06:15:07] [INFO ] Invariant cache hit.
[2023-03-22 06:15:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 06:15:07] [INFO ] Invariant cache hit.
[2023-03-22 06:15:07] [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 79 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s8), p0:(LEQ s13 s1), p2:(LEQ 2 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 220 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 p1 p0 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 314 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55301 steps, run visited all 1 properties in 75 ms. (steps per millisecond=737 )
Probabilistic random walk after 55301 steps, saw 41498 distinct states, run finished after 75 ms. (steps per millisecond=737 ) properties seen :1
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 371 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-22 06:15:08] [INFO ] Invariant cache hit.
[2023-03-22 06:15:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 06:15:08] [INFO ] Invariant cache hit.
[2023-03-22 06:15:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 06:15:08] [INFO ] Invariant cache hit.
[2023-03-22 06:15:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 14/14 places, 15/15 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55301 steps, run visited all 1 properties in 64 ms. (steps per millisecond=864 )
Probabilistic random walk after 55301 steps, saw 41498 distinct states, run finished after 64 ms. (steps per millisecond=864 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Built C files in :
/tmp/ltsmin9530607380148186042
[2023-03-22 06:15:10] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9530607380148186042
Running compilation step : cd /tmp/ltsmin9530607380148186042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 67 ms.
Running link step : cd /tmp/ltsmin9530607380148186042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9530607380148186042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1550363998599150561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-22 06:15:25] [INFO ] Invariant cache hit.
[2023-03-22 06:15:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 06:15:25] [INFO ] Invariant cache hit.
[2023-03-22 06:15:25] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-22 06:15:25] [INFO ] Invariant cache hit.
[2023-03-22 06:15:25] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 14/14 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin8729345649343193842
[2023-03-22 06:15:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8729345649343193842
Running compilation step : cd /tmp/ltsmin8729345649343193842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin8729345649343193842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8729345649343193842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12696948046043343254.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 06:15:40] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:15:40] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:15:40] [INFO ] Time to serialize gal into /tmp/LTL1548374818846017281.gal : 1 ms
[2023-03-22 06:15:40] [INFO ] Time to serialize properties into /tmp/LTL6758024685282599311.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1548374818846017281.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9434477741538887145.hoa' '-atoms' '/tmp/LTL6758024685282599311.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6758024685282599311.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9434477741538887145.hoa
Detected timeout of ITS tools.
[2023-03-22 06:15:55] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:15:55] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:15:55] [INFO ] Time to serialize gal into /tmp/LTL13928250812801243430.gal : 1 ms
[2023-03-22 06:15:55] [INFO ] Time to serialize properties into /tmp/LTL4756274673089804758.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13928250812801243430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4756274673089804758.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((F("(Pback2<=Pm3)"))U("(P1>=2)"))&&(X(G(("(P3>=2)")||(X("(P3>=2)")))))))
Formula 0 simplified : (G!"(Pback2<=Pm3)" R !"(P1>=2)") | XF(!"(P3>=2)" & X!"(P3>=2)")
Detected timeout of ITS tools.
[2023-03-22 06:16:10] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:16:10] [INFO ] Applying decomposition
[2023-03-22 06:16:10] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11140046506644224851.txt' '-o' '/tmp/graph11140046506644224851.bin' '-w' '/tmp/graph11140046506644224851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11140046506644224851.bin' '-l' '-1' '-v' '-w' '/tmp/graph11140046506644224851.weights' '-q' '0' '-e' '0.001'
[2023-03-22 06:16:10] [INFO ] Decomposing Gal with order
[2023-03-22 06:16:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 06:16:10] [INFO ] Flatten gal took : 23 ms
[2023-03-22 06:16:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-22 06:16:10] [INFO ] Time to serialize gal into /tmp/LTL174062788736180844.gal : 1 ms
[2023-03-22 06:16:10] [INFO ] Time to serialize properties into /tmp/LTL15040754033061337030.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL174062788736180844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15040754033061337030.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((F("(gu4.Pback2<=gu4.Pm3)"))U("(gi0.gi0.gu2.P1>=2)"))&&(X(G(("(gi0.gi0.gu3.P3>=2)")||(X("(gi0.gi0.gu3.P3>=2)")))))))
Formula 0 simplified : (G!"(gu4.Pback2<=gu4.Pm3)" R !"(gi0.gi0.gu2.P1>=2)") | XF(!"(gi0.gi0.gu3.P3>=2)" & X!"(gi0.gi0.gu3.P3>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9145770716743500254
[2023-03-22 06:16:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9145770716743500254
Running compilation step : cd /tmp/ltsmin9145770716743500254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin9145770716743500254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9145770716743500254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X([](((LTLAPp2==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-02000-LTLCardinality-04 finished in 93589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(G(p1))) U (G((X(G(!p2))||(p0&&F(G(p1)))))||(p3&&(X(G(!p2))||(p0&&F(G(p1))))))))'
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 0 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 06:16:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:16:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-22 06:16:40] [INFO ] Invariant cache hit.
[2023-03-22 06:16:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-22 06:16:40] [INFO ] Invariant cache hit.
[2023-03-22 06:16:40] [INFO ] Dead Transitions using invariants and state equation in 23 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 97 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND p2 (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s6), p3:(GT 2 s1), p2:(AND (LEQ 2 s6) (LEQ s7 s10)), p1:(GT 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Product exploration explored 100000 steps with 0 reset in 169 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 p3 (NOT p2) p1), (X p0), (X (NOT p2)), (X (NOT (AND p0 (NOT p3)))), (X (X p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 295 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 06:16:41] [INFO ] Invariant cache hit.
[2023-03-22 06:16:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-22 06:16:41] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 06:16:41] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:41] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 06:16:41] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14042 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=1003 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [(AND p0 p3 (NOT p2) p1), (X p0), (X (NOT p2)), (X (NOT (AND p0 (NOT p3)))), (X (X p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F p2), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 370 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Support contains 4 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-22 06:16:42] [INFO ] Invariant cache hit.
[2023-03-22 06:16:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 06:16:42] [INFO ] Invariant cache hit.
[2023-03-22 06:16:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 06:16:42] [INFO ] Invariant cache hit.
[2023-03-22 06:16:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 14/14 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) 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 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 06:16:42] [INFO ] Invariant cache hit.
[2023-03-22 06:16:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 06:16:42] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 06:16:42] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:42] [INFO ] After 9ms 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 06:16:42] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14144 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=1010 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p1))]
False Knowledge obtained : [(F p2), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p1)]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 6 edges and 14 vertex of which 4 / 14 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 7 ms. Remains 12 /14 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2023-03-22 06:16:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:16:43] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 06:16:43] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:16:43] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/14 places, 13/15 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34 ms. Remains : 12/14 places, 13/15 transitions.
Built C files in :
/tmp/ltsmin10086124160622686170
[2023-03-22 06:16:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10086124160622686170
Running compilation step : cd /tmp/ltsmin10086124160622686170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin10086124160622686170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10086124160622686170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9498085701287147844.hoa' '--buchi-type=spotba'
LTSmin run took 4697 ms.
FORMULA Kanban-PT-02000-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-02000-LTLCardinality-06 finished in 7924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p0||X(G(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 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 06:16:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:16:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 06:16:48] [INFO ] Invariant cache hit.
[2023-03-22 06:16:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 06:16:48] [INFO ] Invariant cache hit.
[2023-03-22 06:16:48] [INFO ] Dead Transitions using invariants and state equation in 24 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 127 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), true, (AND p0 (NOT p1))]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s0 s9), p1:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Product exploration explored 100000 steps with 0 reset in 148 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 (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 221 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Finished probabilistic random walk after 55301 steps, run visited all 2 properties in 283 ms. (steps per millisecond=195 )
Probabilistic random walk after 55301 steps, saw 41498 distinct states, run finished after 283 ms. (steps per millisecond=195 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-22 06:16:50] [INFO ] Invariant cache hit.
[2023-03-22 06:16:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 06:16:50] [INFO ] Invariant cache hit.
[2023-03-22 06:16:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 06:16:50] [INFO ] Invariant cache hit.
[2023-03-22 06:16:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 14/14 places, 15/15 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 55301 steps, run visited all 2 properties in 173 ms. (steps per millisecond=319 )
Probabilistic random walk after 55301 steps, saw 41498 distinct states, run finished after 174 ms. (steps per millisecond=317 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 8 / 14 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 2 ms. Remains 10 /14 variables (removed 4) and now considering 11/15 (removed 4) transitions.
[2023-03-22 06:16:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:16:51] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2023-03-22 06:16:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:16:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/14 places, 11/15 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37 ms. Remains : 10/14 places, 11/15 transitions.
Built C files in :
/tmp/ltsmin2521220215398475627
[2023-03-22 06:16:51] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2521220215398475627
Running compilation step : cd /tmp/ltsmin2521220215398475627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin2521220215398475627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2521220215398475627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3809757090049633393.hoa' '--buchi-type=spotba'
LTSmin run took 3713 ms.
FORMULA Kanban-PT-02000-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-02000-LTLCardinality-07 finished in 6655 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 13 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
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 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 9 transition count 10
Applied a total of 5 rules in 31 ms. Remains 9 /16 variables (removed 7) and now considering 10/16 (removed 6) transitions.
[2023-03-22 06:16:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2023-03-22 06:16:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:16:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-22 06:16:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 06:16:55] [INFO ] Invariant cache hit.
[2023-03-22 06:16:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 06:16:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:16:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-22 06:16:55] [INFO ] Invariant cache hit.
[2023-03-22 06:16:55] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/16 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 9/16 places, 10/16 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s6 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 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-02000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-LTLCardinality-08 finished in 152 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((X(X(X(!p0))) U (p1 U 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
Applied a total of 1 rules in 0 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 06:16:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:16:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 06:16:55] [INFO ] Invariant cache hit.
[2023-03-22 06:16:55] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 06:16:55] [INFO ] Invariant cache hit.
[2023-03-22 06:16:55] [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 78 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), false, (NOT p0), false, false, false, false, (NOT p0)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 7}, { cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s4 s2), p1:(LEQ s5 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 97 ms.
Stack based approach found an accepted trace after 29 steps with 1 reset with depth 27 and stack size 27 in 0 ms.
FORMULA Kanban-PT-02000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-02000-LTLCardinality-09 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 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 06:16:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:16:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 06:16:55] [INFO ] Invariant cache hit.
[2023-03-22 06:16:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-22 06:16:55] [INFO ] Invariant cache hit.
[2023-03-22 06:16:56] [INFO ] Dead Transitions using invariants and state equation in 42 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 97 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, p0, p0]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-02000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-LTLCardinality-10 finished in 176 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 (X((p0&&F(p1)))||G(p0)))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2023-03-22 06:16:56] [INFO ] Invariant cache hit.
[2023-03-22 06:16:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 06:16:56] [INFO ] Invariant cache hit.
[2023-03-22 06:16:56] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 06:16:56] [INFO ] Invariant cache hit.
[2023-03-22 06:16:56] [INFO ] Dead Transitions using invariants and state equation in 23 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 213 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GT 2 s13), p0:(GT 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 60 ms.
Product exploration explored 100000 steps with 33333 reset in 64 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 p1 p0), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p1)))))
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Kanban-PT-02000-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-02000-LTLCardinality-12 finished in 514 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)))&&(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 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 06:16:56] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:16:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 06:16:56] [INFO ] Invariant cache hit.
[2023-03-22 06:16:56] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 06:16:56] [INFO ] Invariant cache hit.
[2023-03-22 06:16:56] [INFO ] Dead Transitions using invariants and state equation in 24 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 77 ms. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s2 s3), p1:(GT 2 s9), p0:(LEQ 3 s8)], 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 0 reset in 104 ms.
Product exploration explored 100000 steps with 0 reset in 181 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 p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5003 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 326888 steps, run visited all 2 properties in 440 ms. (steps per millisecond=742 )
Probabilistic random walk after 326888 steps, saw 221120 distinct states, run finished after 440 ms. (steps per millisecond=742 ) properties seen :2
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (AND p2 (NOT p0)), (AND p2 (NOT p0)), (NOT p0)]
Support contains 3 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-22 06:16:58] [INFO ] Invariant cache hit.
[2023-03-22 06:16:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 06:16:58] [INFO ] Invariant cache hit.
[2023-03-22 06:16:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-22 06:16:58] [INFO ] Invariant cache hit.
[2023-03-22 06:16:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 15/15 places, 16/16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0), (X p2), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 326888 steps, run visited all 1 properties in 319 ms. (steps per millisecond=1024 )
Probabilistic random walk after 326888 steps, saw 221120 distinct states, run finished after 320 ms. (steps per millisecond=1021 ) properties seen :1
Knowledge obtained : [(AND p2 p0), (X p2), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 170 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 13 edges and 15 vertex of which 8 / 15 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 1 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2023-03-22 06:17:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 06:17:00] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 11 cols
[2023-03-22 06:17:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:17:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/15 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26 ms. Remains : 11/15 places, 12/16 transitions.
Built C files in :
/tmp/ltsmin441917450910423644
[2023-03-22 06:17:00] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin441917450910423644
Running compilation step : cd /tmp/ltsmin441917450910423644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin441917450910423644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin441917450910423644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17110095564358233636.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-22 06:17:15] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-22 06:17:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-22 06:17:15] [INFO ] Invariant cache hit.
[2023-03-22 06:17:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-22 06:17:15] [INFO ] Invariant cache hit.
[2023-03-22 06:17:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/15 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 14/15 places, 15/16 transitions.
Built C files in :
/tmp/ltsmin18251529032832869189
[2023-03-22 06:17:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18251529032832869189
Running compilation step : cd /tmp/ltsmin18251529032832869189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin18251529032832869189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18251529032832869189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7661199513646671614.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 06:17:30] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:17:30] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:17:30] [INFO ] Time to serialize gal into /tmp/LTL17491400687349268537.gal : 0 ms
[2023-03-22 06:17:30] [INFO ] Time to serialize properties into /tmp/LTL17767712667439407590.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17491400687349268537.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2826484492439469215.hoa' '-atoms' '/tmp/LTL17767712667439407590.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17767712667439407590.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2826484492439469215.hoa
Detected timeout of ITS tools.
[2023-03-22 06:17:45] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:17:45] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:17:45] [INFO ] Time to serialize gal into /tmp/LTL9786803132767923250.gal : 0 ms
[2023-03-22 06:17:45] [INFO ] Time to serialize properties into /tmp/LTL4137335662040778057.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9786803132767923250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4137335662040778057.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(P1>=3)"))))&&(("(Pout1<2)")U("(Pout3<=P4)"))))
Formula 0 simplified : XXF!"(P1>=3)" | (!"(Pout1<2)" R !"(Pout3<=P4)")
Detected timeout of ITS tools.
[2023-03-22 06:18:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:18:00] [INFO ] Applying decomposition
[2023-03-22 06:18:00] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3863949397721874714.txt' '-o' '/tmp/graph3863949397721874714.bin' '-w' '/tmp/graph3863949397721874714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3863949397721874714.bin' '-l' '-1' '-v' '-w' '/tmp/graph3863949397721874714.weights' '-q' '0' '-e' '0.001'
[2023-03-22 06:18:00] [INFO ] Decomposing Gal with order
[2023-03-22 06:18:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 06:18:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:18:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-22 06:18:00] [INFO ] Time to serialize gal into /tmp/LTL2422980203840442045.gal : 1 ms
[2023-03-22 06:18:00] [INFO ] Time to serialize properties into /tmp/LTL8007699498438282448.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2422980203840442045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8007699498438282448.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(gi2.gu4.P1>=3)"))))&&(("(gi2.gu4.Pout1<2)")U("(gu1.Pout3<=gu1.P4)"))))
Formula 0 simplified : XXF!"(gi2.gu4.P1>=3)" | (!"(gi2.gu4.Pout1<2)" R !"(gu1.Pout3<=gu1.P4)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14201657021103863859
[2023-03-22 06:18:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14201657021103863859
Running compilation step : cd /tmp/ltsmin14201657021103863859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin14201657021103863859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14201657021103863859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([]((LTLAPp0==true))))&&((LTLAPp1==true) U (LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 4034 ms.
FORMULA Kanban-PT-02000-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-02000-LTLCardinality-13 finished in 83147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p0)))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 29 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2023-03-22 06:18:19] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2023-03-22 06:18:19] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:18:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 06:18:19] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 06:18:19] [INFO ] Invariant cache hit.
[2023-03-22 06:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 06:18:19] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-22 06:18:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 06:18:19] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-22 06:18:19] [INFO ] Invariant cache hit.
[2023-03-22 06:18:19] [INFO ] Dead Transitions using invariants and state equation in 21 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 122 ms. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-14 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:(LEQ 3 s3)], 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 19 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-02000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-LTLCardinality-14 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 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 06:18:19] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:18:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 06:18:19] [INFO ] Invariant cache hit.
[2023-03-22 06:18:20] [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 06:18:20] [INFO ] Invariant cache hit.
[2023-03-22 06:18:20] [INFO ] Dead Transitions using invariants and state equation in 18 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 64 ms. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-15 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:(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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-02000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-02000-LTLCardinality-15 finished in 148 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 p1)&&X(G((p2||X(p2))))))'
Found a Lengthening insensitive property : Kanban-PT-02000-LTLCardinality-04
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Support contains 4 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 8 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 35 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2023-03-22 06:18:20] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2023-03-22 06:18:20] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:18:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 06:18:20] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:20] [INFO ] Invariant cache hit.
[2023-03-22 06:18:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 06:18:20] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:20] [INFO ] Invariant cache hit.
[2023-03-22 06:18:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 102 ms. Remains : 12/16 places, 13/16 transitions.
Running random walk in product with property : Kanban-PT-02000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s6), p0:(LEQ s11 s1), p2:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 330 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1334 )
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X p1), (X (X p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 375 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 06:18:21] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:21] [INFO ] Invariant cache hit.
[2023-03-22 06:18:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 06:18:21] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:21] [INFO ] Invariant cache hit.
[2023-03-22 06:18:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-22 06:18:21] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:21] [INFO ] Invariant cache hit.
[2023-03-22 06:18:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 12/12 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 4002 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1334 )
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Built C files in :
/tmp/ltsmin6851131101466394997
[2023-03-22 06:18:22] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6851131101466394997
Running compilation step : cd /tmp/ltsmin6851131101466394997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 67 ms.
Running link step : cd /tmp/ltsmin6851131101466394997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6851131101466394997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6131381387724017976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-22 06:18:37] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:37] [INFO ] Invariant cache hit.
[2023-03-22 06:18:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 06:18:37] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:37] [INFO ] Invariant cache hit.
[2023-03-22 06:18:38] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-22 06:18:38] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-22 06:18:38] [INFO ] Invariant cache hit.
[2023-03-22 06:18:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 12/12 places, 13/13 transitions.
Built C files in :
/tmp/ltsmin9211815894844850439
[2023-03-22 06:18:38] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9211815894844850439
Running compilation step : cd /tmp/ltsmin9211815894844850439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin9211815894844850439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9211815894844850439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4831278390737120968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 06:18:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 06:18:53] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:18:53] [INFO ] Time to serialize gal into /tmp/LTL1384036870572764419.gal : 1 ms
[2023-03-22 06:18:53] [INFO ] Time to serialize properties into /tmp/LTL7899228678814137190.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1384036870572764419.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14333408714597059120.hoa' '-atoms' '/tmp/LTL7899228678814137190.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7899228678814137190.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14333408714597059120.hoa
Detected timeout of ITS tools.
[2023-03-22 06:19:08] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:19:08] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:19:08] [INFO ] Time to serialize gal into /tmp/LTL11150622698739801694.gal : 1 ms
[2023-03-22 06:19:08] [INFO ] Time to serialize properties into /tmp/LTL474253273137640570.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11150622698739801694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL474253273137640570.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((F("(Pback2<=Pm3)"))U("(P1>=2)"))&&(X(G(("(P3>=2)")||(X("(P3>=2)")))))))
Formula 0 simplified : (G!"(Pback2<=Pm3)" R !"(P1>=2)") | XF(!"(P3>=2)" & X!"(P3>=2)")
Detected timeout of ITS tools.
[2023-03-22 06:19:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:19:23] [INFO ] Applying decomposition
[2023-03-22 06:19:23] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1797712345529466417.txt' '-o' '/tmp/graph1797712345529466417.bin' '-w' '/tmp/graph1797712345529466417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1797712345529466417.bin' '-l' '-1' '-v' '-w' '/tmp/graph1797712345529466417.weights' '-q' '0' '-e' '0.001'
[2023-03-22 06:19:23] [INFO ] Decomposing Gal with order
[2023-03-22 06:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 06:19:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-22 06:19:23] [INFO ] Time to serialize gal into /tmp/LTL10142079121744822074.gal : 0 ms
[2023-03-22 06:19:23] [INFO ] Time to serialize properties into /tmp/LTL919490938600958223.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10142079121744822074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL919490938600958223.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((F("(gu3.Pback2<=gu3.Pm3)"))U("(gi0.gu1.P1>=2)"))&&(X(G(("(gi0.gu2.P3>=2)")||(X("(gi0.gu2.P3>=2)")))))))
Formula 0 simplified : (G!"(gu3.Pback2<=gu3.Pm3)" R !"(gi0.gu1.P1>=2)") | XF(!"(gi0.gu2.P3>=2)" & X!"(gi0.gu2.P3>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin884545382439929090
[2023-03-22 06:19:38] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin884545382439929090
Running compilation step : cd /tmp/ltsmin884545382439929090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin884545382439929090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin884545382439929090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X([](((LTLAPp2==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-02000-LTLCardinality-04 finished in 93317 ms.
[2023-03-22 06:19:53] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13978287835733512728
[2023-03-22 06:19:53] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2023-03-22 06:19:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 06:19:53] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2023-03-22 06:19:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 06:19:53] [INFO ] Applying decomposition
[2023-03-22 06:19:53] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2023-03-22 06:19:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 06:19:53] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:19:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13978287835733512728
Running compilation step : cd /tmp/ltsmin13978287835733512728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph816157291652249622.txt' '-o' '/tmp/graph816157291652249622.bin' '-w' '/tmp/graph816157291652249622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph816157291652249622.bin' '-l' '-1' '-v' '-w' '/tmp/graph816157291652249622.weights' '-q' '0' '-e' '0.001'
[2023-03-22 06:19:53] [INFO ] Decomposing Gal with order
[2023-03-22 06:19:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 06:19:53] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:19:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-22 06:19:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality3173861401095442144.gal : 0 ms
[2023-03-22 06:19:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality5786644360850629568.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3173861401095442144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5786644360850629568.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((((F("(gu0.Pback2<=gu0.Pm3)"))U("(gi1.gu3.P1>=2)"))&&(X(G(("(gi1.gu4.P3>=2)")||(X("(gi1.gu4.P3>=2)")))))))
Formula 0 simplified : (G!"(gu0.Pback2<=gu0.Pm3)" R !"(gi1.gu3.P1>=2)") | XF(!"(gi1.gu4.P3>=2)" & X!"(gi1.gu4.P3>=2)")
Compilation finished in 94 ms.
Running link step : cd /tmp/ltsmin13978287835733512728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13978287835733512728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X([](((LTLAPp2==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: ((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X([](((LTLAPp2==true)||X((LTLAPp2==true))))))
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: "((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X([](((LTLAPp2==true)||X((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.070: DFS-FIFO for weak LTL, using special progress label 20
pins2lts-mc-linux64( 0/ 8), 0.070: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.070: State length is 17, there are 54 groups
pins2lts-mc-linux64( 0/ 8), 0.070: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.070: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.070: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.070: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.080: ~1 levels ~960 states ~4240 transitions
pins2lts-mc-linux64( 0/ 8), 0.106: ~1 levels ~1920 states ~9520 transitions
pins2lts-mc-linux64( 0/ 8), 0.130: ~1 levels ~3840 states ~20256 transitions
pins2lts-mc-linux64( 0/ 8), 0.162: ~1 levels ~7680 states ~43448 transitions
pins2lts-mc-linux64( 0/ 8), 0.233: ~1 levels ~15360 states ~92776 transitions
pins2lts-mc-linux64( 0/ 8), 0.357: ~1 levels ~30720 states ~197896 transitions
pins2lts-mc-linux64( 5/ 8), 0.583: ~1 levels ~61440 states ~504368 transitions
pins2lts-mc-linux64( 5/ 8), 0.916: ~1 levels ~122880 states ~1050592 transitions
pins2lts-mc-linux64( 5/ 8), 1.513: ~1 levels ~245760 states ~2182144 transitions
pins2lts-mc-linux64( 5/ 8), 2.315: ~1 levels ~491520 states ~4492264 transitions
pins2lts-mc-linux64( 5/ 8), 3.416: ~1 levels ~983040 states ~9195672 transitions
pins2lts-mc-linux64( 4/ 8), 5.179: ~1 levels ~1966080 states ~18745816 transitions
pins2lts-mc-linux64( 2/ 8), 8.718: ~1 levels ~3932160 states ~39654704 transitions
pins2lts-mc-linux64( 2/ 8), 16.247: ~1 levels ~7864320 states ~81195392 transitions
pins2lts-mc-linux64( 0/ 8), 31.031: ~1 levels ~15728640 states ~150484608 transitions
pins2lts-mc-linux64( 0/ 8), 63.142: ~1 levels ~31457280 states ~308458056 transitions
pins2lts-mc-linux64( 0/ 8), 126.006: ~1 levels ~62914560 states ~630928896 transitions
pins2lts-mc-linux64( 2/ 8), 280.205: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 280.278:
pins2lts-mc-linux64( 0/ 8), 280.278: mean standard work distribution: 3.4% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 280.278:
pins2lts-mc-linux64( 0/ 8), 280.278: Explored 115804207 states 1279230652 transitions, fanout: 11.046
pins2lts-mc-linux64( 0/ 8), 280.278: Total exploration time 280.180 sec (280.110 sec minimum, 280.146 sec on average)
pins2lts-mc-linux64( 0/ 8), 280.278: States per second: 413321, Transitions per second: 4565746
pins2lts-mc-linux64( 0/ 8), 280.278:
pins2lts-mc-linux64( 0/ 8), 280.278: Progress states detected: 134217193
pins2lts-mc-linux64( 0/ 8), 280.278: Redundant explorations: -13.7189
pins2lts-mc-linux64( 0/ 8), 280.278:
pins2lts-mc-linux64( 0/ 8), 280.278: Queue width: 8B, total height: 36056866, memory: 275.09MB
pins2lts-mc-linux64( 0/ 8), 280.278: Tree memory: 1064.7MB, 8.3 B/state, compr.: 11.9%
pins2lts-mc-linux64( 0/ 8), 280.278: Tree fill ratio (roots/leafs): 99.0%/15.0%
pins2lts-mc-linux64( 0/ 8), 280.278: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 280.278: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 280.278: Est. total memory use: 1339.8MB (~1299.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13978287835733512728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X([](((LTLAPp2==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13978287835733512728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X([](((LTLAPp2==true)||X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-22 06:41:35] [INFO ] Flatten gal took : 111 ms
[2023-03-22 06:41:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality3287389012798609410.gal : 31 ms
[2023-03-22 06:41:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality12993174337351776833.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3287389012798609410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12993174337351776833.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((((F("(Pback2<=Pm3)"))U("(P1>=2)"))&&(X(G(("(P3>=2)")||(X("(P3>=2)")))))))
Formula 0 simplified : (G!"(Pback2<=Pm3)" R !"(P1>=2)") | XF(!"(P3>=2)" & X!"(P3>=2)")
Detected timeout of ITS tools.
[2023-03-22 07:03:19] [INFO ] Flatten gal took : 73 ms
[2023-03-22 07:03:19] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 07:03:19] [INFO ] Transformed 16 places.
[2023-03-22 07:03:19] [INFO ] Transformed 16 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-22 07:03:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality16883164426476437937.gal : 5 ms
[2023-03-22 07:03:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality6411467846950384161.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16883164426476437937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6411467846950384161.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((F("(Pback2<=Pm3)"))U("(P1>=2)"))&&(X(G(("(P3>=2)")||(X("(P3>=2)")))))))
Formula 0 simplified : (G!"(Pback2<=Pm3)" R !"(P1>=2)") | XF(!"(P3>=2)" & X!"(P3>=2)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5501808 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16079236 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-02000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Kanban-PT-02000, 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 r229-tall-167856413000299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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