fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271820700316
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Kanban-PT-10000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
983.487 14333.00 26038.00 141.00 TFFFTFFTFFFTFTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.9K Apr 29 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 17:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 17:35 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 4.0K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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-10000-LTLFireability-00
FORMULA_NAME Kanban-PT-10000-LTLFireability-01
FORMULA_NAME Kanban-PT-10000-LTLFireability-02
FORMULA_NAME Kanban-PT-10000-LTLFireability-03
FORMULA_NAME Kanban-PT-10000-LTLFireability-04
FORMULA_NAME Kanban-PT-10000-LTLFireability-05
FORMULA_NAME Kanban-PT-10000-LTLFireability-06
FORMULA_NAME Kanban-PT-10000-LTLFireability-07
FORMULA_NAME Kanban-PT-10000-LTLFireability-08
FORMULA_NAME Kanban-PT-10000-LTLFireability-09
FORMULA_NAME Kanban-PT-10000-LTLFireability-10
FORMULA_NAME Kanban-PT-10000-LTLFireability-11
FORMULA_NAME Kanban-PT-10000-LTLFireability-12
FORMULA_NAME Kanban-PT-10000-LTLFireability-13
FORMULA_NAME Kanban-PT-10000-LTLFireability-14
FORMULA_NAME Kanban-PT-10000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652773323728

Running Version 202205111006
[2022-05-17 07:42:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 07:42:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:42:05] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2022-05-17 07:42:05] [INFO ] Transformed 16 places.
[2022-05-17 07:42:05] [INFO ] Transformed 16 transitions.
[2022-05-17 07:42:05] [INFO ] Parsed PT model containing 16 places and 16 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Kanban-PT-10000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-10000-LTLFireability-12 FALSE 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 9 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 07:42:05] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-17 07:42:05] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 07:42:05] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-17 07:42:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 07:42:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 07:42:05] [INFO ] Dead Transitions using invariants and state equation in 48 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 07:42:05] [INFO ] Flatten gal took : 15 ms
[2022-05-17 07:42:05] [INFO ] Flatten gal took : 4 ms
[2022-05-17 07:42:05] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 07:42:05] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-17 07:42:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 07:42:05] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 07:42:05] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 07:42:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-17 07:42:05] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 07:42:05] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 07:42:05] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 07:42:05] [INFO ] After 72ms 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 19996 steps, including 0 resets, run visited all 2 properties in 248 ms. (steps per millisecond=80 )
Parikh walk visited 2 properties in 251 ms.
FORMULA Kanban-PT-10000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X(X(X(X(F(X(F(p0))))))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 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 07:42:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:06] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:06] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-17 07:42:06] [INFO ] Dead Transitions using invariants and state equation in 38 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 338 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 183 ms.
Product exploration explored 100000 steps with 16666 reset in 103 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Finished Best-First random walk after 93 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=93 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:08] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:08] [INFO ] Dead Transitions using invariants and state equation in 29 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished Best-First random walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 70 ms.
Product exploration explored 100000 steps with 16666 reset in 133 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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 3 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 12 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2022-05-17 07:42:09] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:42:09] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 07:42:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:09] [INFO ] Dead Transitions using invariants and state equation in 26 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 16666 reset in 174 ms.
Product exploration explored 100000 steps with 16666 reset in 121 ms.
Built C files in :
/tmp/ltsmin2571423413138077227
[2022-05-17 07:42:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2571423413138077227
Running compilation step : cd /tmp/ltsmin2571423413138077227;'/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 172 ms.
Running link step : cd /tmp/ltsmin2571423413138077227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2571423413138077227;'/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/stateBased10933883173833320273.hoa' '--buchi-type=spotba'
LTSmin run took 953 ms.
FORMULA Kanban-PT-10000-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-10000-LTLFireability-00 finished in 5047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !X(X(X(p1)))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
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 07:42:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:11] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:11] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 07:42:11] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:11] [INFO ] Dead Transitions using invariants and state equation in 25 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 488 ms :[p1, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 8}, { cond=true, acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 8}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (GEQ s4 1) (LT s9 1)), p1:(GEQ s4 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11070 reset in 209 ms.
Stack based approach found an accepted trace after 31 steps with 5 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Kanban-PT-10000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-10000-LTLFireability-01 finished in 828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 923 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2022-05-17 07:42:13] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 07:42:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-17 07:42:13] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 07:42:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:13] [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.
[2022-05-17 07:42:13] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:42:13] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 07:42:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:13] [INFO ] Dead Transitions using invariants and state equation in 40 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 45 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLFireability-02 finished in 1100 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 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 776 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2022-05-17 07:42:14] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 07:42:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-17 07:42:14] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 07:42:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:14] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-17 07:42:14] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:42:14] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 07:42:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:14] [INFO ] Dead Transitions using invariants and state equation in 29 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 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-03 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:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLFireability-03 finished in 950 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&((!(F(p1) U X(p2)) U p3)||p4))))'
Support contains 7 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:42:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 07:42:14] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:42:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:14] [INFO ] Implicit Places using invariants and state equation in 25 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 07:42:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:14] [INFO ] Dead Transitions using invariants and state equation in 26 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 460 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4))), (OR (AND p1 p2 (NOT p3) (NOT p4)) (AND (NOT p0) p1 p2)), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p0) p2)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p2), (OR (AND p1 p2 (NOT p3) (NOT p4)) (AND (NOT p0) p1 p2)), (OR (AND p1 (NOT p3) (NOT p4)) (AND (NOT p0) p1)), (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) p1 (NOT p3)))]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p0 (NOT p4) (NOT p3) p1), acceptance={0} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p4) (NOT p3) p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p4) (NOT p3) p1)), acceptance={0} source=1 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1))), acceptance={1} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p4) (NOT p3) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p4) (NOT p3) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p4) (NOT p3) p1 p2), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1) (NOT p2))), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p4) (NOT p3) p1 (NOT p2))), acceptance={0} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1) (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p4) (NOT p3) (NOT p2))), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p4) (NOT p3) p1 (NOT p2))), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p4) (NOT p3) p1 p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p4) (NOT p3) p1 p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p4) (NOT p3) p1 p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1) p2), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=5 dest: 6}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1) p2), acceptance={1} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p4) (NOT p3) p1), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p4) (NOT p3) p1), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 (NOT p4) (NOT p3) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p4) (NOT p3) (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1) (NOT p2))), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p4) (NOT p3) p1 (NOT p2))), acceptance={0, 1} source=7 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p4) (NOT p3) p1 (NOT p2))), acceptance={0, 1} source=7 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p4) (NOT p3) p1 (NOT p2))), acceptance={0} source=7 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1) (NOT p2))), acceptance={1} source=7 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p1) (NOT p2))), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s8 1) (LT s13 1)), p4:(GEQ s5 1), p3:(GEQ s7 1), p1:(GEQ s1 1), p2:(GEQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30648 reset in 176 ms.
Stack based approach found an accepted trace after 275 steps with 87 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Kanban-PT-10000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-10000-LTLFireability-05 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 2 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 07:42:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:15] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:42:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2022-05-17 07:42:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:15] [INFO ] Dead Transitions using invariants and state equation in 31 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 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s3 1) (GEQ s1 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 61 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 (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-10000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-10000-LTLFireability-07 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((p0 U (p1||(F(p1)&&!X(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 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
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 862 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2022-05-17 07:42:16] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 07:42:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-17 07:42:16] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 07:42:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 07:42:16] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-17 07:42:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:42:16] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 07:42:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:16] [INFO ] Dead Transitions using invariants and state equation in 21 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 107 ms :[(NOT p1), false, (NOT p1)]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s4 1), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLFireability-08 finished in 1079 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(p0 U F(p1))) U G((p0 U p2)))))'
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 15 cols
[2022-05-17 07:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 07:42:16] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2022-05-17 07:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 07:42:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 15 cols
[2022-05-17 07:42:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 07:42:16] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), p1, (NOT p2)]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s14 1), p0:(GEQ s7 1), p1:(AND (GEQ s0 1) (GEQ s6 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Kanban-PT-10000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Kanban-PT-10000-LTLFireability-09 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0)||p1) U G((G(p0)&&p0)))||F(p2)))'
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 7 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
Applied a total of 3 rules in 3 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2022-05-17 07:42:16] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2022-05-17 07:42:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-17 07:42:16] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2022-05-17 07:42:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 07:42:17] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-17 07:42:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 07:42:17] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2022-05-17 07:42:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/16 places, 13/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s0 1), p0:(GEQ s8 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-10000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLFireability-10 finished in 214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)||!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 07:42:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:17] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (AND p0 p1), (AND p0 p1), p1]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s6 1), p1:(GEQ s4 1)], 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 62 ms.
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Kanban-PT-10000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Kanban-PT-10000-LTLFireability-13 finished in 569 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0)))&&p1))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
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 07:42:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 07:42:17] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:17] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 07:42:17] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2022-05-17 07:42:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 07:42:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-10000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(OR (GEQ s0 1) (LT s10 1)), p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA Kanban-PT-10000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-10000-LTLFireability-14 finished in 242 ms.
All properties solved by simple procedures.
Total runtime 13129 ms.

BK_STOP 1652773338061

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-10000"
export BK_EXAMINATION="LTLFireability"
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-10000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820700316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-10000.tgz
mv Kanban-PT-10000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;