Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-20000-00
FORMULA_NAME Kanban-PT-20000-01
FORMULA_NAME Kanban-PT-20000-02
FORMULA_NAME Kanban-PT-20000-03
FORMULA_NAME Kanban-PT-20000-04
FORMULA_NAME Kanban-PT-20000-05
FORMULA_NAME Kanban-PT-20000-06
FORMULA_NAME Kanban-PT-20000-07
FORMULA_NAME Kanban-PT-20000-08
FORMULA_NAME Kanban-PT-20000-09
FORMULA_NAME Kanban-PT-20000-10
FORMULA_NAME Kanban-PT-20000-11
FORMULA_NAME Kanban-PT-20000-12
FORMULA_NAME Kanban-PT-20000-13
FORMULA_NAME Kanban-PT-20000-14
FORMULA_NAME Kanban-PT-20000-15

=== Now, execution of the tool begins

BK_START 1620872187076

Running Version 0
[2021-05-13 02:16:28] [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]
[2021-05-13 02:16:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 02:16:28] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 02:16:28] [INFO ] Transformed 16 places.
[2021-05-13 02:16:28] [INFO ] Transformed 16 transitions.
[2021-05-13 02:16:28] [INFO ] Parsed PT model containing 16 places and 16 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 02:16:28] [INFO ] Initial state test concluded for 1 properties.
FORMULA Kanban-PT-20000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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 8 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:28] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-13 02:16:28] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:28] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 02:16:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:29] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
[2021-05-13 02:16:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 02:16:29] [INFO ] Flatten gal took : 17 ms
FORMULA Kanban-PT-20000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 02:16:29] [INFO ] Flatten gal took : 4 ms
[2021-05-13 02:16:29] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100007 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=2631 ) properties (out of 14) seen :3
Running SMT prover for 11 properties.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:29] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-13 02:16:29] [INFO ] Added : 10 causal constraints over 2 iterations in 15 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:29] [INFO ] Added : 10 causal constraints over 3 iterations in 16 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:29] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:29] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Added : 13 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Added : 13 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-13 02:16:29] [INFO ] Added : 10 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:29] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:29] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Ensure Unique test 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 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 2777 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2021-05-13 02:16:32] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 02:16:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-13 02:16:32] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 02:16:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:32] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-13 02:16:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:32] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 02:16:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:32] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/15 places, 12/16 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s10 1), p1:(LT s0 1)], 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-20000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-00 finished in 3055 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1)&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:33] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:33] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 02:16:33] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:33] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 16/16 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : Kanban-PT-20000-01 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p2:(GEQ s5 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 389 reset in 261 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Kanban-PT-20000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-01 finished in 511 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:33] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:33] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 02:16:33] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:33] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s13 1) (OR (LT s9 1) (LT s4 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-03 finished in 131 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 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: 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 3041 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:16:36] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 02:16:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2021-05-13 02:16:36] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:36] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-13 02:16:36] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:36] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:36] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), p0]
Running random walk in product with property : Kanban-PT-20000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], 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, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-04 finished in 3166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (G(p0)||(p0&&G((p1&&X(X(G(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:36] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:36] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:36] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-20000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s4 1) (LT s13 1)), p1:(LT s0 1), p2:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-20000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-05 finished in 173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:36] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:36] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:37] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s9 1) (GEQ s2 1) (GEQ s7 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-06 finished in 114 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 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.
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
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 10 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 1 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:16:37] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:37] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-13 02:16:37] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:37] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-13 02:16:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:37] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:37] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-20000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-07 finished in 70 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 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.
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 3166 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:16:40] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:40] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-13 02:16:40] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:40] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-13 02:16:40] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:40] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:40] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 22 ms :[p0]
Running random walk in product with property : Kanban-PT-20000-08 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 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-20000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-08 finished in 3231 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p0)||X(p1)) U p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:40] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:40] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:40] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:40] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/15 places, 15/16 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3897 reset in 136 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Kanban-PT-20000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-09 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 6 / 15 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: 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 3082 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2021-05-13 02:16:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:16:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:43] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-13 02:16:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:16:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-13 02:16:43] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:16:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/15 places, 12/16 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-20000-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s1 1) (AND (GEQ s2 1) (GEQ s5 1) (GEQ s9 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-20000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-10 finished in 3160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 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.
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
Applied a total of 3 rules in 2 ms. Remains 11 /15 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2021-05-13 02:16:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:16:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:43] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-13 02:16:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:16:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:43] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-13 02:16:43] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:16:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:43] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/15 places, 12/16 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-20000-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LT s7 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-11 finished in 107 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 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.
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 3105 ms. Remains 10 /15 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:16:46] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:46] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-13 02:16:46] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-13 02:16:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:16:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:47] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/15 places, 11/16 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-12 finished in 3204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(F((p0||G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:47] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:47] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:16:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 16/16 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Kanban-PT-20000-14 automaton TGBA [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 p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s5 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1405 reset in 116 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Kanban-PT-20000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-14 finished in 306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((!p1||G((F(p3)&&p2)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 7 edges and 15 vertex of which 4 / 15 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 3129 ms. Remains 12 /15 variables (removed 3) and now considering 13/16 (removed 3) transitions.
[2021-05-13 02:16:50] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:16:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:50] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-13 02:16:50] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:16:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:16:50] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-13 02:16:50] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:50] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:16:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:50] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/15 places, 13/16 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : Kanban-PT-20000-15 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND p1 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s10 1)), p1:(LT s0 1), p2:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s10 1) (LT s8 1)), p3:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s10 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 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-15 finished in 3287 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620872211547

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-20000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-20000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407100573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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