About the Execution of ITS-Tools for ShieldRVs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.180 | 3600000.00 | 5926826.00 | 70139.50 | F?FFTF?FFTFFFFFT | 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.r222-tall-165286025800836.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 ShieldRVs-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800836
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.4K Apr 30 06:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 06:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 06:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 06:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 256K 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 ShieldRVs-PT-040A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-040A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653059957576
Running Version 202205111006
[2022-05-20 15:19:18] [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-20 15:19:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 15:19:18] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-05-20 15:19:18] [INFO ] Transformed 563 places.
[2022-05-20 15:19:18] [INFO ] Transformed 763 transitions.
[2022-05-20 15:19:18] [INFO ] Found NUPN structural information;
[2022-05-20 15:19:18] [INFO ] Parsed PT model containing 563 places and 763 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-040A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 72 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:19:19] [INFO ] Computed 161 place invariants in 31 ms
[2022-05-20 15:19:19] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:19:19] [INFO ] Computed 161 place invariants in 15 ms
[2022-05-20 15:19:20] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:19:20] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:19:20] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Support contains 65 out of 563 places after structural reductions.
[2022-05-20 15:19:20] [INFO ] Flatten gal took : 122 ms
[2022-05-20 15:19:20] [INFO ] Flatten gal took : 73 ms
[2022-05-20 15:19:21] [INFO ] Input system was already deterministic with 763 transitions.
Support contains 62 out of 563 places (down from 65) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 30) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:19:21] [INFO ] Computed 161 place invariants in 7 ms
[2022-05-20 15:19:21] [INFO ] [Real]Absence check using 161 positive place invariants in 26 ms returned sat
[2022-05-20 15:19:22] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 15:19:22] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2022-05-20 15:19:22] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 15:19:22] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2022-05-20 15:19:22] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2022-05-20 15:19:23] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-20 15:19:23] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2022-05-20 15:19:23] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2022-05-20 15:19:23] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2022-05-20 15:19:23] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-05-20 15:19:23] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2022-05-20 15:19:23] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2022-05-20 15:19:24] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2022-05-20 15:19:24] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:19:24] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 3 ms to minimize.
[2022-05-20 15:19:24] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-20 15:19:24] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:19:24] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2022-05-20 15:19:24] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-05-20 15:19:25] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:19:26] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 3 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2022-05-20 15:19:27] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 0 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 0 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2022-05-20 15:19:28] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2022-05-20 15:19:29] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2022-05-20 15:19:30] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 0 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2022-05-20 15:19:31] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 0 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 0 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 0 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 0 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 0 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2022-05-20 15:19:32] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2022-05-20 15:19:33] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-05-20 15:19:33] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2022-05-20 15:19:33] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:19:33] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2022-05-20 15:19:33] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:19:33] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2022-05-20 15:19:34] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2022-05-20 15:19:35] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2022-05-20 15:19:36] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2022-05-20 15:19:36] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2022-05-20 15:19:36] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-20 15:19:36] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-05-20 15:19:36] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2022-05-20 15:19:36] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-05-20 15:19:36] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-20 15:19:37] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-05-20 15:19:38] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:19:39] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2022-05-20 15:19:39] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2022-05-20 15:19:39] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2022-05-20 15:19:39] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2022-05-20 15:19:39] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-05-20 15:19:39] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2022-05-20 15:19:39] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-20 15:19:40] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2022-05-20 15:19:40] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:19:40] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:19:40] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2022-05-20 15:19:40] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2022-05-20 15:19:40] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2022-05-20 15:19:40] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-20 15:19:41] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:19:41] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2022-05-20 15:19:41] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2022-05-20 15:19:41] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 1 ms to minimize.
[2022-05-20 15:19:41] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2022-05-20 15:19:42] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:19:42] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:19:42] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2022-05-20 15:19:42] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-05-20 15:19:42] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:19:42] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:19:43] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2022-05-20 15:19:43] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-20 15:19:43] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:19:43] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2022-05-20 15:19:43] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2022-05-20 15:19:43] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2022-05-20 15:19:44] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-05-20 15:19:44] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-20 15:19:44] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:19:44] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2022-05-20 15:19:44] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-05-20 15:19:44] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2022-05-20 15:19:45] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:19:45] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2022-05-20 15:19:45] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-20 15:19:45] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2022-05-20 15:19:45] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-20 15:19:46] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:19:46] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2022-05-20 15:19:46] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2022-05-20 15:19:46] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:19:46] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:19:46] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-20 15:19:47] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:19:47] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 1 ms to minimize.
[2022-05-20 15:19:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 15:19:47] [INFO ] After 25232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 37 ms.
Support contains 8 out of 563 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 84 place count 562 transition count 762
Applied a total of 84 rules in 104 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:19:47] [INFO ] Computed 161 place invariants in 10 ms
[2022-05-20 15:19:47] [INFO ] [Real]Absence check using 161 positive place invariants in 22 ms returned sat
[2022-05-20 15:19:48] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 15:19:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 22 ms returned sat
[2022-05-20 15:19:48] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 15:19:48] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 15:19:48] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2022-05-20 15:19:48] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2022-05-20 15:19:49] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2022-05-20 15:19:49] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 15:19:49] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-05-20 15:19:49] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:19:49] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2022-05-20 15:19:49] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2022-05-20 15:19:50] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 15:19:50] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2022-05-20 15:19:50] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-05-20 15:19:50] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:19:50] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2022-05-20 15:19:50] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:19:50] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2022-05-20 15:19:51] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:19:51] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-20 15:19:51] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2022-05-20 15:19:51] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2022-05-20 15:19:57] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:19:57] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2022-05-20 15:19:58] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2022-05-20 15:19:58] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:19:58] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2022-05-20 15:19:58] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-20 15:19:58] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:19:58] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2022-05-20 15:19:58] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2022-05-20 15:19:59] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2022-05-20 15:19:59] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-05-20 15:19:59] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2022-05-20 15:19:59] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-05-20 15:19:59] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2022-05-20 15:19:59] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:19:59] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2022-05-20 15:20:00] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:20:00] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-05-20 15:20:00] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2022-05-20 15:20:00] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-05-20 15:20:00] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2022-05-20 15:20:00] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2022-05-20 15:20:00] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2022-05-20 15:20:01] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-20 15:20:01] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-05-20 15:20:01] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:20:01] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-05-20 15:20:01] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2022-05-20 15:20:01] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2022-05-20 15:20:01] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2022-05-20 15:20:02] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-20 15:20:02] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2022-05-20 15:20:02] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-20 15:20:02] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2022-05-20 15:20:02] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2022-05-20 15:20:02] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:02] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2022-05-20 15:20:03] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2022-05-20 15:20:03] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2022-05-20 15:20:03] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2022-05-20 15:20:03] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2022-05-20 15:20:03] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2022-05-20 15:20:03] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2022-05-20 15:20:04] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:20:04] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-20 15:20:04] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:20:04] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:20:04] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-05-20 15:20:04] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:20:04] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 4 ms to minimize.
[2022-05-20 15:20:05] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2022-05-20 15:20:05] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2022-05-20 15:20:05] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2022-05-20 15:20:05] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 0 ms to minimize.
[2022-05-20 15:20:05] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-05-20 15:20:05] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:20:06] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2022-05-20 15:20:06] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:06] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2022-05-20 15:20:06] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:06] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2022-05-20 15:20:06] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:07] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-05-20 15:20:07] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:07] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2022-05-20 15:20:07] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:07] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2022-05-20 15:20:07] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:20:08] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:08] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2022-05-20 15:20:08] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:08] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2022-05-20 15:20:08] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2022-05-20 15:20:08] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2022-05-20 15:20:08] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:20:09] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:09] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2022-05-20 15:20:09] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2022-05-20 15:20:09] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:09] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:20:09] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:10] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2022-05-20 15:20:10] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-05-20 15:20:10] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:20:10] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2022-05-20 15:20:10] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:10] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2022-05-20 15:20:11] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:20:11] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2022-05-20 15:20:11] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2022-05-20 15:20:11] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2022-05-20 15:20:11] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:20:11] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-20 15:20:12] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:20:12] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:20:12] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:12] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:12] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2022-05-20 15:20:12] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:13] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2022-05-20 15:20:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 15:20:13] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 45 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518605 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518605 steps, saw 465061 distinct states, run finished after 3003 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:20:16] [INFO ] Computed 161 place invariants in 11 ms
[2022-05-20 15:20:16] [INFO ] [Real]Absence check using 161 positive place invariants in 21 ms returned sat
[2022-05-20 15:20:16] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 15:20:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned sat
[2022-05-20 15:20:16] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 15:20:17] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2022-05-20 15:20:17] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2022-05-20 15:20:17] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2022-05-20 15:20:17] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-05-20 15:20:17] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2022-05-20 15:20:18] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:20:18] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:20:18] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2022-05-20 15:20:18] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:20:18] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:20:18] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2022-05-20 15:20:19] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2022-05-20 15:20:19] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:20:19] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-05-20 15:20:19] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2022-05-20 15:20:19] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2022-05-20 15:20:19] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2022-05-20 15:20:19] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2022-05-20 15:20:20] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-05-20 15:20:20] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-20 15:20:26] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2022-05-20 15:20:26] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2022-05-20 15:20:26] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:20:26] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2022-05-20 15:20:27] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2022-05-20 15:20:28] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-05-20 15:20:28] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2022-05-20 15:20:28] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2022-05-20 15:20:28] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2022-05-20 15:20:28] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2022-05-20 15:20:28] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-05-20 15:20:28] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2022-05-20 15:20:29] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 15:20:30] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-05-20 15:20:31] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:31] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2022-05-20 15:20:31] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2022-05-20 15:20:31] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2022-05-20 15:20:31] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2022-05-20 15:20:31] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2022-05-20 15:20:32] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2022-05-20 15:20:32] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2022-05-20 15:20:32] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:32] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:32] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-20 15:20:32] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2022-05-20 15:20:32] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:20:33] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-05-20 15:20:33] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2022-05-20 15:20:33] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:20:33] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:20:33] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2022-05-20 15:20:33] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:34] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:34] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:34] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:34] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:20:34] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:34] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:35] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:20:35] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-20 15:20:35] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:35] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:35] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:20:35] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:20:36] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:20:36] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:36] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:36] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:36] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:20:36] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:37] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:20:37] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:20:37] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-05-20 15:20:37] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2022-05-20 15:20:37] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:37] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:20:37] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:38] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:38] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:20:38] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:20:38] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:20:38] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:38] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2022-05-20 15:20:39] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 0 ms to minimize.
[2022-05-20 15:20:39] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2022-05-20 15:20:39] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:39] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2022-05-20 15:20:39] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-20 15:20:39] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2022-05-20 15:20:40] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2022-05-20 15:20:40] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 0 ms to minimize.
[2022-05-20 15:20:40] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:40] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:20:40] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:20:40] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2022-05-20 15:20:41] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:41] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-05-20 15:20:41] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:20:41] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:20:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 15:20:41] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 28 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 24 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:20:41] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:20:41] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:20:41] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:20:42] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2022-05-20 15:20:42] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:20:42] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:20:43] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 38 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:20:43] [INFO ] Computed 161 place invariants in 6 ms
[2022-05-20 15:20:43] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2022-05-20 15:20:43] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 15:20:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2022-05-20 15:20:43] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 15:20:44] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2022-05-20 15:20:44] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2022-05-20 15:20:44] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2022-05-20 15:20:44] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2022-05-20 15:20:44] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2022-05-20 15:20:44] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 15:20:45] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-20 15:20:45] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2022-05-20 15:20:45] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2022-05-20 15:20:45] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2022-05-20 15:20:45] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 4 ms to minimize.
[2022-05-20 15:20:45] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2022-05-20 15:20:46] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2022-05-20 15:20:46] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-20 15:20:46] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 15:20:46] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2022-05-20 15:20:46] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2022-05-20 15:20:46] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-05-20 15:20:47] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-20 15:20:47] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-20 15:20:53] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2022-05-20 15:20:53] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2022-05-20 15:20:53] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:20:53] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:54] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:20:54] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:20:54] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2022-05-20 15:20:54] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-05-20 15:20:54] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2022-05-20 15:20:54] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2022-05-20 15:20:54] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:20:55] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2022-05-20 15:20:55] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2022-05-20 15:20:55] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-05-20 15:20:55] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2022-05-20 15:20:55] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2022-05-20 15:20:55] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2022-05-20 15:20:55] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2022-05-20 15:20:56] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2022-05-20 15:20:56] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2022-05-20 15:20:56] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2022-05-20 15:20:56] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-05-20 15:20:56] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-20 15:20:56] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2022-05-20 15:20:56] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-05-20 15:20:57] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2022-05-20 15:20:58] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2022-05-20 15:20:58] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2022-05-20 15:20:58] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2022-05-20 15:20:58] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:20:58] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2022-05-20 15:20:58] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2022-05-20 15:20:59] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2022-05-20 15:20:59] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2022-05-20 15:20:59] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2022-05-20 15:20:59] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2022-05-20 15:20:59] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2022-05-20 15:20:59] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:21:00] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:21:00] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2022-05-20 15:21:00] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:21:00] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2022-05-20 15:21:00] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-05-20 15:21:00] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:21:00] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2022-05-20 15:21:01] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2022-05-20 15:21:01] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2022-05-20 15:21:01] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2022-05-20 15:21:01] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:21:01] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2022-05-20 15:21:01] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2022-05-20 15:21:02] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-05-20 15:21:02] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2022-05-20 15:21:02] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:21:02] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-05-20 15:21:02] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2022-05-20 15:21:02] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 4 ms to minimize.
[2022-05-20 15:21:03] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-20 15:21:03] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:21:03] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2022-05-20 15:21:03] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2022-05-20 15:21:03] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2022-05-20 15:21:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:21:03] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:21:04] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2022-05-20 15:21:04] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:21:04] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2022-05-20 15:21:04] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:21:04] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:21:04] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2022-05-20 15:21:04] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2022-05-20 15:21:05] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2022-05-20 15:21:05] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-05-20 15:21:05] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2022-05-20 15:21:05] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2022-05-20 15:21:05] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:21:05] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2022-05-20 15:21:06] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-05-20 15:21:06] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2022-05-20 15:21:06] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2022-05-20 15:21:06] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2022-05-20 15:21:06] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-05-20 15:21:06] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2022-05-20 15:21:07] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:21:07] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-20 15:21:07] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2022-05-20 15:21:07] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2022-05-20 15:21:07] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2022-05-20 15:21:07] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2022-05-20 15:21:07] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2022-05-20 15:21:08] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 0 ms to minimize.
[2022-05-20 15:21:08] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2022-05-20 15:21:08] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2022-05-20 15:21:08] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2022-05-20 15:21:08] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-20 15:21:08] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2022-05-20 15:21:09] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:21:09] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2022-05-20 15:21:09] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 0 ms to minimize.
[2022-05-20 15:21:09] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2022-05-20 15:21:09] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2022-05-20 15:21:09] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2022-05-20 15:21:09] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2022-05-20 15:21:10] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2022-05-20 15:21:10] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2022-05-20 15:21:10] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:21:10] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2022-05-20 15:21:10] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2022-05-20 15:21:10] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2022-05-20 15:21:11] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2022-05-20 15:21:12] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2022-05-20 15:21:13] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2022-05-20 15:21:13] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2022-05-20 15:21:13] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2022-05-20 15:21:13] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-20 15:21:13] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-20 15:21:13] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-20 15:21:13] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 0 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:21:14] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2022-05-20 15:21:15] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2022-05-20 15:21:16] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2022-05-20 15:21:16] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-20 15:21:16] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-20 15:21:16] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-20 15:21:16] [INFO ] Trap strengthening (SAT) tested/added 181/180 trap constraints in 32580 ms
[2022-05-20 15:21:16] [INFO ] After 32938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2022-05-20 15:21:16] [INFO ] After 33207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 15:21:16] [INFO ] Flatten gal took : 61 ms
[2022-05-20 15:21:16] [INFO ] Flatten gal took : 50 ms
[2022-05-20 15:21:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11229038768927139396.gal : 19 ms
[2022-05-20 15:21:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8287352230473909541.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5806227910086917362;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11229038768927139396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8287352230473909541.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8287352230473909541.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 272
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :272 after 2290
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2290 after 35322
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :35322 after 324325
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :324325 after 3.70353e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.70353e+06 after 3.3496e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.3496e+08 after 4.84227e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4.84227e+10 after 2.22404e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.22404e+13 after 2.18047e+16
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.18047e+16 after 8.46195e+20
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :8.46195e+20 after 1.21744e+29
Detected timeout of ITS tools.
[2022-05-20 15:21:31] [INFO ] Flatten gal took : 49 ms
[2022-05-20 15:21:31] [INFO ] Applying decomposition
[2022-05-20 15:21:32] [INFO ] Flatten gal took : 39 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/graph3384698129723096482.txt' '-o' '/tmp/graph3384698129723096482.bin' '-w' '/tmp/graph3384698129723096482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3384698129723096482.bin' '-l' '-1' '-v' '-w' '/tmp/graph3384698129723096482.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:21:32] [INFO ] Decomposing Gal with order
[2022-05-20 15:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:21:32] [INFO ] Removed a total of 877 redundant transitions.
[2022-05-20 15:21:32] [INFO ] Flatten gal took : 124 ms
[2022-05-20 15:21:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 935 labels/synchronizations in 45 ms.
[2022-05-20 15:21:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13696109180551416905.gal : 10 ms
[2022-05-20 15:21:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6002546195508207731.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5806227910086917362;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13696109180551416905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6002546195508207731.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality6002546195508207731.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 9224
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9224 after 16956
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16956 after 4.96293e+41
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2046552340600904205
[2022-05-20 15:21:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2046552340600904205
Running compilation step : cd /tmp/ltsmin2046552340600904205;'/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'
Compilation finished in 1396 ms.
Running link step : cd /tmp/ltsmin2046552340600904205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2046552340600904205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp22==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA ShieldRVs-PT-040A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((G(p0) U p0))||F(p1)))))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:22:02] [INFO ] Computed 161 place invariants in 6 ms
[2022-05-20 15:22:03] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:22:03] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:22:03] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:22:03] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:22:04] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (EQ s537 1) (EQ s539 1) (EQ s544 1)), p1:(AND (EQ s542 1) (EQ s548 1) (EQ s555 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 539 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-00 finished in 1478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(F(G(p0))))||G(F(p1))))))'
Support contains 4 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 46 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:22:04] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:22:04] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:22:04] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:22:05] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2022-05-20 15:22:05] [INFO ] Redundant transitions in 128 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:22:05] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:22:05] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s234 0), p1:(AND (EQ s495 1) (EQ s497 1) (EQ s502 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 186 reset in 550 ms.
Product exploration explored 100000 steps with 186 reset in 475 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 293 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 21 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:22:07] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 15:22:07] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:22:07] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:22:08] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2022-05-20 15:22:08] [INFO ] Redundant transitions in 125 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:22:08] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:22:08] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 761/761 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 297 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 187 reset in 390 ms.
Product exploration explored 100000 steps with 187 reset in 450 ms.
Built C files in :
/tmp/ltsmin5212958156396684060
[2022-05-20 15:22:10] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2022-05-20 15:22:10] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:22:10] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2022-05-20 15:22:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:22:10] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2022-05-20 15:22:10] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:22:10] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5212958156396684060
Running compilation step : cd /tmp/ltsmin5212958156396684060;'/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'
Compilation finished in 2034 ms.
Running link step : cd /tmp/ltsmin5212958156396684060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5212958156396684060;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13344558000530566596.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:22:25] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:22:25] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:22:25] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:22:26] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2022-05-20 15:22:26] [INFO ] Redundant transitions in 114 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:22:26] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:22:26] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 761/761 transitions.
Built C files in :
/tmp/ltsmin9961007879107559312
[2022-05-20 15:22:26] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2022-05-20 15:22:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:22:26] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2022-05-20 15:22:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:22:26] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2022-05-20 15:22:26] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:22:26] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9961007879107559312
Running compilation step : cd /tmp/ltsmin9961007879107559312;'/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'
Compilation finished in 1960 ms.
Running link step : cd /tmp/ltsmin9961007879107559312;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9961007879107559312;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased676257617391948999.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 15:22:41] [INFO ] Flatten gal took : 37 ms
[2022-05-20 15:22:41] [INFO ] Flatten gal took : 35 ms
[2022-05-20 15:22:41] [INFO ] Time to serialize gal into /tmp/LTL12616646071531614927.gal : 5 ms
[2022-05-20 15:22:41] [INFO ] Time to serialize properties into /tmp/LTL3447403229108446100.ltl : 1 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/LTL12616646071531614927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3447403229108446100.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/LTL1261664...267
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G(F(G("(p234==0)")))))||(G(F("(((p495==1)&&(p497==1))&&(p502==1))")))))))
Formula 0 simplified : !XX(FGFG"(p234==0)" | GF"(((p495==1)&&(p497==1))&&(p502==1))")
Detected timeout of ITS tools.
[2022-05-20 15:22:56] [INFO ] Flatten gal took : 36 ms
[2022-05-20 15:22:56] [INFO ] Applying decomposition
[2022-05-20 15:22:56] [INFO ] Flatten gal took : 34 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/graph5336923499082193509.txt' '-o' '/tmp/graph5336923499082193509.bin' '-w' '/tmp/graph5336923499082193509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5336923499082193509.bin' '-l' '-1' '-v' '-w' '/tmp/graph5336923499082193509.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:22:57] [INFO ] Decomposing Gal with order
[2022-05-20 15:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:22:57] [INFO ] Removed a total of 835 redundant transitions.
[2022-05-20 15:22:57] [INFO ] Flatten gal took : 56 ms
[2022-05-20 15:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 908 labels/synchronizations in 20 ms.
[2022-05-20 15:22:57] [INFO ] Time to serialize gal into /tmp/LTL14946955837392571718.gal : 6 ms
[2022-05-20 15:22:57] [INFO ] Time to serialize properties into /tmp/LTL10952427847349802492.ltl : 0 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/LTL14946955837392571718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10952427847349802492.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/LTL1494695...247
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G(F(G("(i7.i0.u67.p234==0)")))))||(G(F("(((i15.i0.u141.p495==1)&&(i15.i0.u142.p497==1))&&(i15.i0.u143.p502==1))")))))))
Formula 0 simplified : !XX(FGFG"(i7.i0.u67.p234==0)" | GF"(((i15.i0.u141.p495==1)&&(i15.i0.u142.p497==1))&&(i15.i0.u143.p502==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13858523347120259799
[2022-05-20 15:23:12] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13858523347120259799
Running compilation step : cd /tmp/ltsmin13858523347120259799;'/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'
Compilation finished in 1408 ms.
Running link step : cd /tmp/ltsmin13858523347120259799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13858523347120259799;'/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(X((<>([](<>([]((LTLAPp0==true)))))||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040A-LTLFireability-01 finished in 82933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(X(X(p1)))&&(G(!p2) U p0)))'
Support contains 9 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:27] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 15:23:27] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:27] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:23:28] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:28] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 15:23:28] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), true, p2, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(OR p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s328 1) (EQ s329 1) (EQ s334 1)), p2:(AND (EQ s472 1) (EQ s476 1) (EQ s485 1)), p1:(AND (EQ s61 1) (EQ s63 1) (EQ s67 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]]
Stuttering criterion allowed to conclude after 543 steps with 0 reset in 6 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-02 finished in 1422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(p1))&&p0))&&(!X(p1) U G(p2))))'
Support contains 5 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 12 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:28] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:23:29] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:29] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:29] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:29] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:29] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), p1, (NOT p1), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p2) p1), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=p2, acceptance={} source=0 dest: 6}], [{ cond=p1, acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p1 p2), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s277 1), p1:(EQ s397 1), p0:(AND (EQ s493 1) (EQ s510 1) (EQ s519 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 562 steps with 1 reset in 5 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-03 finished in 1530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((G(p1)||p0)&&(F(p3)||p2)))))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 12 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:30] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:30] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:30] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:31] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:31] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:31] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s306 0) (EQ s310 0) (EQ s317 0)), p1:(OR (EQ s244 0) (EQ s245 0) (EQ s250 0)), p2:(OR (EQ s244 0) (EQ s245 0) (EQ s250 0) (EQ s306 0) (EQ s310 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2129 ms.
Product exploration explored 100000 steps with 50000 reset in 2126 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 p2 p3)
Knowledge based reduction with 11 factoid took 289 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-040A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLFireability-04 finished in 6037 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0)&&p1&&(F(G(p2))||G(p2))))))))'
Support contains 5 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 11 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:36] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:23:36] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:36] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:37] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:23:37] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 15:23:37] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s332 1), p0:(EQ s397 1), p2:(AND (EQ s328 1) (EQ s329 1) (EQ s333 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 516 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-05 finished in 1395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 28 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:23:37] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:23:38] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 15:23:38] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:23:38] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2022-05-20 15:23:38] [INFO ] Redundant transitions in 153 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:23:38] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:39] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/563 places, 761/763 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 562/563 places, 761/763 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s512 1) (EQ s517 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3904 reset in 490 ms.
Product exploration explored 100000 steps with 3888 reset in 563 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:23:40] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:23:40] [INFO ] [Real]Absence check using 161 positive place invariants in 64 ms returned sat
[2022-05-20 15:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 15:23:41] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2022-05-20 15:23:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 15:23:41] [INFO ] [Nat]Absence check using 161 positive place invariants in 48 ms returned sat
[2022-05-20 15:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 15:23:42] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2022-05-20 15:23:42] [INFO ] Computed and/alt/rep : 369/1379/369 causal constraints (skipped 391 transitions) in 44 ms.
[2022-05-20 15:23:45] [INFO ] Added : 279 causal constraints over 56 iterations in 2939 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 36 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:23:45] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:23:45] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:23:45] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:23:46] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2022-05-20 15:23:46] [INFO ] Redundant transitions in 106 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:23:46] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:23:46] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 761/761 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:23:47] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:23:47] [INFO ] [Real]Absence check using 161 positive place invariants in 69 ms returned sat
[2022-05-20 15:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 15:23:48] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2022-05-20 15:23:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 15:23:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 48 ms returned sat
[2022-05-20 15:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 15:23:49] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2022-05-20 15:23:49] [INFO ] Computed and/alt/rep : 369/1379/369 causal constraints (skipped 391 transitions) in 50 ms.
[2022-05-20 15:23:52] [INFO ] Added : 279 causal constraints over 56 iterations in 3020 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3864 reset in 536 ms.
Product exploration explored 100000 steps with 3875 reset in 582 ms.
Built C files in :
/tmp/ltsmin10466874491021089620
[2022-05-20 15:23:53] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2022-05-20 15:23:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:23:53] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2022-05-20 15:23:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:23:53] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2022-05-20 15:23:53] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:23:53] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10466874491021089620
Running compilation step : cd /tmp/ltsmin10466874491021089620;'/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'
Compilation finished in 2042 ms.
Running link step : cd /tmp/ltsmin10466874491021089620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10466874491021089620;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7891843495097650460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:24:08] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 15:24:08] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:24:08] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:24:09] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2022-05-20 15:24:09] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 761 rows 562 cols
[2022-05-20 15:24:09] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:24:10] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 761/761 transitions.
Built C files in :
/tmp/ltsmin15400954246533540876
[2022-05-20 15:24:10] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2022-05-20 15:24:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:24:10] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2022-05-20 15:24:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:24:10] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2022-05-20 15:24:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:24:10] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15400954246533540876
Running compilation step : cd /tmp/ltsmin15400954246533540876;'/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'
Compilation finished in 1913 ms.
Running link step : cd /tmp/ltsmin15400954246533540876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15400954246533540876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13127603903379925574.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 15:24:25] [INFO ] Flatten gal took : 36 ms
[2022-05-20 15:24:25] [INFO ] Flatten gal took : 34 ms
[2022-05-20 15:24:25] [INFO ] Time to serialize gal into /tmp/LTL542552277409638968.gal : 5 ms
[2022-05-20 15:24:25] [INFO ] Time to serialize properties into /tmp/LTL15370058516551577505.ltl : 1 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/LTL542552277409638968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15370058516551577505.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/LTL5425522...266
Read 1 LTL properties
Checking formula 0 : !((F("((p512==1)&&(p517==1))")))
Formula 0 simplified : !F"((p512==1)&&(p517==1))"
Detected timeout of ITS tools.
[2022-05-20 15:24:40] [INFO ] Flatten gal took : 36 ms
[2022-05-20 15:24:40] [INFO ] Applying decomposition
[2022-05-20 15:24:40] [INFO ] Flatten gal took : 33 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/graph9303394231972892996.txt' '-o' '/tmp/graph9303394231972892996.bin' '-w' '/tmp/graph9303394231972892996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9303394231972892996.bin' '-l' '-1' '-v' '-w' '/tmp/graph9303394231972892996.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:24:40] [INFO ] Decomposing Gal with order
[2022-05-20 15:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:24:40] [INFO ] Removed a total of 835 redundant transitions.
[2022-05-20 15:24:40] [INFO ] Flatten gal took : 112 ms
[2022-05-20 15:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 860 labels/synchronizations in 30 ms.
[2022-05-20 15:24:40] [INFO ] Time to serialize gal into /tmp/LTL469856436175011492.gal : 14 ms
[2022-05-20 15:24:40] [INFO ] Time to serialize properties into /tmp/LTL18159462108851700494.ltl : 0 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/LTL469856436175011492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18159462108851700494.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/LTL4698564...245
Read 1 LTL properties
Checking formula 0 : !((F("((i16.i1.u146.p512==1)&&(i16.i1.u148.p517==1))")))
Formula 0 simplified : !F"((i16.i1.u146.p512==1)&&(i16.i1.u148.p517==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13299324096967900400
[2022-05-20 15:24:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13299324096967900400
Running compilation step : cd /tmp/ltsmin13299324096967900400;'/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'
Compilation finished in 1231 ms.
Running link step : cd /tmp/ltsmin13299324096967900400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13299324096967900400;'/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' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040A-LTLFireability-06 finished in 93073 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1)&&X(p2))))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:10] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 15:25:11] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:11] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:25:11] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:11] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:25:11] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), 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:(AND (EQ s204 1) (EQ s209 1)), p1:(EQ s182 0), p2:(OR (EQ s510 0) (EQ s511 0) (EQ s515 0))], 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 explored 100000 steps with 50000 reset in 2144 ms.
Product exploration explored 100000 steps with 50000 reset in 2177 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 9 factoid took 171 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVs-PT-040A-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040A-LTLFireability-09 finished in 5849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((G(p0)||(G(p2)&&p1)))))))'
Support contains 9 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:16] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:25:16] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:16] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:25:17] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:17] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:25:17] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1)) (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))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s299 1) (EQ s301 1) (EQ s305 1)), p2:(OR (EQ s299 0) (EQ s301 0) (EQ s305 0) (EQ s2 0) (EQ s4 0) (EQ s16 0)), p0:(OR (EQ s6 0) (EQ s7 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 504 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-10 finished in 1465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 6 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 11 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:18] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:25:18] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:18] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:25:18] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:18] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 15:25:19] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (EQ s118 1) (EQ s119 1) (EQ s123 1)), p0:(AND (EQ s180 1) (EQ s184 1) (EQ s191 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 1346 steps with 2 reset in 6 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-12 finished in 1338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(X(G(p0)))) U X(p1))))'
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 9 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:19] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:25:19] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:19] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 15:25:20] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
// Phase 1: matrix 763 rows 563 cols
[2022-05-20 15:25:20] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 15:25:20] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 763/763 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s74 1) (EQ s256 1)), p0:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 552 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-040A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040A-LTLFireability-13 finished in 1305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(F(G(p0))))||G(F(p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-20 15:25:21] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6531095437299392423
[2022-05-20 15:25:21] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2022-05-20 15:25:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:25:21] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2022-05-20 15:25:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:25:21] [INFO ] Applying decomposition
[2022-05-20 15:25:21] [INFO ] Flatten gal took : 30 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/graph4831880963441255819.txt' '-o' '/tmp/graph4831880963441255819.bin' '-w' '/tmp/graph4831880963441255819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4831880963441255819.bin' '-l' '-1' '-v' '-w' '/tmp/graph4831880963441255819.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:25:21] [INFO ] Decomposing Gal with order
[2022-05-20 15:25:21] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
[2022-05-20 15:25:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:25:21] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:25:21] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6531095437299392423
Running compilation step : cd /tmp/ltsmin6531095437299392423;'/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-20 15:25:21] [INFO ] Removed a total of 837 redundant transitions.
[2022-05-20 15:25:21] [INFO ] Flatten gal took : 48 ms
[2022-05-20 15:25:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 872 labels/synchronizations in 18 ms.
[2022-05-20 15:25:21] [INFO ] Time to serialize gal into /tmp/LTLFireability8796632069784580965.gal : 7 ms
[2022-05-20 15:25:21] [INFO ] Time to serialize properties into /tmp/LTLFireability15206170679448885780.ltl : 0 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/LTLFireability8796632069784580965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15206170679448885780.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 : !((X(X((F(G(F(G("(i6.i1.u67.p234==0)")))))||(G(F("(((i14.i1.u141.p495==1)&&(i14.i1.u142.p497==1))&&(i14.i1.u143.p502==1))")))))))
Formula 0 simplified : !XX(FGFG"(i6.i1.u67.p234==0)" | GF"(((i14.i1.u141.p495==1)&&(i14.i1.u142.p497==1))&&(i14.i1.u143.p502==1))")
Compilation finished in 1941 ms.
Running link step : cd /tmp/ltsmin6531095437299392423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6531095437299392423;'/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(X((<>([](<>([]((LTLAPp0==true)))))||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.200: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.200: LTL layer: formula: X(X((<>([](<>([]((LTLAPp0==true)))))||[](<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 5/ 8), 0.200: "X(X((<>([](<>([]((LTLAPp0==true)))))||[](<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.200: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.199: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.214: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.230: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.231: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.233: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.284: There are 767 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.284: State length is 564, there are 769 groups
pins2lts-mc-linux64( 0/ 8), 0.284: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.284: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.284: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.284: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.399: [Blue] ~120 levels ~960 states ~7096 transitions
pins2lts-mc-linux64( 1/ 8), 0.489: [Blue] ~240 levels ~1920 states ~12784 transitions
pins2lts-mc-linux64( 4/ 8), 0.655: [Blue] ~480 levels ~3840 states ~28600 transitions
pins2lts-mc-linux64( 4/ 8), 0.782: [Blue] ~571 levels ~7680 states ~43296 transitions
pins2lts-mc-linux64( 6/ 8), 0.988: [Blue] ~582 levels ~15360 states ~72704 transitions
pins2lts-mc-linux64( 1/ 8), 1.376: [Blue] ~517 levels ~30720 states ~156360 transitions
pins2lts-mc-linux64( 1/ 8), 2.155: [Blue] ~517 levels ~61440 states ~332600 transitions
pins2lts-mc-linux64( 1/ 8), 3.690: [Blue] ~525 levels ~122880 states ~664352 transitions
pins2lts-mc-linux64( 7/ 8), 6.569: [Blue] ~554 levels ~245760 states ~1213352 transitions
pins2lts-mc-linux64( 4/ 8), 12.048: [Blue] ~574 levels ~491520 states ~2744968 transitions
pins2lts-mc-linux64( 5/ 8), 22.468: [Blue] ~531 levels ~983040 states ~5019976 transitions
pins2lts-mc-linux64( 5/ 8), 42.498: [Blue] ~531 levels ~1966080 states ~10512096 transitions
pins2lts-mc-linux64( 5/ 8), 83.225: [Blue] ~531 levels ~3932160 states ~22371064 transitions
pins2lts-mc-linux64( 5/ 8), 163.299: [Blue] ~531 levels ~7864320 states ~48019864 transitions
pins2lts-mc-linux64( 5/ 8), 326.902: [Blue] ~531 levels ~15728640 states ~103445488 transitions
pins2lts-mc-linux64( 5/ 8), 656.598: [Blue] ~531 levels ~31457280 states ~218660104 transitions
pins2lts-mc-linux64( 7/ 8), 688.143: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 688.181:
pins2lts-mc-linux64( 0/ 8), 688.181: Explored 31564564 states 232836062 transitions, fanout: 7.377
pins2lts-mc-linux64( 0/ 8), 688.181: Total exploration time 687.880 sec (687.860 sec minimum, 687.867 sec on average)
pins2lts-mc-linux64( 0/ 8), 688.181: States per second: 45887, Transitions per second: 338484
pins2lts-mc-linux64( 0/ 8), 688.181:
pins2lts-mc-linux64( 0/ 8), 688.181: State space has 31597977 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 688.181: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 688.181: blue states: 31564564 (99.89%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 688.181: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 688.181: all-red states: 10368 (0.03%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 688.181:
pins2lts-mc-linux64( 0/ 8), 688.181: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 688.181:
pins2lts-mc-linux64( 0/ 8), 688.181: Queue width: 8B, total height: 4589, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 688.181: Tree memory: 497.1MB, 16.5 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 688.181: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 688.181: Stored 791 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 688.181: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 688.181: Est. total memory use: 497.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6531095437299392423;'/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(X((<>([](<>([]((LTLAPp0==true)))))||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6531095437299392423;'/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(X((<>([](<>([]((LTLAPp0==true)))))||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 15:47:22] [INFO ] Applying decomposition
[2022-05-20 15:47:22] [INFO ] Flatten gal took : 316 ms
[2022-05-20 15:47:22] [INFO ] Decomposing Gal with order
[2022-05-20 15:47:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:47:23] [INFO ] Removed a total of 837 redundant transitions.
[2022-05-20 15:47:23] [INFO ] Flatten gal took : 369 ms
[2022-05-20 15:47:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 77 ms.
[2022-05-20 15:47:23] [INFO ] Time to serialize gal into /tmp/LTLFireability17327823394664715643.gal : 35 ms
[2022-05-20 15:47:23] [INFO ] Time to serialize properties into /tmp/LTLFireability14022311475841720893.ltl : 4 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/LTLFireability17327823394664715643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14022311475841720893.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...269
Read 2 LTL properties
Checking formula 0 : !((X(X((F(G(F(G("(u68.p234==0)")))))||(G(F("(((u142.p495==1)&&(u143.p497==1))&&(u144.p502==1))")))))))
Formula 0 simplified : !XX(FGFG"(u68.p234==0)" | GF"(((u142.p495==1)&&(u143.p497==1))&&(u144.p502==1))")
Reverse transition relation is NOT exact ! Due to transitions t243, t249, t252, t256, t261, t264, t268, t271, t276, t279, t283, t288, t291, t296, t301, t30...3265
Computing Next relation with stutter on 3.79058e+30 deadlock states
Detected timeout of ITS tools.
[2022-05-20 16:09:24] [INFO ] Flatten gal took : 140 ms
[2022-05-20 16:09:25] [INFO ] Input system was already deterministic with 763 transitions.
[2022-05-20 16:09:25] [INFO ] Transformed 563 places.
[2022-05-20 16:09:25] [INFO ] Transformed 763 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 16:09:25] [INFO ] Time to serialize gal into /tmp/LTLFireability9649788787483011872.gal : 10 ms
[2022-05-20 16:09:25] [INFO ] Time to serialize properties into /tmp/LTLFireability1318264723352428405.ltl : 0 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/LTLFireability9649788787483011872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1318264723352428405.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((F(G(F(G("(p234==0)")))))||(G(F("(((p495==1)&&(p497==1))&&(p502==1))")))))))
Formula 0 simplified : !XX(FGFG"(p234==0)" | GF"(((p495==1)&&(p497==1))&&(p502==1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ShieldRVs-PT-040A"
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 ShieldRVs-PT-040A, 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 r222-tall-165286025800836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040A.tgz
mv ShieldRVs-PT-040A 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 ;