About the Execution of ITS-Tools for Kanban-PT-50000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6038.808 | 136823.00 | 263066.00 | 2658.90 | FFTFFFTFTTTTTFFF | 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-162075407100580.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Kanban-PT-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407100580
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-50000-00
FORMULA_NAME Kanban-PT-50000-01
FORMULA_NAME Kanban-PT-50000-02
FORMULA_NAME Kanban-PT-50000-03
FORMULA_NAME Kanban-PT-50000-04
FORMULA_NAME Kanban-PT-50000-05
FORMULA_NAME Kanban-PT-50000-06
FORMULA_NAME Kanban-PT-50000-07
FORMULA_NAME Kanban-PT-50000-08
FORMULA_NAME Kanban-PT-50000-09
FORMULA_NAME Kanban-PT-50000-10
FORMULA_NAME Kanban-PT-50000-11
FORMULA_NAME Kanban-PT-50000-12
FORMULA_NAME Kanban-PT-50000-13
FORMULA_NAME Kanban-PT-50000-14
FORMULA_NAME Kanban-PT-50000-15
=== Now, execution of the tool begins
BK_START 1620873137145
Running Version 0
[2021-05-13 02:32:20] [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:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 02:32:20] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-13 02:32:20] [INFO ] Transformed 16 places.
[2021-05-13 02:32:20] [INFO ] Transformed 16 transitions.
[2021-05-13 02:32:20] [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:32:20] [INFO ] Initial state test concluded for 4 properties.
FORMULA Kanban-PT-50000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 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 3308 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:32:23] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-13 02:32:23] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:32:23] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 02:32:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:32:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 02:32:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-13 02:32:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 02:32:24] [INFO ] Flatten gal took : 17 ms
FORMULA Kanban-PT-50000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-50000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 02:32:24] [INFO ] Flatten gal took : 4 ms
[2021-05-13 02:32:24] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100003 steps, including 1 resets, run finished after 49 ms. (steps per millisecond=2040 ) properties (out of 18) seen :1
Running SMT prover for 17 properties.
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 02:32:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-13 02:32:24] [INFO ] Added : 13 causal constraints over 4 iterations in 29 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Added : 13 causal constraints over 4 iterations in 15 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:32:24] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Added : 4 causal constraints over 2 iterations in 13 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Added : 3 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:32:24] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:32:24] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-13 02:32:24] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:24] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:25] [INFO ] Added : 13 causal constraints over 4 iterations in 10 ms. Result :sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:32:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:32:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:25] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-13 02:32:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:25] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:32:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-13 02:32:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:25] [INFO ] Added : 4 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 02:32:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-13 02:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 02:32:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 02:32:25] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-13 02:32:25] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 13 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 19995 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-13 02:32:45] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 02:32:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:32:45] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-13 02:32:45] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 02:32:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:32:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:32:45] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-13 02:32:45] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:32:45] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-13 02:32:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:32:45] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-00 finished in 20290 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(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.
Graph (trivial) has 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
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 20767 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
[2021-05-13 02:33:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:33:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:06] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-13 02:33:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:33:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:33:06] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-13 02:33:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:33:06] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:33:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:06] [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 56 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s11 s1) (LEQ 1 s11)), p0:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-01 finished in 20880 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 4 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:33:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:06] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:06] [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:33:06] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 02:33:06] [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 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 3 s0), p1:(GT 1 s11)], 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]]
Product exploration explored 100000 steps with 33333 reset in 172 ms.
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 81 ms.
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (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 10 edges and 14 vertex of which 6 / 14 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 02:33:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:33:07] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:33:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:07] [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 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
[2021-05-13 02:33:07] [INFO ] Flatten gal took : 3 ms
[2021-05-13 02:33:07] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:33:07] [INFO ] Time to serialize gal into /tmp/LTL3149476043429747708.gal : 1 ms
[2021-05-13 02:33:07] [INFO ] Time to serialize properties into /tmp/LTL3362065122045347530.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/LTL3149476043429747708.gal, -t, CGAL, -LTL, /tmp/LTL3362065122045347530.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/LTL3149476043429747708.gal -t CGAL -LTL /tmp/LTL3362065122045347530.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(P3<3)"))U(X("(Pm2<1)")))))
Formula 0 simplified : !X(G"(P3<3)" U X"(Pm2<1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:33:07] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:07] [INFO ] Applying decomposition
[2021-05-13 02:33:07] [INFO ] Flatten gal took : 2 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/graph13718920416639712626.txt, -o, /tmp/graph13718920416639712626.bin, -w, /tmp/graph13718920416639712626.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/graph13718920416639712626.bin, -l, -1, -v, -w, /tmp/graph13718920416639712626.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:33:07] [INFO ] Decomposing Gal with order
[2021-05-13 02:33:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:33:07] [INFO ] Flatten gal took : 25 ms
[2021-05-13 02:33:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 02:33:07] [INFO ] Time to serialize gal into /tmp/LTL6486437360874163355.gal : 2 ms
[2021-05-13 02:33:07] [INFO ] Time to serialize properties into /tmp/LTL4076911871679886916.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/LTL6486437360874163355.gal, -t, CGAL, -LTL, /tmp/LTL4076911871679886916.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6486437360874163355.gal -t CGAL -LTL /tmp/LTL4076911871679886916.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G("(u0.P3<3)"))U(X("(u4.Pm2<1)")))))
Formula 0 simplified : !X(G"(u0.P3<3)" U X"(u4.Pm2<1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin14165080741978201090
[2021-05-13 02:33:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14165080741978201090
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/ltsmin14165080741978201090]
Compilation finished in 182 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14165080741978201090]
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(([]((LTLAPp0==true)) U X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14165080741978201090]
LTSmin run took 192 ms.
FORMULA Kanban-PT-50000-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-02 finished in 2037 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(X(p0))&&(G(p1) U X(G(p0)))))))], 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:33:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:08] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:08] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-03 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GT s12 s4), p0:(LEQ 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-03 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 14 edges and 16 vertex of which 8 / 16 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
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 9 transition count 10
Applied a total of 5 rules in 18594 ms. Remains 9 /16 variables (removed 7) and now considering 10/16 (removed 6) transitions.
[2021-05-13 02:33:27] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2021-05-13 02:33:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:27] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-13 02:33:27] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2021-05-13 02:33:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:33:27] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-13 02:33:27] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:33:27] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 9 cols
[2021-05-13 02:33:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/16 places, 10/16 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 0 reset in 218 ms.
[2021-05-13 02:33:28] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:28] [INFO ] Flatten gal took : 0 ms
[2021-05-13 02:33:28] [INFO ] Time to serialize gal into /tmp/LTL7970576105736833890.gal : 0 ms
[2021-05-13 02:33:28] [INFO ] Time to serialize properties into /tmp/LTL18274312791182933822.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/LTL7970576105736833890.gal, -t, CGAL, -LTL, /tmp/LTL18274312791182933822.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/LTL7970576105736833890.gal -t CGAL -LTL /tmp/LTL18274312791182933822.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(P2>=1)"))))
Formula 0 simplified : !GF"(P2>=1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:33:28] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:28] [INFO ] Applying decomposition
[2021-05-13 02:33:28] [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/graph4352622139476930553.txt, -o, /tmp/graph4352622139476930553.bin, -w, /tmp/graph4352622139476930553.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/graph4352622139476930553.bin, -l, -1, -v, -w, /tmp/graph4352622139476930553.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:33:28] [INFO ] Decomposing Gal with order
[2021-05-13 02:33:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:33:28] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:33:28] [INFO ] Time to serialize gal into /tmp/LTL5922026340320600965.gal : 0 ms
[2021-05-13 02:33:28] [INFO ] Time to serialize properties into /tmp/LTL9930909615462896551.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/LTL5922026340320600965.gal, -t, CGAL, -LTL, /tmp/LTL9930909615462896551.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5922026340320600965.gal -t CGAL -LTL /tmp/LTL9930909615462896551.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(u3.P2>=1)"))))
Formula 0 simplified : !GF"(u3.P2>=1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin848913961466428659
[2021-05-13 02:33:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin848913961466428659
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/ltsmin848913961466428659]
Compilation finished in 101 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin848913961466428659]
Link finished in 36 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin848913961466428659]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-50000-04 finished in 34498 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(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:33:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:43] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:43] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:43] [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 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s13 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-50000-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-05 finished in 123 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(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.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Applied a total of 3 rules in 1 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-13 02:33:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:33:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:43] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-13 02:33:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:33:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:33:43] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-13 02:33:43] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:33:43] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:33:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:43] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-50000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
[2021-05-13 02:33:43] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:43] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:43] [INFO ] Time to serialize gal into /tmp/LTL6959288004578227769.gal : 2 ms
[2021-05-13 02:33:43] [INFO ] Time to serialize properties into /tmp/LTL7824299777930359186.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/LTL6959288004578227769.gal, -t, CGAL, -LTL, /tmp/LTL7824299777930359186.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/LTL6959288004578227769.gal -t CGAL -LTL /tmp/LTL7824299777930359186.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(Pback3<=P4)"))))
Formula 0 simplified : !FG"(Pback3<=P4)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:33:43] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:43] [INFO ] Applying decomposition
[2021-05-13 02:33:43] [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/graph17221075724562133322.txt, -o, /tmp/graph17221075724562133322.bin, -w, /tmp/graph17221075724562133322.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/graph17221075724562133322.bin, -l, -1, -v, -w, /tmp/graph17221075724562133322.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:33:43] [INFO ] Decomposing Gal with order
[2021-05-13 02:33:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:33:43] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-13 02:33:43] [INFO ] Flatten gal took : 3 ms
[2021-05-13 02:33:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 02:33:43] [INFO ] Time to serialize gal into /tmp/LTL17397803041719384358.gal : 1 ms
[2021-05-13 02:33:43] [INFO ] Time to serialize properties into /tmp/LTL16032967200174160813.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/LTL17397803041719384358.gal, -t, CGAL, -LTL, /tmp/LTL16032967200174160813.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/LTL17397803041719384358.gal -t CGAL -LTL /tmp/LTL16032967200174160813.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu1.Pback3<=gu1.P4)"))))
Formula 0 simplified : !FG"(gu1.Pback3<=gu1.P4)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin13191257954923872638
[2021-05-13 02:33:43] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13191257954923872638
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/ltsmin13191257954923872638]
Compilation finished in 113 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13191257954923872638]
Link finished in 35 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin13191257954923872638]
LTSmin run took 787 ms.
FORMULA Kanban-PT-50000-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-07 finished in 1676 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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:33:44] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:44] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:44] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:44] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:44] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:44] [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 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-50000-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GT 1 s0) (GT 2 s7))], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 57 ms.
Product exploration explored 100000 steps with 33333 reset in 61 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 53 ms.
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (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.
Applied a total of 1 rules in 1 ms. Remains 11 /14 variables (removed 3) and now considering 12/15 (removed 3) transitions.
[2021-05-13 02:33:45] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:33:45] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-13 02:33:45] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:33:45] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/14 places, 12/15 transitions.
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Product exploration explored 100000 steps with 33333 reset in 210 ms.
[2021-05-13 02:33:45] [INFO ] Flatten gal took : 2 ms
[2021-05-13 02:33:45] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:45] [INFO ] Time to serialize gal into /tmp/LTL13709610855346809532.gal : 0 ms
[2021-05-13 02:33:45] [INFO ] Time to serialize properties into /tmp/LTL15820088891388070123.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/LTL13709610855346809532.gal, -t, CGAL, -LTL, /tmp/LTL15820088891388070123.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/LTL13709610855346809532.gal -t CGAL -LTL /tmp/LTL15820088891388070123.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((Pm3<1)||(P1<2))")))))
Formula 0 simplified : !XXF"((Pm3<1)||(P1<2))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:33:45] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:45] [INFO ] Applying decomposition
[2021-05-13 02:33:45] [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/graph2690899154312210663.txt, -o, /tmp/graph2690899154312210663.bin, -w, /tmp/graph2690899154312210663.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/graph2690899154312210663.bin, -l, -1, -v, -w, /tmp/graph2690899154312210663.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:33:45] [INFO ] Decomposing Gal with order
[2021-05-13 02:33:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:33:45] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:33:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:33:45] [INFO ] Time to serialize gal into /tmp/LTL7163895311352146033.gal : 1 ms
[2021-05-13 02:33:45] [INFO ] Time to serialize properties into /tmp/LTL9069254629267406747.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/LTL7163895311352146033.gal, -t, CGAL, -LTL, /tmp/LTL9069254629267406747.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7163895311352146033.gal -t CGAL -LTL /tmp/LTL9069254629267406747.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((u0.Pm3<1)||(i2.u2.P1<2))")))))
Formula 0 simplified : !XXF"((u0.Pm3<1)||(i2.u2.P1<2))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin14953183027223398207
[2021-05-13 02:33:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14953183027223398207
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/ltsmin14953183027223398207]
Compilation finished in 114 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14953183027223398207]
Link finished in 39 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)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14953183027223398207]
LTSmin run took 209 ms.
FORMULA Kanban-PT-50000-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-50000-10 finished in 1404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X((p0||F(p1))))&&F((!p0&&X((F(p1)||G(!p0)))))))], 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:33:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:46] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:46] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:33:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:33:46] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) p0), (AND (NOT p1) (NOT p0)), p0, (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : Kanban-PT-50000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 3 s6), p1:(GT s9 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 138 ms.
Stack based approach found an accepted trace after 465 steps with 0 reset with depth 466 and stack size 432 in 1 ms.
FORMULA Kanban-PT-50000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-13 finished in 389 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||(p1 U p2)))&&F((!p2||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 7 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
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 21123 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-13 02:34:07] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 02:34:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:07] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-13 02:34:07] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 02:34:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 02:34:07] [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.
[2021-05-13 02:34:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:34:07] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-13 02:34:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:07] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p1 p2)), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND p2 p1)]
Running random walk in product with property : Kanban-PT-50000-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p2 p1), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1 s5), p2:(LEQ 2 s0), p1:(LEQ s4 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-50000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-50000-14 finished in 21280 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F((X(p1)||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 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:08] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-13 02:34:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 02:34:08] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Kanban-PT-50000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s11), p2:(LEQ 1 s0), p1:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Knowledge obtained : [p0, (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
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 7 edges and 14 vertex of which 4 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 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 1 ms. Remains 12 /14 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2021-05-13 02:34:08] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 02:34:08] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 12 cols
[2021-05-13 02:34:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 02:34:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/14 places, 13/15 transitions.
Product exploration explored 100000 steps with 0 reset in 260 ms.
Product exploration explored 100000 steps with 0 reset in 258 ms.
[2021-05-13 02:34:09] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:34:09] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:34:09] [INFO ] Time to serialize gal into /tmp/LTL14186083502067241661.gal : 1 ms
[2021-05-13 02:34:09] [INFO ] Time to serialize properties into /tmp/LTL14446790511160045706.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/LTL14186083502067241661.gal, -t, CGAL, -LTL, /tmp/LTL14446790511160045706.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/LTL14186083502067241661.gal -t CGAL -LTL /tmp/LTL14446790511160045706.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(P2>=1)")||(F((X("(Pm4>=2)"))||(G("(Pm3>=1)")))))))
Formula 0 simplified : !G("(P2>=1)" | F(X"(Pm4>=2)" | G"(Pm3>=1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:34:09] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:34:09] [INFO ] Applying decomposition
[2021-05-13 02:34:09] [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/graph17427784907145152153.txt, -o, /tmp/graph17427784907145152153.bin, -w, /tmp/graph17427784907145152153.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/graph17427784907145152153.bin, -l, -1, -v, -w, /tmp/graph17427784907145152153.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:34:09] [INFO ] Decomposing Gal with order
[2021-05-13 02:34:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:34:09] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:34:09] [INFO ] Time to serialize gal into /tmp/LTL8999685817313668229.gal : 0 ms
[2021-05-13 02:34:09] [INFO ] Time to serialize properties into /tmp/LTL7762357394854274392.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/LTL8999685817313668229.gal, -t, CGAL, -LTL, /tmp/LTL7762357394854274392.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8999685817313668229.gal -t CGAL -LTL /tmp/LTL7762357394854274392.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("(u0.P2>=1)")||(F((X("(u1.Pm4>=2)"))||(G("(u0.Pm3>=1)")))))))
Formula 0 simplified : !G("(u0.P2>=1)" | F(X"(u1.Pm4>=2)" | G"(u0.Pm3>=1)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin10628803981709607894
[2021-05-13 02:34:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10628803981709607894
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/ltsmin10628803981709607894]
Compilation finished in 114 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10628803981709607894]
Link finished in 35 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)||<>((X((LTLAPp1==true))||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10628803981709607894]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Kanban-PT-50000-15 finished in 16498 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-13 02:34:24] [INFO ] Applying decomposition
[2021-05-13 02:34:24] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin15873523465378395588
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/graph7215013467409989045.txt, -o, /tmp/graph7215013467409989045.bin, -w, /tmp/graph7215013467409989045.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/graph7215013467409989045.bin, -l, -1, -v, -w, /tmp/graph7215013467409989045.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 02:34:24] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2021-05-13 02:34:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 02:34:24] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2021-05-13 02:34:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 02:34:24] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2021-05-13 02:34:24] [INFO ] Decomposing Gal with order
[2021-05-13 02:34:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 02:34:24] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:34:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 02:34:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 02:34:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15873523465378395588
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/ltsmin15873523465378395588]
[2021-05-13 02:34:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality5664359051257139709.gal : 1 ms
[2021-05-13 02:34:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality17093603028765761273.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/LTLCardinality5664359051257139709.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17093603028765761273.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5664359051257139709.gal -t CGAL -LTL /tmp/LTLCardinality17093603028765761273.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G(F("(u4.P2>=1)"))))
Formula 0 simplified : !GF"(u4.P2>=1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:34:24] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:34:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality12034582636032113266.gal : 0 ms
[2021-05-13 02:34:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality1630056511035666405.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/LTLCardinality12034582636032113266.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1630056511035666405.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/LTLCardinality12034582636032113266.gal -t CGAL -LTL /tmp/LTLCardinality1630056511035666405.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((G(F("(P2>=1)"))))
Formula 0 simplified : !GF"(P2>=1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-13 02:34:24] [INFO ] Flatten gal took : 1 ms
[2021-05-13 02:34:24] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-13 02:34:24] [INFO ] Transformed 16 places.
[2021-05-13 02:34:24] [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 02:34:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality6489171003466159818.gal : 1 ms
[2021-05-13 02:34:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality4520729374694882454.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/LTLCardinality6489171003466159818.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4520729374694882454.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/LTLCardinality6489171003466159818.gal -t CGAL -LTL /tmp/LTLCardinality4520729374694882454.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 : !((G(F("(P2>=1)"))))
Formula 0 simplified : !GF"(P2>=1)"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 151 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15873523465378395588]
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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15873523465378395588]
LTSmin run took 2831 ms.
FORMULA Kanban-PT-50000-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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)||<>((X((LTLAPp1==true))||[]((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15873523465378395588]
LTSmin run took 5504 ms.
FORMULA Kanban-PT-50000-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
BK_STOP 1620873273968
--------------------
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-50000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Kanban-PT-50000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407100580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-50000.tgz
mv Kanban-PT-50000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;