About the Execution of ITS-Tools for Kanban-PT-20000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16246.220 | 3600000.00 | 4111437.00 | 109100.00 | FT?F?TTTTTFTFFFF | 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-162075407100572.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Kanban-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407100572
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-20000-00
FORMULA_NAME Kanban-PT-20000-01
FORMULA_NAME Kanban-PT-20000-02
FORMULA_NAME Kanban-PT-20000-03
FORMULA_NAME Kanban-PT-20000-04
FORMULA_NAME Kanban-PT-20000-05
FORMULA_NAME Kanban-PT-20000-06
FORMULA_NAME Kanban-PT-20000-07
FORMULA_NAME Kanban-PT-20000-08
FORMULA_NAME Kanban-PT-20000-09
FORMULA_NAME Kanban-PT-20000-10
FORMULA_NAME Kanban-PT-20000-11
FORMULA_NAME Kanban-PT-20000-12
FORMULA_NAME Kanban-PT-20000-13
FORMULA_NAME Kanban-PT-20000-14
FORMULA_NAME Kanban-PT-20000-15
=== Now, execution of the tool begins
BK_START 1620872181065
Running Version 0
[2021-05-13 02:16:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 02:16:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 02:16:23] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-13 02:16:23] [INFO ] Transformed 16 places.
[2021-05-13 02:16:23] [INFO ] Transformed 16 transitions.
[2021-05-13 02:16:23] [INFO ] Parsed PT model containing 16 places and 16 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 02:16:23] [INFO ] Initial state test concluded for 3 properties.
FORMULA Kanban-PT-20000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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:16:23] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-13 02:16:23] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:16:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 02:16:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:16:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 02:16:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-13 02:16:23] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 02:16:23] [INFO ] Flatten gal took : 17 ms
FORMULA Kanban-PT-20000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-20000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 02:16:23] [INFO ] Flatten gal took : 4 ms
[2021-05-13 02:16:23] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100007 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=2381 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:16:23] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:16:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 02:16:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:23] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 02:16:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:23] [INFO ] Added : 13 causal constraints over 4 iterations in 16 ms. Result :sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 5 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:23] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:16:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:23] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 02:16:23] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:23] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-13 02:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:24] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:24] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 4 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 4 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 10 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-13 02:16:24] [INFO ] Added : 13 causal constraints over 3 iterations in 8 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-13 02:16:24] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 3 causal constraints over 2 iterations in 15 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-13 02:16:24] [INFO ] Added : 4 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 3 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:16:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:16:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:16:24] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&G(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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:24] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 02:16:24] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:24] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:24] [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 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Kanban-PT-20000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s13 s0), p1:(GT 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 2 ms.
FORMULA Kanban-PT-20000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-00 finished in 311 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
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:16:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:24] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:24] [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.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:16:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:16:24] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 84 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-20000-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ 2 s1), p0:(GT s11 s6)], 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 1077 reset in 268 ms.
Product exploration explored 100000 steps with 1021 reset in 224 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1014 reset in 139 ms.
Product exploration explored 100000 steps with 1010 reset in 145 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 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 8 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 12 /14 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2021-05-13 02:16:26] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:16:26] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:16:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:16:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/14 places, 13/15 transitions.
Product exploration explored 100000 steps with 2382 reset in 203 ms.
Product exploration explored 100000 steps with 2128 reset in 213 ms.
[2021-05-13 02:16:26] [INFO ] Flatten gal took : 11 ms
[2021-05-13 02:16:26] [INFO ] Flatten gal took : 3 ms
[2021-05-13 02:16:26] [INFO ] Time to serialize gal into /tmp/LTL10418891545117834354.gal : 2 ms
[2021-05-13 02:16:26] [INFO ] Time to serialize properties into /tmp/LTL7522213576518828238.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/LTL10418891545117834354.gal, -t, CGAL, -LTL, /tmp/LTL7522213576518828238.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/LTL10418891545117834354.gal -t CGAL -LTL /tmp/LTL7522213576518828238.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(P2>Pm1)"))))||(F("(Pback3>=2)"))))
Formula 0 simplified : !(XXG"(P2>Pm1)" | F"(Pback3>=2)")
Detected timeout of ITS tools.
[2021-05-13 02:16:41] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:16:41] [INFO ] Applying decomposition
[2021-05-13 02:16:41] [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/graph12516919572999533595.txt, -o, /tmp/graph12516919572999533595.bin, -w, /tmp/graph12516919572999533595.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/graph12516919572999533595.bin, -l, -1, -v, -w, /tmp/graph12516919572999533595.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:16:41] [INFO ] Decomposing Gal with order
[2021-05-13 02:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:16:41] [INFO ] Flatten gal took : 20 ms
[2021-05-13 02:16:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:16:41] [INFO ] Time to serialize gal into /tmp/LTL18209579847324001579.gal : 1 ms
[2021-05-13 02:16:41] [INFO ] Time to serialize properties into /tmp/LTL2746317832520022641.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/LTL18209579847324001579.gal, -t, CGAL, -LTL, /tmp/LTL2746317832520022641.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/LTL18209579847324001579.gal -t CGAL -LTL /tmp/LTL2746317832520022641.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(gu4.P2>gu4.Pm1)"))))||(F("(gi0.gu0.Pback3>=2)"))))
Formula 0 simplified : !(XXG"(gu4.P2>gu4.Pm1)" | F"(gi0.gu0.Pback3>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9603719749263424769
[2021-05-13 02:16:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9603719749263424769
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/ltsmin9603719749263424769]
Compilation finished in 172 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9603719749263424769]
Link finished in 37 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(X([]((LTLAPp0==true))))||<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9603719749263424769]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-20000-02 finished in 46936 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||G(p1)))], 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.
Graph (trivial) has 8 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 3346 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2021-05-13 02:17:15] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:17:15] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:17:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-13 02:17:15] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:17:15] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:17:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:17:15] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-13 02:17:15] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:17:15] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:17:15] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:17:15] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s1 s5) (LEQ s2 s0)), p0:(LEQ s3 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 205 ms.
Product exploration explored 100000 steps with 0 reset in 194 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
[2021-05-13 02:17:16] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:17:16] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:17:16] [INFO ] Time to serialize gal into /tmp/LTL13300143866287121016.gal : 0 ms
[2021-05-13 02:17:16] [INFO ] Time to serialize properties into /tmp/LTL12925903565144659448.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/LTL13300143866287121016.gal, -t, CGAL, -LTL, /tmp/LTL12925903565144659448.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/LTL13300143866287121016.gal -t CGAL -LTL /tmp/LTL12925903565144659448.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("(Pout3<=P1)")))||(G("((Pm3<=Pback4)&&(Pback3<=P3))"))))
Formula 0 simplified : !(GF"(Pout3<=P1)" | G"((Pm3<=Pback4)&&(Pback3<=P3))")
Detected timeout of ITS tools.
[2021-05-13 02:17:31] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:17:31] [INFO ] Applying decomposition
[2021-05-13 02:17:31] [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/graph9157676748231708101.txt, -o, /tmp/graph9157676748231708101.bin, -w, /tmp/graph9157676748231708101.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/graph9157676748231708101.bin, -l, -1, -v, -w, /tmp/graph9157676748231708101.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:17:31] [INFO ] Decomposing Gal with order
[2021-05-13 02:17:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:17:31] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-13 02:17:31] [INFO ] Flatten gal took : 3 ms
[2021-05-13 02:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 02:17:31] [INFO ] Time to serialize gal into /tmp/LTL1420727028654497152.gal : 0 ms
[2021-05-13 02:17:31] [INFO ] Time to serialize properties into /tmp/LTL11123902861379988761.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/LTL1420727028654497152.gal, -t, CGAL, -LTL, /tmp/LTL11123902861379988761.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/LTL1420727028654497152.gal -t CGAL -LTL /tmp/LTL11123902861379988761.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(F("(gi1.gu1.Pout3<=gi1.gu1.P1)")))||(G("((gu2.Pm3<=gu2.Pback4)&&(gu0.Pback3<=gu0.P3))"))))
Formula 0 simplified : !(GF"(gi1.gu1.Pout3<=gi1.gu1.P1)" | G"((gu2.Pm3<=gu2.Pback4)&&(gu0.Pback3<=gu0.P3))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3848622948023267516
[2021-05-13 02:17:46] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3848622948023267516
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/ltsmin3848622948023267516]
Compilation finished in 106 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3848622948023267516]
Link finished in 32 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, ([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3848622948023267516]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-20000-04 finished in 49440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], 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 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:18:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:18:01] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:18:01] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:18:01] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:18:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:18:01] [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 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-20000-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s12 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
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 9 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 02:18:01] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:18:01] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:18:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:18:01] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
[2021-05-13 02:18:02] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:18:02] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:18:02] [INFO ] Time to serialize gal into /tmp/LTL10925547237749078846.gal : 1 ms
[2021-05-13 02:18:02] [INFO ] Time to serialize properties into /tmp/LTL2235186430228536796.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/LTL10925547237749078846.gal, -t, CGAL, -LTL, /tmp/LTL2235186430228536796.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/LTL10925547237749078846.gal -t CGAL -LTL /tmp/LTL2235186430228536796.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Pout2<=Pm1)"))))
Formula 0 simplified : !XF"(Pout2<=Pm1)"
Detected timeout of ITS tools.
[2021-05-13 02:18:17] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:18:17] [INFO ] Applying decomposition
[2021-05-13 02:18:17] [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/graph13261289082768003174.txt, -o, /tmp/graph13261289082768003174.bin, -w, /tmp/graph13261289082768003174.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/graph13261289082768003174.bin, -l, -1, -v, -w, /tmp/graph13261289082768003174.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:18:17] [INFO ] Decomposing Gal with order
[2021-05-13 02:18:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:18:17] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:18:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:18:17] [INFO ] Time to serialize gal into /tmp/LTL6935131541285747473.gal : 1 ms
[2021-05-13 02:18:17] [INFO ] Time to serialize properties into /tmp/LTL12071896740820812096.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/LTL6935131541285747473.gal, -t, CGAL, -LTL, /tmp/LTL12071896740820812096.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/LTL6935131541285747473.gal -t CGAL -LTL /tmp/LTL12071896740820812096.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu2.Pout2<=gu2.Pm1)"))))
Formula 0 simplified : !XF"(gu2.Pout2<=gu2.Pm1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4978643953643519042
[2021-05-13 02:18:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4978643953643519042
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/ltsmin4978643953643519042]
Compilation finished in 110 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4978643953643519042]
Link finished in 31 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin4978643953643519042]
LTSmin run took 403 ms.
FORMULA Kanban-PT-20000-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-20000-08 finished in 31500 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (p1 U p2)))], 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
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:18:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:18:32] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:18:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:18:32] [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.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:18:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:18:32] [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 126 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : Kanban-PT-20000-10 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(LEQ 1 s5), p1:(LEQ 1 s10), p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17904 reset in 89 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Kanban-PT-20000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-10 finished in 263 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (G(p2)&&p1))))], 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.
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:18:33] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 02:18:33] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-13 02:18:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 02:18:33] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 15 cols
[2021-05-13 02:18:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 02:18:33] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : Kanban-PT-20000-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LEQ 3 s8) (LEQ s12 s14)), p0:(OR (LEQ s5 s0) (AND (GT s12 s14) (GT 1 s9))), p2:(OR (AND (GT s12 s14) (GT 1 s9)) (LEQ s5 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Support contains 6 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 15/15 places, 15/15 transitions.
Graph (trivial) has 6 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2021-05-13 02:18:34] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:18:34] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 13 cols
[2021-05-13 02:18:34] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 02:18:34] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 13/15 transitions.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 0 reset in 151 ms.
[2021-05-13 02:18:34] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:18:34] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:18:34] [INFO ] Time to serialize gal into /tmp/LTL6632492284282479006.gal : 1 ms
[2021-05-13 02:18:34] [INFO ] Time to serialize properties into /tmp/LTL2523118554408852961.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/LTL6632492284282479006.gal, -t, CGAL, -LTL, /tmp/LTL2523118554408852961.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/LTL6632492284282479006.gal -t CGAL -LTL /tmp/LTL2523118554408852961.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((Pm4<=P3)||((P2>Pback2)&&(Pout1<1)))"))U(("((P1>=3)&&(P2<=Pback2))")&&(G("(((P2>Pback2)&&(Pout1<1))||(Pm4<=P3))"))))))
Formula 0 simplified : !X(G"((Pm4<=P3)||((P2>Pback2)&&(Pout1<1)))" U ("((P1>=3)&&(P2<=Pback2))" & G"(((P2>Pback2)&&(Pout1<1))||(Pm4<=P3))"))
Detected timeout of ITS tools.
[2021-05-13 02:18:49] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:18:49] [INFO ] Applying decomposition
[2021-05-13 02:18:49] [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/graph8639128463282016593.txt, -o, /tmp/graph8639128463282016593.bin, -w, /tmp/graph8639128463282016593.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/graph8639128463282016593.bin, -l, -1, -v, -w, /tmp/graph8639128463282016593.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:18:49] [INFO ] Decomposing Gal with order
[2021-05-13 02:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:18:49] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-13 02:18:49] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:18:49] [INFO ] Time to serialize gal into /tmp/LTL4690805285059292212.gal : 0 ms
[2021-05-13 02:18:49] [INFO ] Time to serialize properties into /tmp/LTL8611181148011602384.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/LTL4690805285059292212.gal, -t, CGAL, -LTL, /tmp/LTL8611181148011602384.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/LTL4690805285059292212.gal -t CGAL -LTL /tmp/LTL8611181148011602384.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu0.Pm4<=gu0.P3)||((gu4.P2>gu4.Pback2)&&(gi1.gu2.Pout1<1)))"))U(("((gi1.gu2.P1>=3)&&(gu4.P2<=gu4.Pback2))")&&(G("(((gu4.P2>gu4.Pback2)&&(gi1.gu2.Pout1<1))||(gu0.Pm4<=gu0.P3))"))))))
Formula 0 simplified : !X(G"((gu0.Pm4<=gu0.P3)||((gu4.P2>gu4.Pback2)&&(gi1.gu2.Pout1<1)))" U ("((gi1.gu2.P1>=3)&&(gu4.P2<=gu4.Pback2))" & G"(((gu4.P2>gu4.Pback2)&&(gi1.gu2.Pout1<1))||(gu0.Pm4<=gu0.P3))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12056384485415113830
[2021-05-13 02:19:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12056384485415113830
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/ltsmin12056384485415113830]
Compilation finished in 116 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12056384485415113830]
Link finished in 31 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)) U ([]((LTLAPp2==true))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12056384485415113830]
LTSmin run took 128 ms.
FORMULA Kanban-PT-20000-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-20000-12 finished in 32084 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F((X(G(p1))&&(p1||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
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:19:05] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:19:05] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:19:05] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:19:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-13 02:19:05] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:19:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-20000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR p1 p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s4 s0), p1:(GT s11 s7), p2:(LEQ 3 s8)], nbAcceptance=2, 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 0 reset in 147 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Kanban-PT-20000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-13 finished in 373 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||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.
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
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 3098 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:19:08] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:19:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:19:08] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-13 02:19:08] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:19:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:19:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:19:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-13 02:19:08] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:19:08] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-13 02:19:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:19:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Kanban-PT-20000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s4 s0), p1:(LEQ 2 s0)], 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 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-20000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-14 finished in 3211 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G((X(p1) U (p0&&G(!p2))))))], 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
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:19:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:19:08] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:19:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:19:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:19:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:19:08] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) p2), (NOT p1), (OR (NOT p0) p2), (OR (NOT p0) p2), (AND (NOT p0) (NOT p1)), (OR (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), p2, true, (AND p2 (NOT p1)), p2, (NOT p0), (AND p2 p1), (AND (NOT p0) p2 p1), (AND p1 p2), p2]
Running random walk in product with property : Kanban-PT-20000-15 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=0 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(OR (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 10}], [{ cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 11}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 7}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 12}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 13}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2), acceptance={} source=7 dest: 4}, { cond=(AND p0 p2), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 14}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 15}], [{ cond=true, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 12}], [{ cond=p2, acceptance={} source=10 dest: 1}, { cond=p2, acceptance={0, 1} source=10 dest: 2}, { cond=(NOT p2), acceptance={} source=10 dest: 9}, { cond=(NOT p2), acceptance={1} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 8}, { cond=p0, acceptance={} source=11 dest: 11}], [{ cond=(AND p2 p1), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=13 dest: 8}, { cond=(AND p0 p2 p1), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=13 dest: 12}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=13 dest: 13}], [{ cond=(AND p0 p2 p1), acceptance={0} source=14 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=14 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=14 dest: 14}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=14 dest: 15}], [{ cond=p2, acceptance={} source=15 dest: 3}, { cond=(NOT p2), acceptance={} source=15 dest: 15}]], initial=0, aps=[p0:(LEQ 2 s5), p2:(GT 1 s0), p1:(LEQ 1 s11)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28562 reset in 126 ms.
Stack based approach found an accepted trace after 58 steps with 16 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Kanban-PT-20000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-20000-15 finished in 619 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17118124884062456132
[2021-05-13 02:19:09] [INFO ] Applying decomposition
[2021-05-13 02:19:09] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:19:09] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2021-05-13 02:19:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 02:19:09] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2021-05-13 02:19:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 02:19:09] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2021-05-13 02:19:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 02:19:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17118124884062456132
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/ltsmin17118124884062456132]
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/graph13767714548523468802.txt, -o, /tmp/graph13767714548523468802.bin, -w, /tmp/graph13767714548523468802.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/graph13767714548523468802.bin, -l, -1, -v, -w, /tmp/graph13767714548523468802.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:19:09] [INFO ] Decomposing Gal with order
[2021-05-13 02:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:19:09] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-13 02:19:09] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 02:19:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality1356659238287126057.gal : 1 ms
[2021-05-13 02:19:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality1251345569881028869.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/LTLCardinality1356659238287126057.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1251345569881028869.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/LTLCardinality1356659238287126057.gal -t CGAL -LTL /tmp/LTLCardinality1251345569881028869.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((X(X(G("(gu2.P2>gu2.Pm1)"))))||(F("(gu0.Pback3>=2)"))))
Formula 0 simplified : !(XXG"(gu2.P2>gu2.Pm1)" | F"(gu0.Pback3>=2)")
Compilation finished in 149 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17118124884062456132]
Link finished in 34 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(X([]((LTLAPp0==true))))||<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin17118124884062456132]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: LTL layer: formula: (X(X([]((LTLAPp0==true))))||<>((LTLAPp1==true)))
pins2lts-mc-linux64( 0/ 8), 0.016: "(X(X([]((LTLAPp0==true))))||<>((LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.016: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: buchi has 4 states
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.076: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.076: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.076: State length is 17, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.076: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.076: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.076: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.076: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.298: ~1 levels ~960 states ~4552 transitions
pins2lts-mc-linux64( 0/ 8), 0.320: ~1 levels ~1920 states ~9400 transitions
pins2lts-mc-linux64( 0/ 8), 0.323: ~1 levels ~3840 states ~20624 transitions
pins2lts-mc-linux64( 0/ 8), 0.326: ~1 levels ~7680 states ~45408 transitions
pins2lts-mc-linux64( 0/ 8), 0.329: ~1 levels ~15360 states ~96352 transitions
pins2lts-mc-linux64( 0/ 8), 0.339: ~1 levels ~30720 states ~190248 transitions
pins2lts-mc-linux64( 0/ 8), 0.386: ~1 levels ~61440 states ~383824 transitions
pins2lts-mc-linux64( 1/ 8), 0.435: ~1 levels ~122880 states ~781408 transitions
pins2lts-mc-linux64( 1/ 8), 0.574: ~1 levels ~245760 states ~1616016 transitions
pins2lts-mc-linux64( 0/ 8), 0.918: ~1 levels ~491520 states ~3330224 transitions
pins2lts-mc-linux64( 0/ 8), 1.508: ~1 levels ~983040 states ~6613688 transitions
pins2lts-mc-linux64( 1/ 8), 2.701: ~1 levels ~1966080 states ~13612304 transitions
pins2lts-mc-linux64( 1/ 8), 5.107: ~1 levels ~3932160 states ~28029744 transitions
pins2lts-mc-linux64( 1/ 8), 9.923: ~1 levels ~7864320 states ~58009792 transitions
pins2lts-mc-linux64( 1/ 8), 20.364: ~1 levels ~15728640 states ~118712616 transitions
pins2lts-mc-linux64( 1/ 8), 41.851: ~1 levels ~31457280 states ~243085856 transitions
pins2lts-mc-linux64( 1/ 8), 87.473: ~1 levels ~62914560 states ~504523216 transitions
pins2lts-mc-linux64( 1/ 8), 193.099: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 193.129:
pins2lts-mc-linux64( 0/ 8), 193.129: mean standard work distribution: 3.1% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 193.129:
pins2lts-mc-linux64( 0/ 8), 193.129: Explored 116655029 states 979611452 transitions, fanout: 8.398
pins2lts-mc-linux64( 0/ 8), 193.129: Total exploration time 193.030 sec (192.970 sec minimum, 192.996 sec on average)
pins2lts-mc-linux64( 0/ 8), 193.129: States per second: 604336, Transitions per second: 5074918
pins2lts-mc-linux64( 0/ 8), 193.129:
pins2lts-mc-linux64( 0/ 8), 193.129: Progress states detected: 134217239
pins2lts-mc-linux64( 0/ 8), 193.129: Redundant explorations: -13.0850
pins2lts-mc-linux64( 0/ 8), 193.129:
pins2lts-mc-linux64( 0/ 8), 193.129: Queue width: 8B, total height: 35873306, memory: 273.69MB
pins2lts-mc-linux64( 0/ 8), 193.129: Tree memory: 1054.9MB, 8.2 B/state, compr.: 11.8%
pins2lts-mc-linux64( 0/ 8), 193.129: Tree fill ratio (roots/leafs): 99.0%/12.0%
pins2lts-mc-linux64( 0/ 8), 193.129: Stored 16 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 193.129: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 193.129: Est. total memory use: 1328.6MB (~1297.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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(X([]((LTLAPp0==true))))||<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin17118124884062456132]
255
java.lang.RuntimeException: Unexpected exception when executing 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(X([]((LTLAPp0==true))))||<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin17118124884062456132]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 02:40:06] [INFO ] Flatten gal took : 90 ms
[2021-05-13 02:40:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality15479820272386509193.gal : 26 ms
[2021-05-13 02:40:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality4263961684498703076.ltl : 9 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/LTLCardinality15479820272386509193.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4263961684498703076.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/LTLCardinality15479820272386509193.gal -t CGAL -LTL /tmp/LTLCardinality4263961684498703076.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((X(X(G("(P2>Pm1)"))))||(F("(Pback3>=2)"))))
Formula 0 simplified : !(XXG"(P2>Pm1)" | F"(Pback3>=2)")
Detected timeout of ITS tools.
[2021-05-13 03:01:03] [INFO ] Flatten gal took : 33 ms
[2021-05-13 03:01:03] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-13 03:01:03] [INFO ] Transformed 16 places.
[2021-05-13 03:01:03] [INFO ] Transformed 16 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 03:01:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality12234510399349625764.gal : 6 ms
[2021-05-13 03:01:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality2103108787309868482.ltl : 4 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/LTLCardinality12234510399349625764.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2103108787309868482.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality12234510399349625764.gal -t CGAL -LTL /tmp/LTLCardinality2103108787309868482.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(X(G("(P2>Pm1)"))))||(F("(Pback3>=2)"))))
Formula 0 simplified : !(XXG"(P2>Pm1)" | F"(Pback3>=2)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -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 LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-20000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Kanban-PT-20000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407100572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-20000.tgz
mv Kanban-PT-20000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;