Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820700331.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Kanban-PT-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820700331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 6.2K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:34 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-50000-LTLCardinality-00
FORMULA_NAME Kanban-PT-50000-LTLCardinality-01
FORMULA_NAME Kanban-PT-50000-LTLCardinality-02
FORMULA_NAME Kanban-PT-50000-LTLCardinality-03
FORMULA_NAME Kanban-PT-50000-LTLCardinality-04
FORMULA_NAME Kanban-PT-50000-LTLCardinality-05
FORMULA_NAME Kanban-PT-50000-LTLCardinality-06
FORMULA_NAME Kanban-PT-50000-LTLCardinality-07
FORMULA_NAME Kanban-PT-50000-LTLCardinality-08
FORMULA_NAME Kanban-PT-50000-LTLCardinality-09
FORMULA_NAME Kanban-PT-50000-LTLCardinality-10
FORMULA_NAME Kanban-PT-50000-LTLCardinality-11
FORMULA_NAME Kanban-PT-50000-LTLCardinality-12
FORMULA_NAME Kanban-PT-50000-LTLCardinality-13
FORMULA_NAME Kanban-PT-50000-LTLCardinality-14
FORMULA_NAME Kanban-PT-50000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652775327699

Running Version 202205111006
[2022-05-17 08:15:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 08:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:15:29] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2022-05-17 08:15:29] [INFO ] Transformed 16 places.
[2022-05-17 08:15:29] [INFO ] Transformed 16 transitions.
[2022-05-17 08:15:29] [INFO ] Parsed PT model containing 16 places and 16 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Kanban-PT-50000-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 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 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 08:15:29] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-17 08:15:29] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 08:15:29] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-17 08:15:29] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 08:15:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 08:15:29] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
Support contains 15 out of 16 places after structural reductions.
[2022-05-17 08:15:29] [INFO ] Flatten gal took : 15 ms
[2022-05-17 08:15:29] [INFO ] Flatten gal took : 5 ms
[2022-05-17 08:15:29] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=1515 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 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 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
Running SMT prover for 10 properties.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 08:15:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 08:15:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:15:29] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 08:15:29] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-17 08:15:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:15:29] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 08:15:29] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-05-17 08:15:29] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 08:15:29] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 1 properties in 18003 ms.
Support contains 7 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 5 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 14 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 12 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 11 transition count 11
Applied a total of 8 rules in 13 ms. Remains 11 /16 variables (removed 5) and now considering 11/16 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 11/16 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=2631 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 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 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 155748 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155748 steps, saw 132094 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:15:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:15:51] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 08:15:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 08:15:51] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-17 08:15:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 08:15:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 08:15:51] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-17 08:15:51] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-17 08:15:51] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 200764 steps, including 0 resets, run visited all 1 properties in 148 ms. (steps per millisecond=1356 )
Parikh walk visited 8 properties in 7979 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))||F((F(p2)&&p3))))'
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
[2022-05-17 08:15:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:15:59] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:15:59] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 08:15:59] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:15:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:15:59] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p3 (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(LEQ 1 s11), p2:(AND (LEQ 3 s6) (LEQ 1 s11)), p3:(OR (LEQ 3 s6) (LEQ 1 s11)), p0:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 499 reset in 259 ms.
Product exploration explored 100000 steps with 514 reset in 158 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 (NOT p2) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p3 (NOT p2))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 p3 (NOT p2)))), (X (X (AND p3 (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1409 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=4545 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:16:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:16:02] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2022-05-17 08:16:02] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 08:16:02] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-17 08:16:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:16:02] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-17 08:16:02] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 08:16:02] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4000 ms.
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
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 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 5 transition count 5
Applied a total of 11 rules in 9 ms. Remains 5 /14 variables (removed 9) and now considering 5/15 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/14 places, 5/15 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=5555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 558834 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 558834 steps, saw 326360 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 08:16:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 08:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 08:16:09] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-17 08:16:09] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 08:16:09] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-17 08:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:16:09] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:16:09] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 08:16:09] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 150000 steps, including 0 resets, run visited all 2 properties in 893 ms. (steps per millisecond=167 )
Parikh walk visited 2 properties in 893 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p3 (NOT p2))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 p3 (NOT p2)))), (X (X (AND p3 (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p2))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 35 factoid took 1257 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
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.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:16:12] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:12] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 08:16:12] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:12] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-17 08:16:12] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 50002 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=3125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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
Running SMT prover for 2 properties.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:16:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-17 08:16:13] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-17 08:16:13] [INFO ] After 12ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:16:13] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:16:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:16:13] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:16:13] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 08:16:13] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 14/14 places, 15/15 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
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 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 5 transition count 5
Applied a total of 11 rules in 3 ms. Remains 5 /14 variables (removed 9) and now considering 5/15 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/14 places, 5/15 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 520686 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 520686 steps, saw 302084 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 08:16:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 08:16:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:16:18] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-17 08:16:18] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:16:18] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:16:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:16:18] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:16:18] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:16:18] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 150000 steps, including 0 resets, run visited all 2 properties in 338 ms. (steps per millisecond=443 )
Parikh walk visited 2 properties in 338 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 443 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 513 reset in 128 ms.
Product exploration explored 100000 steps with 499 reset in 148 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
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 10 edges and 14 vertex of which 6 / 14 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2022-05-17 08:16:20] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:16:20] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 08:16:20] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 08:16:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/14 places, 12/15 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 511 reset in 125 ms.
Product exploration explored 100000 steps with 517 reset in 129 ms.
Built C files in :
/tmp/ltsmin261263351167666429
[2022-05-17 08:16:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin261263351167666429
Running compilation step : cd /tmp/ltsmin261263351167666429;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin261263351167666429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin261263351167666429;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15229449390488279017.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:16:35] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:16:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:16:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:16:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 15/15 transitions.
Built C files in :
/tmp/ltsmin13174524717270261374
[2022-05-17 08:16:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13174524717270261374
Running compilation step : cd /tmp/ltsmin13174524717270261374;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin13174524717270261374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13174524717270261374;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased173744391312753691.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 08:16:50] [INFO ] Flatten gal took : 6 ms
[2022-05-17 08:16:50] [INFO ] Flatten gal took : 1 ms
[2022-05-17 08:16:50] [INFO ] Time to serialize gal into /tmp/LTL10377405503638903435.gal : 1 ms
[2022-05-17 08:16:50] [INFO ] Time to serialize properties into /tmp/LTL17451716717138017508.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10377405503638903435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17451716717138017508.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1037740...268
Read 1 LTL properties
Checking formula 0 : !(((G((X("(Pm1>=3)"))||("(P2>=1)")))||(F((F("((Pm1>=3)&&(P2>=1))"))&&("((Pm1>=3)||(P2>=1))")))))
Formula 0 simplified : !(G("(P2>=1)" | X"(Pm1>=3)") | F("((Pm1>=3)||(P2>=1))" & F"((Pm1>=3)&&(P2>=1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-17 08:16:50] [INFO ] Flatten gal took : 4 ms
[2022-05-17 08:16:50] [INFO ] Applying decomposition
[2022-05-17 08:16:50] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4340837151509580140.txt' '-o' '/tmp/graph4340837151509580140.bin' '-w' '/tmp/graph4340837151509580140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4340837151509580140.bin' '-l' '-1' '-v' '-w' '/tmp/graph4340837151509580140.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:16:50] [INFO ] Decomposing Gal with order
[2022-05-17 08:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:16:50] [INFO ] Flatten gal took : 32 ms
[2022-05-17 08:16:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 08:16:50] [INFO ] Time to serialize gal into /tmp/LTL17857550865766819428.gal : 0 ms
[2022-05-17 08:16:50] [INFO ] Time to serialize properties into /tmp/LTL6700475039401542858.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17857550865766819428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6700475039401542858.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1785755...246
Read 1 LTL properties
Checking formula 0 : !(((G((X("(i2.u3.Pm1>=3)"))||("(u0.P2>=1)")))||(F((F("((i2.u3.Pm1>=3)&&(u0.P2>=1))"))&&("((i2.u3.Pm1>=3)||(u0.P2>=1))")))))
Formula 0 simplified : !(G("(u0.P2>=1)" | X"(i2.u3.Pm1>=3)") | F("((i2.u3.Pm1>=3)||(u0.P2>=1))" & F"((i2.u3.Pm1>=3)&&(u0.P2>=1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin3702703040351684470
[2022-05-17 08:16:50] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3702703040351684470
Running compilation step : cd /tmp/ltsmin3702703040351684470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin3702703040351684470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3702703040351684470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X((LTLAPp0==true))||(LTLAPp1==true)))||<>((<>((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-50000-LTLCardinality-00 finished in 66361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((X(G(p1))||p0))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 3 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:06] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:06] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17: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 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-01 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s11 s5), p1:(GT s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-50000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-01 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G(F(p0))||p1)))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 18359 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2022-05-17 08:17:24] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-17 08:17:24] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:24] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-17 08:17:24] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:17:24] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s2 s8), p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 152 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 (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=4166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 545176 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 545176 steps, saw 345227 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 08:17:28] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:28] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:17:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:28] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:17:28] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:17:28] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 12/12 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 8 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 7 transition count 7
Applied a total of 9 rules in 8 ms. Remains 7 /11 variables (removed 4) and now considering 7/12 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/11 places, 7/12 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=10000 ) 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 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 512769 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 512769 steps, saw 325511 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-17 08:17:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 08:17:35] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:17:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:35] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:17:35] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:17:35] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 249909 steps, including 0 resets, run visited all 1 properties in 192 ms. (steps per millisecond=1301 )
Parikh walk visited 2 properties in 681 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-17 08:17:36] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-17 08:17:36] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-17 08:17:37] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:17:37] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 12/12 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=4166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 506149 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 506149 steps, saw 319974 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 08:17:40] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 08:17:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:40] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:17:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:40] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:17:40] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:17:40] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4001 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 12/12 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 8 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 7 transition count 7
Applied a total of 9 rules in 11 ms. Remains 7 /11 variables (removed 4) and now considering 7/12 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 7/11 places, 7/12 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) 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 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 530908 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 530908 steps, saw 337604 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 7 cols
[2022-05-17 08:17:47] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 08:17:47] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:17:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:47] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:17:47] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:17:47] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 249994 steps, including 0 resets, run visited all 1 properties in 234 ms. (steps per millisecond=1068 )
Parikh walk visited 2 properties in 727 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Built C files in :
/tmp/ltsmin14621372422549058210
[2022-05-17 08:17:48] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2022-05-17 08:17:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:17:48] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2022-05-17 08:17:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:17:48] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2022-05-17 08:17:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:17:48] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14621372422549058210
Running compilation step : cd /tmp/ltsmin14621372422549058210;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 74 ms.
Running link step : cd /tmp/ltsmin14621372422549058210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14621372422549058210;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4388038021156395748.hoa' '--buchi-type=spotba'
LTSmin run took 9333 ms.
FORMULA Kanban-PT-50000-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-LTLCardinality-02 finished in 51850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(F(p0))))&&X(F(p1))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:58] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:58] [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 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s0 s6), p1:(GT s5 s9)], 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 12494 reset in 65 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-03 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&p1))||X(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
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
[2022-05-17 08:17:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:58] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:17:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:17:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(LEQ 2 s3), p1:(LEQ s13 s7), p0:(OR (LEQ 1 s12) (LEQ s13 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 73 ms.
Product exploration explored 100000 steps with 33333 reset in 79 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 (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-50000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-04 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p0 U G(p1))) U G(X(G(p2))))))'
Support contains 6 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
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:59] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 08:17:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=2, aps=[p2:(AND (LEQ 3 s13) (LEQ s7 s1)), p1:(GT 1 s5), p0:(LEQ s8 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-05 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(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.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:17:59] [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 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s6 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-06 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F((G(p1)||p2)))||p3)))'
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 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 08:17:59] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 08:17:59] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:17:59] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ s11 s5), p0:(GT s14 s5), p2:(LEQ 1 s6), p1:(LEQ s0 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) p0)))
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-50000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-08 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 13 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 18353 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2022-05-17 08:18:18] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-17 08:18:18] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:18:18] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-05-17 08:18:18] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:18:18] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:19] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s4), p0:(LEQ 3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 143 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 (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 449 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=8333 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 953420 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 953420 steps, saw 526710 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-17 08:18:23] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:23] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:18:23] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 08:18:23] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 08:18:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:18:23] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 08:18:23] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-17 08:18:23] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6000 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 11/11 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 10 transition count 3
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 14 place count 4 transition count 3
Applied a total of 14 rules in 9 ms. Remains 4 /10 variables (removed 6) and now considering 3/11 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/10 places, 3/11 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=10000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 2333891 steps, run timeout after 3012 ms. (steps per millisecond=774 ) properties seen :{2=1}
Probabilistic random walk after 2333891 steps, saw 774476 distinct states, run finished after 3014 ms. (steps per millisecond=774 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 08:18:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 08:18:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 08:18:32] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:18:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 08:18:32] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:18:32] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 08:18:32] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 149996 steps, including 0 resets, run visited all 2 properties in 421 ms. (steps per millisecond=356 )
Parikh walk visited 2 properties in 421 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 8 factoid took 114 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Kanban-PT-50000-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-50000-LTLCardinality-09 finished in 32635 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((G(p0)||p1))||p2))))'
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 11 transition count 12
Applied a total of 3 rules in 18886 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2022-05-17 08:18:51] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 08:18:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:18:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-17 08:18:51] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 08:18:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 08:18:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-17 08:18:51] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:18:51] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 08:18:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:51] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/16 places, 12/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s4), p2:(GT s3 s9), p1:(LEQ s4 s6)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-LTLCardinality-13 finished in 19029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(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 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
Applied a total of 3 rules in 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2022-05-17 08:18:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-17 08:18:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 08:18:52] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-17 08:18:52] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:18:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:52] [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 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-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 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 92 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 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=10000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2601328 steps, run visited all 1 properties in 2311 ms. (steps per millisecond=1125 )
Probabilistic random walk after 2601328 steps, saw 1397326 distinct states, run finished after 2313 ms. (steps per millisecond=1124 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-17 08:18:55] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 08:18:55] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 08:18:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-17 08:18:55] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:18:55] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 08:18:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:18:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 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 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=10000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2601328 steps, run visited all 1 properties in 2153 ms. (steps per millisecond=1208 )
Probabilistic random walk after 2601328 steps, saw 1397326 distinct states, run finished after 2153 ms. (steps per millisecond=1208 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 303 ms.
Built C files in :
/tmp/ltsmin15078688237258656883
[2022-05-17 08:18:58] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-17 08:18:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:18:58] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-17 08:18:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:18:58] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-17 08:18:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:18:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15078688237258656883
Running compilation step : cd /tmp/ltsmin15078688237258656883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin15078688237258656883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15078688237258656883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12043579516812313470.hoa' '--buchi-type=spotba'
LTSmin run took 6749 ms.
FORMULA Kanban-PT-50000-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-LTLCardinality-14 finished in 13222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))||F((F(p2)&&p3))))'
Found a SL insensitive property : Kanban-PT-50000-LTLCardinality-00
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p3) (NOT p2))]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 17673 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2022-05-17 08:19:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-17 08:19:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-17 08:19:23] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Running random walk in product with property : Kanban-PT-50000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p3 (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(LEQ 1 s7), p2:(AND (LEQ 3 s4) (LEQ 1 s7)), p3:(OR (LEQ 3 s4) (LEQ 1 s7)), p0:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1079 reset in 93 ms.
Product exploration explored 100000 steps with 1091 reset in 101 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 (NOT p2) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p3 (NOT p2))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 p3 (NOT p2)))), (X (X (AND p3 (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1123 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=10000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 08:19:24] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:19:24] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 08:19:24] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2022-05-17 08:19:24] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:19:24] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:1
[2022-05-17 08:19:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 08:19:24] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-17 08:19:24] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:19:24] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2190 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 11/11 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 5 transition count 5
Applied a total of 11 rules in 3 ms. Remains 5 /10 variables (removed 5) and now considering 5/11 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 5/11 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=10000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 567716 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 567716 steps, saw 332012 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 08:19:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 08:19:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:19:30] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-17 08:19:30] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-17 08:19:30] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-17 08:19:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 08:19:30] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:19:30] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 08:19:30] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 150000 steps, including 0 resets, run visited all 2 properties in 928 ms. (steps per millisecond=161 )
Parikh walk visited 2 properties in 927 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p3 (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p3 (NOT p2))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 p3 (NOT p2)))), (X (X (AND p3 (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p2))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 35 factoid took 1301 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-17 08:19:32] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-17 08:19:32] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:19:32] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-17 08:19:32] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:32] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:32] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 311 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 50001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=4166 ) properties (out of 5) 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 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 08:19:33] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:33] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:19:33] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-17 08:19:33] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:19:33] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 08:19:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 08:19:33] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 08:19:33] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 08:19:33] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10/10 places, 11/11 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 5 transition count 5
Applied a total of 11 rules in 1 ms. Remains 5 /10 variables (removed 5) and now considering 5/11 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/10 places, 5/11 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=10000 ) 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 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Finished probabilistic random walk after 897778 steps, run visited all 2 properties in 2751 ms. (steps per millisecond=326 )
Probabilistic random walk after 897778 steps, saw 582810 distinct states, run finished after 2751 ms. (steps per millisecond=326 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1082 reset in 92 ms.
Product exploration explored 100000 steps with 1095 reset in 99 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-17 08:19:39] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:19:39] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:19:39] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Product exploration explored 100000 steps with 1087 reset in 98 ms.
Product exploration explored 100000 steps with 1094 reset in 108 ms.
Built C files in :
/tmp/ltsmin5879027349547301059
[2022-05-17 08:19:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5879027349547301059
Running compilation step : cd /tmp/ltsmin5879027349547301059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 63 ms.
Running link step : cd /tmp/ltsmin5879027349547301059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin5879027349547301059;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5981499554725172945.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2022-05-17 08:19:54] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 08:19:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-17 08:19:54] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-17 08:19:54] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 08:19:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 08:19:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin3162889751520788743
[2022-05-17 08:19:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3162889751520788743
Running compilation step : cd /tmp/ltsmin3162889751520788743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 62 ms.
Running link step : cd /tmp/ltsmin3162889751520788743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin3162889751520788743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8813277340109945986.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 08:20:09] [INFO ] Flatten gal took : 1 ms
[2022-05-17 08:20:09] [INFO ] Flatten gal took : 1 ms
[2022-05-17 08:20:09] [INFO ] Time to serialize gal into /tmp/LTL17670496359406055927.gal : 1 ms
[2022-05-17 08:20:09] [INFO ] Time to serialize properties into /tmp/LTL15324574241575313209.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17670496359406055927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15324574241575313209.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

ITS-tools command line returned an error code 134
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1767049...268
Read 1 LTL properties
Checking formula 0 : !(((G((X("(Pm1>=3)"))||("(P2>=1)")))||(F((F("((Pm1>=3)&&(P2>=1))"))&&("((Pm1>=3)||(P2>=1))")))))
Formula 0 simplified : !(G("(P2>=1)" | X"(Pm1>=3)") | F("((Pm1>=3)||(P2>=1))" & F"((Pm1>=3)&&(P2>=1))"))
terminate called after throwing an instance of 'char const*'
[2022-05-17 08:20:09] [INFO ] Flatten gal took : 3 ms
[2022-05-17 08:20:09] [INFO ] Applying decomposition
[2022-05-17 08:20:09] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1581071302588575809.txt' '-o' '/tmp/graph1581071302588575809.bin' '-w' '/tmp/graph1581071302588575809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1581071302588575809.bin' '-l' '-1' '-v' '-w' '/tmp/graph1581071302588575809.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:20:09] [INFO ] Decomposing Gal with order
[2022-05-17 08:20:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:20:09] [INFO ] Flatten gal took : 2 ms
[2022-05-17 08:20:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 08:20:09] [INFO ] Time to serialize gal into /tmp/LTL12331875273764531118.gal : 0 ms
[2022-05-17 08:20:09] [INFO ] Time to serialize properties into /tmp/LTL9528043322183163124.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12331875273764531118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9528043322183163124.ltl' '-c' '-stutter-deadlock'

ITS-tools command line returned an error code 134
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1233187...246
Read 1 LTL properties
Checking formula 0 : !(((G((X("(u2.Pm1>=3)"))||("(u3.P2>=1)")))||(F((F("((u2.Pm1>=3)&&(u3.P2>=1))"))&&("((u2.Pm1>=3)||(u3.P2>=1))")))))
Formula 0 simplified : !(G("(u3.P2>=1)" | X"(u2.Pm1>=3)") | F("((u2.Pm1>=3)||(u3.P2>=1))" & F"((u2.Pm1>=3)&&(u3.P2>=1))"))
terminate called after throwing an instance of 'char const*'
Built C files in :
/tmp/ltsmin5192649743188121467
[2022-05-17 08:20:09] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5192649743188121467
Running compilation step : cd /tmp/ltsmin5192649743188121467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 59 ms.
Running link step : cd /tmp/ltsmin5192649743188121467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin5192649743188121467;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X((LTLAPp0==true))||(LTLAPp1==true)))||<>((<>((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-50000-LTLCardinality-00 finished in 79836 ms.
[2022-05-17 08:20:25] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
[2022-05-17 08:20:25] [INFO ] Applying decomposition
[2022-05-17 08:20:25] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin16892860587793728578
[2022-05-17 08:20:25] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2022-05-17 08:20:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:20:25] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2022-05-17 08:20:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:20:25] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2022-05-17 08:20:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:20:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16892860587793728578
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1424612648376030267.txt' '-o' '/tmp/graph1424612648376030267.bin' '-w' '/tmp/graph1424612648376030267.weights'
Running compilation step : cd /tmp/ltsmin16892860587793728578;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1424612648376030267.bin' '-l' '-1' '-v' '-w' '/tmp/graph1424612648376030267.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:20:25] [INFO ] Decomposing Gal with order
[2022-05-17 08:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:20:25] [INFO ] Flatten gal took : 2 ms
[2022-05-17 08:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 08:20:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality2342580843136930290.gal : 0 ms
[2022-05-17 08:20:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality3181650078233559515.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2342580843136930290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3181650078233559515.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !(((G((X("(i2.u2.Pm1>=3)"))||("(u0.P2>=1)")))||(F((F("((i2.u2.Pm1>=3)&&(u0.P2>=1))"))&&("((i2.u2.Pm1>=3)||(u0.P2>=1))")))))
Formula 0 simplified : !(G("(u0.P2>=1)" | X"(i2.u2.Pm1>=3)") | F("((i2.u2.Pm1>=3)||(u0.P2>=1))" & F"((i2.u2.Pm1>=3)&&(u0.P2>=1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-17 08:20:25] [INFO ] Flatten gal took : 2 ms
[2022-05-17 08:20:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality7204428237858889021.gal : 1 ms
[2022-05-17 08:20:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality16734512278989748953.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7204428237858889021.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16734512278989748953.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !(((G((X("(Pm1>=3)"))||("(P2>=1)")))||(F((F("((Pm1>=3)&&(P2>=1))"))&&("((Pm1>=3)||(P2>=1))")))))
Formula 0 simplified : !(G("(P2>=1)" | X"(Pm1>=3)") | F("((Pm1>=3)||(P2>=1))" & F"((Pm1>=3)&&(P2>=1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2022-05-17 08:20:25] [INFO ] Flatten gal took : 1 ms
[2022-05-17 08:20:25] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-17 08:20:25] [INFO ] Transformed 16 places.
[2022-05-17 08:20:25] [INFO ] Transformed 16 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin16892860587793728578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-05-17 08:20:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality8300299877381058471.gal : 1 ms
[2022-05-17 08:20:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality16747452932386958678.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8300299877381058471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16747452932386958678.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G((X("(Pm1>=3)"))||("(P2>=1)")))||(F((F("((Pm1>=3)&&(P2>=1))"))&&("((Pm1>=3)||(P2>=1))")))))
Formula 0 simplified : !(G("(P2>=1)" | X"(Pm1>=3)") | F("((Pm1>=3)||(P2>=1))" & F"((Pm1>=3)&&(P2>=1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16892860587793728578;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X((LTLAPp0==true))||(LTLAPp1==true)))||<>((<>((LTLAPp2==true))&&(LTLAPp3==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( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: ([]((X((LTLAPp0==true))||(LTLAPp1==true)))||<>((<>((LTLAPp2==true))&&(LTLAPp3==true))))
pins2lts-mc-linux64( 0/ 8), 0.002: "([]((X((LTLAPp0==true))||(LTLAPp1==true)))||<>((<>((LTLAPp2==true))&&(LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: buchi has 6 states
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.071: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.071: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.071: State length is 17, there are 34 groups
pins2lts-mc-linux64( 0/ 8), 0.071: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.071: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.071: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.071: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.804: ~1 levels ~960 states ~5688 transitions
pins2lts-mc-linux64( 3/ 8), 0.984: ~1 levels ~1920 states ~11928 transitions
pins2lts-mc-linux64( 3/ 8), 1.028: ~1 levels ~3840 states ~24800 transitions
pins2lts-mc-linux64( 3/ 8), 1.089: ~1 levels ~7680 states ~51728 transitions
pins2lts-mc-linux64( 3/ 8), 1.205: ~1 levels ~15360 states ~109400 transitions
pins2lts-mc-linux64( 2/ 8), 1.470: ~1 levels ~30720 states ~242584 transitions
pins2lts-mc-linux64( 3/ 8), 1.891: ~1 levels ~61440 states ~487320 transitions
pins2lts-mc-linux64( 3/ 8), 2.665: ~1 levels ~122880 states ~1012240 transitions
pins2lts-mc-linux64( 3/ 8), 3.946: ~1 levels ~245760 states ~2103184 transitions
pins2lts-mc-linux64( 0/ 8), 5.616: ~1 levels ~491520 states ~4089264 transitions
pins2lts-mc-linux64( 0/ 8), 8.312: ~1 levels ~983040 states ~8471960 transitions
pins2lts-mc-linux64( 4/ 8), 12.695: ~1 levels ~1966080 states ~18102160 transitions
pins2lts-mc-linux64( 4/ 8), 17.199: ~1 levels ~3932160 states ~37312352 transitions
pins2lts-mc-linux64( 4/ 8), 24.042: ~1 levels ~7864320 states ~75758000 transitions
pins2lts-mc-linux64( 4/ 8), 41.098: ~1 levels ~15728640 states ~153847736 transitions
pins2lts-mc-linux64( 5/ 8), 73.191: ~1 levels ~31457280 states ~308455432 transitions
pins2lts-mc-linux64( 4/ 8), 132.183: ~1 levels ~62914560 states ~648385672 transitions
pins2lts-mc-linux64( 4/ 8), 260.556: ~1 levels ~125829120 states ~1321964320 transitions
pins2lts-mc-linux64( 5/ 8), 297.892: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 297.907:
pins2lts-mc-linux64( 0/ 8), 297.907: mean standard work distribution: 14.9% (states) 14.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 297.907:
pins2lts-mc-linux64( 0/ 8), 297.907: Explored 114582178 states 1205006760 transitions, fanout: 10.517
pins2lts-mc-linux64( 0/ 8), 297.907: Total exploration time 297.830 sec (297.780 sec minimum, 297.814 sec on average)
pins2lts-mc-linux64( 0/ 8), 297.907: States per second: 384723, Transitions per second: 4045955
pins2lts-mc-linux64( 0/ 8), 297.907:
pins2lts-mc-linux64( 0/ 8), 297.907: Progress states detected: 134216647
pins2lts-mc-linux64( 0/ 8), 297.907: Redundant explorations: -14.6292
pins2lts-mc-linux64( 0/ 8), 297.907:
pins2lts-mc-linux64( 0/ 8), 297.907: Queue width: 8B, total height: 40219374, memory: 306.85MB
pins2lts-mc-linux64( 0/ 8), 297.907: Tree memory: 1066.6MB, 8.3 B/state, compr.: 11.9%
pins2lts-mc-linux64( 0/ 8), 297.907: Tree fill ratio (roots/leafs): 99.0%/16.0%
pins2lts-mc-linux64( 0/ 8), 297.907: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 297.907: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 297.907: Est. total memory use: 1373.4MB (~1330.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16892860587793728578;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X((LTLAPp0==true))||(LTLAPp1==true)))||<>((<>((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16892860587793728578;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((X((LTLAPp0==true))||(LTLAPp1==true)))||<>((<>((LTLAPp2==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Total runtime 594538 ms.

BK_STOP 1652775923509

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-50000"
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-4028"
echo " Executing tool itstools"
echo " Input is Kanban-PT-50000, 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 r132-tall-165271820700331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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