About the Execution of ITS-Tools for Sudoku-PT-AN15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.792 | 1029349.00 | 2844594.00 | 11775.70 | ?F?TTTTFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545600316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545600316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 554K Apr 30 12:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 30 12:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5M Apr 30 11:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M Apr 30 11:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 547K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.8M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 118K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 286K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.9M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653115366933
Running Version 202205111006
[2022-05-21 06:42:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 06:42:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 06:42:48] [INFO ] Load time of PNML (sax parser for PT used): 680 ms
[2022-05-21 06:42:48] [INFO ] Transformed 4050 places.
[2022-05-21 06:42:48] [INFO ] Transformed 3375 transitions.
[2022-05-21 06:42:48] [INFO ] Parsed PT model containing 4050 places and 3375 transitions in 831 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 159 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 67 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:43:00] [INFO ] Computed 44 place invariants in 170 ms
[2022-05-21 06:43:00] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:43:00] [INFO ] Computed 44 place invariants in 102 ms
[2022-05-21 06:43:01] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1438 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:43:01] [INFO ] Computed 44 place invariants in 100 ms
[2022-05-21 06:43:02] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/4050 places, 3375/3375 transitions.
Support contains 675 out of 675 places after structural reductions.
[2022-05-21 06:43:04] [INFO ] Flatten gal took : 746 ms
[2022-05-21 06:43:10] [INFO ] Flatten gal took : 985 ms
[2022-05-21 06:43:16] [INFO ] Input system was already deterministic with 3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 2429 ms. (steps per millisecond=4 ) properties (out of 18) seen :17
Interrupted Best-First random walk after 3376 steps, including 0 resets, run timeout after 5402 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:43:24] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:43:37] [INFO ] After 1578ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G((G(p0)&&p0))&&!G(p0)))) U X(X(p0))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 6 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:43:39] [INFO ] Computed 44 place invariants in 80 ms
[2022-05-21 06:43:39] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:43:39] [INFO ] Computed 44 place invariants in 72 ms
[2022-05-21 06:43:40] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:43:40] [INFO ] Computed 44 place invariants in 75 ms
[2022-05-21 06:43:42] [INFO ] Dead Transitions using invariants and state equation in 2253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 22480 steps with 7493 reset in 10001 ms.
Product exploration timeout after 22300 steps with 7433 reset in 10005 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 199 steps, including 0 resets, run visited all 1 properties in 48 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 6 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:44:06] [INFO ] Computed 44 place invariants in 76 ms
[2022-05-21 06:44:07] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:44:07] [INFO ] Computed 44 place invariants in 73 ms
[2022-05-21 06:44:07] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:44:07] [INFO ] Computed 44 place invariants in 78 ms
[2022-05-21 06:44:09] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 198 steps, including 0 resets, run visited all 1 properties in 58 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 22350 steps with 7450 reset in 10003 ms.
Product exploration timeout after 22560 steps with 7520 reset in 10003 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 40 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2022-05-21 06:44:33] [INFO ] Redundant transitions in 201 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:44:33] [INFO ] Computed 44 place invariants in 75 ms
[2022-05-21 06:44:34] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Product exploration timeout after 22830 steps with 7610 reset in 10007 ms.
Product exploration timeout after 22860 steps with 7620 reset in 10002 ms.
Built C files in :
/tmp/ltsmin7202117803386777993
[2022-05-21 06:44:54] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7202117803386777993
Running compilation step : cd /tmp/ltsmin7202117803386777993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7202117803386777993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7202117803386777993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 6 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:44:57] [INFO ] Computed 44 place invariants in 79 ms
[2022-05-21 06:44:58] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:44:58] [INFO ] Computed 44 place invariants in 72 ms
[2022-05-21 06:44:58] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:44:59] [INFO ] Computed 44 place invariants in 67 ms
[2022-05-21 06:45:00] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin5251858153615353461
[2022-05-21 06:45:00] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5251858153615353461
Running compilation step : cd /tmp/ltsmin5251858153615353461;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5251858153615353461;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5251858153615353461;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-21 06:45:04] [INFO ] Flatten gal took : 281 ms
[2022-05-21 06:45:04] [INFO ] Flatten gal took : 264 ms
[2022-05-21 06:45:05] [INFO ] Time to serialize gal into /tmp/LTL13837423015187210124.gal : 30 ms
[2022-05-21 06:45:05] [INFO ] Time to serialize properties into /tmp/LTL5149288638239644980.ltl : 89 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13837423015187210124.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5149288638239644980.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1383742...267
Read 1 LTL properties
Checking formula 0 : !(((G(X((G((G("(((((((((((((((Rows_5_6>=1)&&(Cells_5_10>=1))&&(Columns_10_6>=1))||(((Rows_12_5>=1)&&(Cells_12_7>=1))&&(Columns_7_5>=1)...769559
Formula 0 simplified : !(GX(G("(((((((((((((((Rows_5_6>=1)&&(Cells_5_10>=1))&&(Columns_10_6>=1))||(((Rows_12_5>=1)&&(Cells_12_7>=1))&&(Columns_7_5>=1)))||(...769539
Detected timeout of ITS tools.
[2022-05-21 06:45:20] [INFO ] Flatten gal took : 348 ms
[2022-05-21 06:45:20] [INFO ] Applying decomposition
[2022-05-21 06:45:20] [INFO ] Flatten gal took : 229 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7298912471196142180.txt' '-o' '/tmp/graph7298912471196142180.bin' '-w' '/tmp/graph7298912471196142180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7298912471196142180.bin' '-l' '-1' '-v' '-w' '/tmp/graph7298912471196142180.weights' '-q' '0' '-e' '0.001'
[2022-05-21 06:45:21] [INFO ] Decomposing Gal with order
[2022-05-21 06:45:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 06:45:21] [INFO ] Removed a total of 9450 redundant transitions.
[2022-05-21 06:45:22] [INFO ] Flatten gal took : 449 ms
[2022-05-21 06:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2022-05-21 06:45:22] [INFO ] Time to serialize gal into /tmp/LTL9431195524608588373.gal : 25 ms
[2022-05-21 06:45:22] [INFO ] Time to serialize properties into /tmp/LTL7912313419207526423.ltl : 72 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9431195524608588373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7912313419207526423.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9431195...245
Read 1 LTL properties
Checking formula 0 : !(((G(X((G((G("(((((((((((((((u81.Rows_5_6>=1)&&(u310.Cells_5_10>=1))&&(u606.Columns_10_6>=1))||(((u185.Rows_12_5>=1)&&(u412.Cells_12_...965459
Formula 0 simplified : !(GX(G("(((((((((((((((u81.Rows_5_6>=1)&&(u310.Cells_5_10>=1))&&(u606.Columns_10_6>=1))||(((u185.Rows_12_5>=1)&&(u412.Cells_12_7>=1)...965439
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18299524276201395898
[2022-05-21 06:45:37] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18299524276201395898
Running compilation step : cd /tmp/ltsmin18299524276201395898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18299524276201395898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18299524276201395898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-PT-AN15-LTLFireability-00 finished in 121246 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p0))&&(X(X(p0))||G(F(X(p0))))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 8 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:45:40] [INFO ] Computed 44 place invariants in 67 ms
[2022-05-21 06:45:40] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:45:40] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:45:41] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:45:41] [INFO ] Computed 44 place invariants in 77 ms
[2022-05-21 06:45:42] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 22210 steps with 7403 reset in 10005 ms.
Product exploration timeout after 22380 steps with 7460 reset in 10001 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 6 states, 9 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 194 steps, including 0 resets, run visited all 1 properties in 57 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 7 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:46:07] [INFO ] Computed 44 place invariants in 76 ms
[2022-05-21 06:46:07] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:46:07] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:46:08] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:46:08] [INFO ] Computed 44 place invariants in 78 ms
[2022-05-21 06:46:09] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 995 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 196 steps, including 0 resets, run visited all 1 properties in 46 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 22410 steps with 7470 reset in 10001 ms.
Product exploration timeout after 22180 steps with 7393 reset in 10004 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 25 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2022-05-21 06:46:35] [INFO ] Redundant transitions in 185 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:46:35] [INFO ] Computed 44 place invariants in 71 ms
[2022-05-21 06:46:36] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Product exploration timeout after 22780 steps with 7593 reset in 10001 ms.
Product exploration timeout after 22410 steps with 7470 reset in 10008 ms.
Built C files in :
/tmp/ltsmin10578286874709049245
[2022-05-21 06:46:56] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10578286874709049245
Running compilation step : cd /tmp/ltsmin10578286874709049245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10578286874709049245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10578286874709049245;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 6 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:46:59] [INFO ] Computed 44 place invariants in 90 ms
[2022-05-21 06:47:00] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:47:00] [INFO ] Computed 44 place invariants in 75 ms
[2022-05-21 06:47:01] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:47:01] [INFO ] Computed 44 place invariants in 68 ms
[2022-05-21 06:47:02] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin9800711866649428976
[2022-05-21 06:47:02] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9800711866649428976
Running compilation step : cd /tmp/ltsmin9800711866649428976;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9800711866649428976;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9800711866649428976;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-21 06:47:07] [INFO ] Flatten gal took : 239 ms
[2022-05-21 06:47:07] [INFO ] Flatten gal took : 236 ms
[2022-05-21 06:47:07] [INFO ] Time to serialize gal into /tmp/LTL5452579867267078474.gal : 12 ms
[2022-05-21 06:47:07] [INFO ] Time to serialize properties into /tmp/LTL4569618453872818638.ltl : 41 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5452579867267078474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4569618453872818638.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5452579...266
Read 1 LTL properties
Checking formula 0 : !((((G("(((((((((((((((Rows_5_6>=1)&&(Cells_5_10>=1))&&(Columns_10_6>=1))||(((Rows_12_5>=1)&&(Cells_12_7>=1))&&(Columns_7_5>=1)))||(((...769556
Formula 0 simplified : !((G"(((((((((((((((Rows_5_6>=1)&&(Cells_5_10>=1))&&(Columns_10_6>=1))||(((Rows_12_5>=1)&&(Cells_12_7>=1))&&(Columns_7_5>=1)))||((((...769538
Detected timeout of ITS tools.
[2022-05-21 06:47:22] [INFO ] Flatten gal took : 235 ms
[2022-05-21 06:47:22] [INFO ] Applying decomposition
[2022-05-21 06:47:23] [INFO ] Flatten gal took : 238 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11536470787467053976.txt' '-o' '/tmp/graph11536470787467053976.bin' '-w' '/tmp/graph11536470787467053976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11536470787467053976.bin' '-l' '-1' '-v' '-w' '/tmp/graph11536470787467053976.weights' '-q' '0' '-e' '0.001'
[2022-05-21 06:47:23] [INFO ] Decomposing Gal with order
[2022-05-21 06:47:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 06:47:23] [INFO ] Removed a total of 9450 redundant transitions.
[2022-05-21 06:47:24] [INFO ] Flatten gal took : 396 ms
[2022-05-21 06:47:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2022-05-21 06:47:24] [INFO ] Time to serialize gal into /tmp/LTL13408179991740230198.gal : 12 ms
[2022-05-21 06:47:24] [INFO ] Time to serialize properties into /tmp/LTL2911440030179279322.ltl : 40 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13408179991740230198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2911440030179279322.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1340817...246
Read 1 LTL properties
Checking formula 0 : !((((G("(((((((((((((((u81.Rows_5_6>=1)&&(u310.Cells_5_10>=1))&&(u606.Columns_10_6>=1))||(((u185.Rows_12_5>=1)&&(u412.Cells_12_7>=1))&...965456
Formula 0 simplified : !((G"(((((((((((((((u81.Rows_5_6>=1)&&(u310.Cells_5_10>=1))&&(u606.Columns_10_6>=1))||(((u185.Rows_12_5>=1)&&(u412.Cells_12_7>=1))&&...965438
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11159540335286597646
[2022-05-21 06:47:39] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11159540335286597646
Running compilation step : cd /tmp/ltsmin11159540335286597646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11159540335286597646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11159540335286597646;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-PT-AN15-LTLFireability-02 finished in 122004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||((p0 U p0)&&p1))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 4 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:47:42] [INFO ] Computed 44 place invariants in 69 ms
[2022-05-21 06:47:42] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:47:42] [INFO ] Computed 44 place invariants in 72 ms
[2022-05-21 06:47:43] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:47:43] [INFO ] Computed 44 place invariants in 71 ms
[2022-05-21 06:47:44] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 29200 steps with 14600 reset in 10001 ms.
Product exploration timeout after 29150 steps with 14575 reset in 10003 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLFireability-03 finished in 28599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((X(p1)||p0)&&p1))||G(p1))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 7 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:48:11] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:48:11] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:48:11] [INFO ] Computed 44 place invariants in 72 ms
[2022-05-21 06:48:12] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:48:12] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:48:13] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 29480 steps with 14740 reset in 10001 ms.
Product exploration timeout after 29480 steps with 14740 reset in 10003 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLFireability-04 finished in 28164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(F(G(!p0))||X(!p0)))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 5 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:48:39] [INFO ] Computed 44 place invariants in 73 ms
[2022-05-21 06:48:39] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:48:39] [INFO ] Computed 44 place invariants in 73 ms
[2022-05-21 06:48:40] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:48:40] [INFO ] Computed 44 place invariants in 71 ms
[2022-05-21 06:48:41] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 584 ms :[true, true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s81 1) (LT s310 1) (LT s606 1)) (OR (LT s185 1) (LT s412 1) (LT s560 1)) (OR (LT s161 1) (LT s376 1) (LT s476 1)) (OR (LT s146 1) (LT s365...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 44310 steps with 223 reset in 10004 ms.
Product exploration timeout after 44290 steps with 223 reset in 10001 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN15-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLFireability-05 finished in 26009 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((p0 U p0) U p0)))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 23 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:05] [INFO ] Computed 44 place invariants in 77 ms
[2022-05-21 06:49:05] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:05] [INFO ] Computed 44 place invariants in 70 ms
[2022-05-21 06:49:06] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2022-05-21 06:49:06] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:06] [INFO ] Computed 44 place invariants in 72 ms
[2022-05-21 06:49:07] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 194 steps with 0 reset in 48 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-07 finished in 2557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(G(X(X(G(X(p0))))))&&p1))))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 161 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:08] [INFO ] Computed 44 place invariants in 77 ms
[2022-05-21 06:49:08] [INFO ] Implicit Places using invariants in 799 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:08] [INFO ] Computed 44 place invariants in 67 ms
[2022-05-21 06:49:13] [INFO ] Implicit Places using invariants and state equation in 4275 ms returned []
Implicit Place search using SMT with State Equation took 5075 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:13] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:49:14] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 7}, { cond=p1, acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}, { cond=(AND p1 p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(OR (LT s97 1) (LT s319 1) (LT s517 1)), p0:(AND (GEQ s204 1) (GEQ s427 1) (GEQ s564 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 47 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-08 finished in 6767 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(F(p0)))&&F(X(G(p1))))))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 190 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:14] [INFO ] Computed 44 place invariants in 75 ms
[2022-05-21 06:49:15] [INFO ] Implicit Places using invariants in 754 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:15] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:49:19] [INFO ] Implicit Places using invariants and state equation in 4369 ms returned []
Implicit Place search using SMT with State Equation took 5127 ms to find 0 implicit places.
[2022-05-21 06:49:20] [INFO ] Redundant transitions in 103 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:20] [INFO ] Computed 44 place invariants in 67 ms
[2022-05-21 06:49:21] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s75 1) (GEQ s314 1) (GEQ s660 1)), p1:(OR (LT s198 1) (LT s424 1) (LT s513 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13122 steps with 65 reset in 2832 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-11 finished in 9541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&F(p1))))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 105 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:24] [INFO ] Computed 44 place invariants in 77 ms
[2022-05-21 06:49:25] [INFO ] Implicit Places using invariants in 791 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:25] [INFO ] Computed 44 place invariants in 70 ms
[2022-05-21 06:49:29] [INFO ] Implicit Places using invariants and state equation in 4530 ms returned []
Implicit Place search using SMT with State Equation took 5323 ms to find 0 implicit places.
[2022-05-21 06:49:29] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:29] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:49:30] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s101 1) (LT s327 1) (LT s641 1)), p0:(AND (GEQ s83 1) (GEQ s307 1) (GEQ s563 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 351 steps with 1 reset in 90 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-12 finished in 6925 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F(p0))||(F(F(p1))&&G(p2)))))'
Support contains 9 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 151 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:31] [INFO ] Computed 44 place invariants in 67 ms
[2022-05-21 06:49:32] [INFO ] Implicit Places using invariants in 771 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:32] [INFO ] Computed 44 place invariants in 76 ms
[2022-05-21 06:49:35] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 4690 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:36] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:49:37] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s68 1) (GEQ s295 1) (GEQ s608 1)), p2:(AND (GEQ s127 1) (GEQ s353 1) (GEQ s577 1)), p1:(OR (LT s219 1) (LT s442 1) (LT s564 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 481 steps with 143 reset in 146 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-13 finished in 6310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U X((F(p2)&&p1)))))'
Support contains 9 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 95 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:37] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:49:38] [INFO ] Implicit Places using invariants in 811 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:38] [INFO ] Computed 44 place invariants in 74 ms
[2022-05-21 06:49:43] [INFO ] Implicit Places using invariants and state equation in 4854 ms returned []
Implicit Place search using SMT with State Equation took 5667 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:43] [INFO ] Computed 44 place invariants in 75 ms
[2022-05-21 06:49:44] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s237 1) (GEQ s630 1)), p0:(AND (GEQ s108 1) (GEQ s334 1) (GEQ s513 1)), p2:(AND (GEQ s92 1) (GEQ s316 1) (GEQ s467 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 30 steps with 7 reset in 21 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-14 finished in 7150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G(p0))&&X(G(p1)))))))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 89 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:44] [INFO ] Computed 44 place invariants in 78 ms
[2022-05-21 06:49:45] [INFO ] Implicit Places using invariants in 834 ms returned []
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:45] [INFO ] Computed 44 place invariants in 103 ms
[2022-05-21 06:49:49] [INFO ] Implicit Places using invariants and state equation in 3666 ms returned []
Implicit Place search using SMT with State Equation took 4500 ms to find 0 implicit places.
// Phase 1: matrix 3375 rows 675 cols
[2022-05-21 06:49:49] [INFO ] Computed 44 place invariants in 69 ms
[2022-05-21 06:49:50] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s175 1) (GEQ s391 1) (GEQ s475 1)), p1:(AND (GEQ s46 1) (GEQ s282 1) (GEQ s631 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 23 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-15 finished in 6096 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G((G(p0)&&p0))&&!G(p0)))) U X(X(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p0))&&(X(X(p0))||G(F(X(p0))))))'
[2022-05-21 06:49:51] [INFO ] Flatten gal took : 401 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin465814514125058504
[2022-05-21 06:49:51] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2022-05-21 06:49:52] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin465814514125058504
Running compilation step : cd /tmp/ltsmin465814514125058504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 06:49:52] [INFO ] Applying decomposition
[2022-05-21 06:49:52] [INFO ] Flatten gal took : 396 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10107289240420107030.txt' '-o' '/tmp/graph10107289240420107030.bin' '-w' '/tmp/graph10107289240420107030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10107289240420107030.bin' '-l' '-1' '-v' '-w' '/tmp/graph10107289240420107030.weights' '-q' '0' '-e' '0.001'
[2022-05-21 06:49:53] [INFO ] Decomposing Gal with order
[2022-05-21 06:49:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 06:49:54] [INFO ] Removed a total of 9450 redundant transitions.
[2022-05-21 06:49:54] [INFO ] Flatten gal took : 555 ms
[2022-05-21 06:49:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-21 06:49:54] [INFO ] Time to serialize gal into /tmp/LTLFireability8599760014475794728.gal : 15 ms
[2022-05-21 06:49:55] [INFO ] Time to serialize properties into /tmp/LTLFireability16719280873064919962.ltl : 230 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8599760014475794728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16719280873064919962.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !(((G(X((G((G("(((((((((((((((u81.Rows_5_6>=1)&&(u310.Cells_5_10>=1))&&(u606.Columns_10_6>=1))||(((u185.Rows_12_5>=1)&&(u412.Cells_12_...965459
Formula 0 simplified : !(GX(G("(((((((((((((((u81.Rows_5_6>=1)&&(u310.Cells_5_10>=1))&&(u606.Columns_10_6>=1))||(((u185.Rows_12_5>=1)&&(u412.Cells_12_7>=1)...965439
Compilation finished in 10078 ms.
Running link step : cd /tmp/ltsmin465814514125058504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin465814514125058504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X(([](([]((LTLAPp0==true))&&(LTLAPp0==true)))&&)))) U X(X((LTLAPp0==true))))' '--buchi-type=spotba'
BK_STOP 1653116396282
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545600316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN15.tgz
mv Sudoku-PT-AN15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;