About the Execution of ITS-Tools for Kanban-PT-50000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2385.768 | 87024.00 | 99763.00 | 753.30 | TFFFFFFFFFFFFFFF | normal |
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-162075407200581.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-50000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407200581
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K 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 89K 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.0K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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-50000-00
FORMULA_NAME Kanban-PT-50000-01
FORMULA_NAME Kanban-PT-50000-02
FORMULA_NAME Kanban-PT-50000-03
FORMULA_NAME Kanban-PT-50000-04
FORMULA_NAME Kanban-PT-50000-05
FORMULA_NAME Kanban-PT-50000-06
FORMULA_NAME Kanban-PT-50000-07
FORMULA_NAME Kanban-PT-50000-08
FORMULA_NAME Kanban-PT-50000-09
FORMULA_NAME Kanban-PT-50000-10
FORMULA_NAME Kanban-PT-50000-11
FORMULA_NAME Kanban-PT-50000-12
FORMULA_NAME Kanban-PT-50000-13
FORMULA_NAME Kanban-PT-50000-14
FORMULA_NAME Kanban-PT-50000-15
=== Now, execution of the tool begins
BK_START 1620873263199
Running Version 0
[2021-05-13 02:34:24] [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:34:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 02:34:24] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-13 02:34:24] [INFO ] Transformed 16 places.
[2021-05-13 02:34:24] [INFO ] Transformed 16 transitions.
[2021-05-13 02:34:24] [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
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:34:25] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-13 02:34:25] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:34:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 02:34:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:34:25] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 02:34:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-13 02:34:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-13 02:34:25] [INFO ] Flatten gal took : 20 ms
FORMULA Kanban-PT-50000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 02:34:25] [INFO ] Flatten gal took : 4 ms
[2021-05-13 02:34:25] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100003 steps, including 1 resets, run finished after 44 ms. (steps per millisecond=2272 ) properties (out of 13) seen :2
Running SMT prover for 11 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:34:25] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:25] [INFO ] Added : 4 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:25] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:25] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-13 02:34:25] [INFO ] Added : 4 causal constraints over 2 iterations in 15 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:25] [INFO ] Added : 10 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:25] [INFO ] Added : 10 causal constraints over 3 iterations in 18 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 8 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-13 02:34:25] [INFO ] Added : 13 causal constraints over 4 iterations in 20 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:25] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 02:34:26] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:34:26] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:34:26] [INFO ] Added : 2 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 02:34:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:34:26] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:26] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:26] [INFO ] Added : 14 causal constraints over 4 iterations in 10 ms. Result :sat
[2021-05-13 02:34:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 02:34:26] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:34:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:34:26] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:34:26] [INFO ] Added : 3 causal constraints over 2 iterations in 7 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p0&&X(F(p1)))||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 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
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
[2021-05-13 02:34:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:26] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:26] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:26] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-50000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1 1), p1:(LT s0 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 33333 reset in 193 ms.
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Product exploration explored 100000 steps with 33333 reset in 102 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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 8 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 02:34:27] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 02:34:27] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:34:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:27] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 33333 reset in 155 ms.
Product exploration explored 100000 steps with 33333 reset in 139 ms.
[2021-05-13 02:34:27] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:34:27] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:34:27] [INFO ] Time to serialize gal into /tmp/LTL9354487723191910213.gal : 1 ms
[2021-05-13 02:34:27] [INFO ] Time to serialize properties into /tmp/LTL2196131456188557739.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9354487723191910213.gal, -t, CGAL, -LTL, /tmp/LTL2196131456188557739.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9354487723191910213.gal -t CGAL -LTL /tmp/LTL2196131456188557739.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(Pm3<1)")))||(("(Pback3<1)")&&(X(F("(Pm3<1)"))))))))
Formula 0 simplified : !XF(GF"(Pm3<1)" | ("(Pback3<1)" & XF"(Pm3<1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:34:27] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:34:27] [INFO ] Applying decomposition
[2021-05-13 02:34:27] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13427326196932702523.txt, -o, /tmp/graph13427326196932702523.bin, -w, /tmp/graph13427326196932702523.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13427326196932702523.bin, -l, -1, -v, -w, /tmp/graph13427326196932702523.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:34:27] [INFO ] Decomposing Gal with order
[2021-05-13 02:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:34:27] [INFO ] Flatten gal took : 32 ms
[2021-05-13 02:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 02:34:27] [INFO ] Time to serialize gal into /tmp/LTL8207123039874213035.gal : 1 ms
[2021-05-13 02:34:27] [INFO ] Time to serialize properties into /tmp/LTL9750438359004132005.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8207123039874213035.gal, -t, CGAL, -LTL, /tmp/LTL9750438359004132005.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8207123039874213035.gal -t CGAL -LTL /tmp/LTL9750438359004132005.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("(u0.Pm3<1)")))||(("(u0.Pback3<1)")&&(X(F("(u0.Pm3<1)"))))))))
Formula 0 simplified : !XF(GF"(u0.Pm3<1)" | ("(u0.Pback3<1)" & XF"(u0.Pm3<1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin811361125717622257
[2021-05-13 02:34:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin811361125717622257
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin811361125717622257]
Compilation finished in 188 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin811361125717622257]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&X(<>((LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin811361125717622257]
LTSmin run took 158 ms.
FORMULA Kanban-PT-50000-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-00 finished in 2050 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 16 places. Attempting structural reductions.
Starting structural reductions, 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 18417 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:34:46] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:34:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-13 02:34:46] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:34:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:34:46] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2021-05-13 02:34:46] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:34:46] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:34:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:46] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-50000-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 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 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-01 finished in 18521 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U (X(p2)&&p1)))&&G((p3&&X(G(p4))))))], workingDir=/home/mcc/execution]
Support contains 6 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:46] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 02:34:46] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:46] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 02:34:46] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p4) (NOT p3) (NOT p2)), (OR (NOT p4) (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p4) (NOT p2)), (OR (NOT p3) (NOT p4)), (OR (NOT p1) (NOT p3) (NOT p2) (NOT p4)), true]
Running random walk in product with property : Kanban-PT-50000-02 automaton TGBA [mat=[[{ cond=(AND p3 (NOT p1) p0 p4), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p1 p0 p4), acceptance={0} source=0 dest: 1}, { cond=(AND p3 p1 (NOT p0) p4), acceptance={0} source=0 dest: 2}, { cond=(OR (NOT p3) (AND (NOT p1) (NOT p0)) (NOT p4)), acceptance={0} source=0 dest: 5}], [{ cond=(AND p3 (NOT p1) p0 p4 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p3 p1 p0 p4 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p1 (NOT p0) p4 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p4 p2), acceptance={0} source=1 dest: 3}, { cond=(OR (NOT p3) (AND (NOT p1) (NOT p0) (NOT p2)) (NOT p4)), acceptance={0} source=1 dest: 5}], [{ cond=(AND p3 p4 p2), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p3) (NOT p4) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p3 p4), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p3) (NOT p4)), acceptance={} source=3 dest: 5}], [{ cond=p3, acceptance={} source=4 dest: 0}, { cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p3:(LT s4 1), p1:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)), p0:(GEQ s10 1), p4:(LT s9 1), p2:(AND (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, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-02 finished in 287 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 2 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:34:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:34:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:47] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-13 02:34:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:34:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:34:47] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-13 02:34:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:34:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:34:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:47] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-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}]], initial=1, aps=[p0:(LT s3 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 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-03 finished in 85 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 19737 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:35:06] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:06] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-13 02:35:06] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:35:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-13 02:35:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:35:06] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:06] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-04 automaton TGBA [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:(LT s9 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 13 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-04 finished in 19843 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 0 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:35:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:06] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:35:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:35:06] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 02:35:06] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Kanban-PT-50000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s9 1), p1:(LT s13 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 33 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-05 finished in 153 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 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
Applied a total of 3 rules in 1 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-13 02:35:07] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:35:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:07] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-13 02:35:07] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:35:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:35:07] [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:35:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:35:07] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:35:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:07] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s4 1), p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA Kanban-PT-50000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-07 finished in 108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 19909 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:35:27] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:27] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-13 02:35:27] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:35:27] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-13 02:35:27] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:35:27] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:27] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : Kanban-PT-50000-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-50000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-08 finished in 19981 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((X(p0)&&(F(p1) U p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 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 1 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:35:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:27] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:35:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:27] [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 16 rows 15 cols
[2021-05-13 02:35:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:27] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-50000-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(GEQ s5 1), p1:(AND (GEQ s2 1) (GEQ s8 1) (GEQ s13 1)), p0:(GEQ s7 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4717 reset in 236 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA Kanban-PT-50000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-09 finished in 506 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 12 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 19989 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:35:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:47] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-13 02:35:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:35:47] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-13 02:35:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:35:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:35:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Kanban-PT-50000-10 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 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-50000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-10 finished in 20110 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 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 0 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:35:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:47] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:35:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:47] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:35:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:47] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-50000-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s9 1)), p0:(LT s10 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2333 reset in 127 ms.
Stack based approach found an accepted trace after 122 steps with 1 reset with depth 80 and stack size 70 in 0 ms.
FORMULA Kanban-PT-50000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-11 finished in 299 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((((!p0||F(p1)) U p2)&&X(X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 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 1 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:35:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:48] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:35:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:48] [INFO ] Implicit Places using invariants and state equation in 15 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:35:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:48] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Kanban-PT-50000-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR p2 (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(OR p2 (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (GEQ s3 1) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s13 1))), p2:(AND (GEQ s2 1) (GEQ s8 1) (GEQ s13 1)), p0:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-12 finished in 186 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U G(!p0))||X(G(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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 1 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 15 cols
[2021-05-13 02:35:48] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 02:35:48] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-13 02:35:48] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-13 02:35:48] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 15 cols
[2021-05-13 02:35:48] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 02:35:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, (AND p0 p1), (AND p0 p1), p1, (AND p1 p0), p0]
Running random walk in product with property : Kanban-PT-50000-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s6 1) (LT s12 1)), p1:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-13 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(((p0||F(!p1)) U (G((p0||F(!p1)))||X((!p2&&X(F(!p1))))))))))], workingDir=/home/mcc/execution]
Support contains 3 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 1 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:35:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:48] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:35:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:35:48] [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 16 rows 15 cols
[2021-05-13 02:35:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:48] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Kanban-PT-50000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s0 1), p1:(GEQ s11 1), p2:(GEQ s5 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 13228 reset in 178 ms.
Stack based approach found an accepted trace after 19 steps with 1 reset with depth 15 and stack size 14 in 0 ms.
FORMULA Kanban-PT-50000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-14 finished in 350 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((F(!p0)||(p1&&G(!p2))))||((F(!p0)||(p1&&G(!p2)))&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:35:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:48] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:35:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:48] [INFO ] Implicit Places using invariants and state equation in 12 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:35:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:35:48] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (AND p0 (NOT p1) (NOT p2)), (AND p0 p2), (AND p0 (NOT p2))]
Running random walk in product with property : Kanban-PT-50000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s12 1)), p1:(GEQ s10 1), p2:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2729 reset in 210 ms.
Stack based approach found an accepted trace after 161 steps with 4 reset with depth 32 and stack size 30 in 1 ms.
FORMULA Kanban-PT-50000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-15 finished in 414 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620873350223
--------------------
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-50000"
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-50000, 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-162075407200581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-50000.tgz
mv Kanban-PT-50000 execution
cd execution
if [ "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 '
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 ;