About the Execution of ITS-Tools for ShieldIIPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.315 | 3600000.00 | 3932237.00 | 9500.60 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760500146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 426K May 18 16:43 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 ShieldIIPs-PT-050A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716913154081
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 16:19:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 16:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:19:15] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-28 16:19:15] [INFO ] Transformed 1253 places.
[2024-05-28 16:19:15] [INFO ] Transformed 1203 transitions.
[2024-05-28 16:19:15] [INFO ] Found NUPN structural information;
[2024-05-28 16:19:15] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 267 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 90 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:19:15] [INFO ] Computed 451 invariants in 33 ms
[2024-05-28 16:19:16] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-05-28 16:19:16] [INFO ] Invariant cache hit.
[2024-05-28 16:19:17] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:19:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30045 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:20:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 8 ms to minimize.
[2024-05-28 16:20:10] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2024-05-28 16:20:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:20:10] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:20:10] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:20:11] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:20:11] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:20:11] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:20:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:20:12] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:20:12] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:20:12] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 3 ms to minimize.
[2024-05-28 16:20:12] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:20:13] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:20:13] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:20:13] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:20:13] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:20:14] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:20:18] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 60706ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60734ms
Finished structural reductions in LTL mode , in 1 iterations and 63008 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 267 out of 1253 places after structural reductions.
[2024-05-28 16:20:18] [INFO ] Flatten gal took : 192 ms
[2024-05-28 16:20:19] [INFO ] Flatten gal took : 96 ms
[2024-05-28 16:20:19] [INFO ] Input system was already deterministic with 1203 transitions.
Support contains 262 out of 1253 places (down from 267) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 116 to 114
RANDOM walk for 40000 steps (12 resets) in 2314 ms. (17 steps per ms) remains 8/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 607 ms. (65 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 442 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 360 ms. (110 steps per ms) remains 8/8 properties
[2024-05-28 16:20:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 80/112 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1141/1253 variables, 418/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1141/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1203/2456 variables, 1253/2957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2456 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2456 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2456/2456 variables, and 2957 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1779 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 80/112 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1141/1253 variables, 418/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1141/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:20:23] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:20:23] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:20:23] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 3/1707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1203/2456 variables, 1253/2960 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2456 variables, 8/2968 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 16:20:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:20:24] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:20:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 16:20:25] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:20:25] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 5/2973 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2456 variables, 0/2973 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 2973 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5008 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 6833ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 329 times.
Drop transitions (Partial Free agglomeration) removed 329 transitions
Iterating global reduction 0 with 329 rules applied. Total rules applied 333 place count 1251 transition count 1201
Applied a total of 333 rules in 220 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 1251/1253 places, 1201/1203 transitions.
RANDOM walk for 40000 steps (8 resets) in 1287 ms. (31 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:20:28] [INFO ] Computed 451 invariants in 55 ms
[2024-05-28 16:20:28] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 41/58 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 41/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1171/1229 variables, 423/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1171/1669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:20:29] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 7/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 22/1251 variables, 11/1687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 22/1709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1201/2452 variables, 1251/2960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2452 variables, 4/2964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2452 variables, 0/2964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/2452 variables, 0/2964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2964 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1819 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 41/58 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 41/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1171/1229 variables, 423/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1171/1669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 7/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 5/1681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 22/1251 variables, 11/1692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 22/1714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:20:31] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 2/1716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1201/2452 variables, 1251/2967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 4/2971 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 4/2975 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:20:32] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:20:32] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:20:32] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:20:32] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:20:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:20:34] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 20/2995 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:20:35] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:20:35] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:20:35] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:20:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:20:35] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:20:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 6/3001 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 16:20:36] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:20:36] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2452 variables, 2/3003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2452 variables, 0/3003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/2452 variables, 0/3003 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 3003 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7014 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 42/42 constraints]
After SMT, in 8915ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 15645 ms.
Support contains 9 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 1251 transition count 1201
Applied a total of 13 rules in 76 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1251/1251 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 728 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 183891 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :1 out of 2
Probabilistic random walk after 183891 steps, saw 175214 distinct states, run finished after 3004 ms. (steps per millisecond=61 ) properties seen :1
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:20:56] [INFO ] Computed 451 invariants in 52 ms
[2024-05-28 16:20:56] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1241 variables, 442/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1241 variables, 1226/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:20:57] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1241 variables, 10/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1241 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/1251 variables, 5/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 10/1712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 2/1714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1201/2452 variables, 1251/2965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2452 variables, 4/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:20:58] [INFO ] Deduced a trap composed of 8 places in 289 ms of which 5 ms to minimize.
[2024-05-28 16:20:59] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 5 ms to minimize.
[2024-05-28 16:20:59] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 5 ms to minimize.
[2024-05-28 16:20:59] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 4 ms to minimize.
[2024-05-28 16:21:00] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 4 ms to minimize.
[2024-05-28 16:21:00] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 4 ms to minimize.
[2024-05-28 16:21:00] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 5 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 5 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 4 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 4 ms to minimize.
[2024-05-28 16:21:01] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 4 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 4 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 3 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 4 ms to minimize.
[2024-05-28 16:21:02] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:21:03] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 3 ms to minimize.
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 4 ms to minimize.
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 20/2989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:21:04] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 2/2991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 0/2991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/2452 variables, 0/2991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2991 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8023 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 446/446 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1226/1241 variables, 442/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1241 variables, 1226/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1241 variables, 30/1717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:05] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:21:05] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:21:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1241 variables, 3/1720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1241 variables, 0/1720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/1251 variables, 5/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 10/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 4/1739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 0/1739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1201/2452 variables, 1251/2990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 4/2994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 1/2995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 11/3006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 0/3006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2452 variables, 0/3006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 3006 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2893 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 446/446 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints]
After SMT, in 10985ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2459 ms.
Support contains 4 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 67 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1251/1251 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 882 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 214390 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 214390 steps, saw 204787 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:21:13] [INFO ] Computed 451 invariants in 13 ms
[2024-05-28 16:21:13] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1232/1247 variables, 445/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1247 variables, 1232/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:14] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:21:14] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:21:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:21:14] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:21:14] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1247 variables, 5/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1251 variables, 2/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 4/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1201/2452 variables, 1251/2958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2452 variables, 4/2962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:15] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 5 ms to minimize.
[2024-05-28 16:21:15] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 4 ms to minimize.
[2024-05-28 16:21:15] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 5 ms to minimize.
[2024-05-28 16:21:16] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 4 ms to minimize.
[2024-05-28 16:21:16] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 4 ms to minimize.
[2024-05-28 16:21:16] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 5 ms to minimize.
[2024-05-28 16:21:16] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 4 ms to minimize.
[2024-05-28 16:21:17] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 4 ms to minimize.
[2024-05-28 16:21:17] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 5 ms to minimize.
[2024-05-28 16:21:17] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 4 ms to minimize.
[2024-05-28 16:21:17] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 4 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 4 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 3 ms to minimize.
[2024-05-28 16:21:18] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 4 ms to minimize.
[2024-05-28 16:21:19] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 4 ms to minimize.
[2024-05-28 16:21:19] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:21:19] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 4 ms to minimize.
[2024-05-28 16:21:19] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2024-05-28 16:21:20] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2452 variables, 20/2982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:20] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:21:20] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 4 ms to minimize.
[2024-05-28 16:21:21] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 4 ms to minimize.
[2024-05-28 16:21:21] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 4 ms to minimize.
[2024-05-28 16:21:21] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 5/2987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2452 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2987 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7937 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 449/449 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1232/1247 variables, 445/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1247 variables, 1232/1696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1247 variables, 30/1726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:21:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 2/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1247 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1251 variables, 2/1730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 4/1734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:22] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 1/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 0/1735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1201/2452 variables, 1251/2986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 4/2990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 1/2991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:22] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:21:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:21:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:21:24] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 10/3001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 0/3001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2452 variables, 0/3001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 3001 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2693 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 449/449 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 43/43 constraints]
After SMT, in 10662ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1769 ms.
Support contains 4 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 41 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 33 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:21:26] [INFO ] Invariant cache hit.
[2024-05-28 16:21:27] [INFO ] Implicit Places using invariants in 828 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 832 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 32 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 897 ms. Remains : 1250/1251 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 541 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 219526 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 219526 steps, saw 209684 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:21:30] [INFO ] Computed 450 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1231/1246 variables, 444/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1246 variables, 1231/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:30] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:21:30] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:21:31] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:21:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:21:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:21:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1246 variables, 6/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1246 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1250 variables, 2/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1250 variables, 4/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1250 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1201/2451 variables, 1250/2956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:31] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2024-05-28 16:21:32] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:21:32] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:21:32] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 3 ms to minimize.
[2024-05-28 16:21:32] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:21:33] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 4 ms to minimize.
[2024-05-28 16:21:33] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:21:33] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 4 ms to minimize.
[2024-05-28 16:21:33] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 4 ms to minimize.
[2024-05-28 16:21:34] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 3 ms to minimize.
[2024-05-28 16:21:34] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:21:34] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 4 ms to minimize.
[2024-05-28 16:21:34] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 4 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2451 variables, 15/2971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2451 variables, 0/2971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/2451 variables, 0/2971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2451/2451 variables, and 2971 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5084 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 448/448 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 11/15 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1231/1246 variables, 444/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1246 variables, 1231/1694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1246 variables, 21/1715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:21:35] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1246 variables, 7/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1246 variables, 0/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1250 variables, 2/1724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1250 variables, 4/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1250 variables, 0/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1201/2451 variables, 1250/2978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2451 variables, 1/2979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:21:36] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:21:37] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:21:37] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:21:37] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:21:37] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:21:37] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:21:37] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:21:38] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:21:38] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:21:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2451 variables, 10/2989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2451 variables, 0/2989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2451 variables, 0/2989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2451/2451 variables, and 2989 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3048 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 448/448 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1250/1250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 38/38 constraints]
After SMT, in 8159ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2283 ms.
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 44 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:21:41] [INFO ] Invariant cache hit.
[2024-05-28 16:21:41] [INFO ] Implicit Places using invariants in 839 ms returned []
[2024-05-28 16:21:41] [INFO ] Invariant cache hit.
[2024-05-28 16:21:43] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2624 ms to find 0 implicit places.
[2024-05-28 16:21:43] [INFO ] Redundant transitions in 62 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:21:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 2/1251 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2451 variables, and 1251 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/448 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 2/1251 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 1/1250 variables, 448/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:22:38] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:22:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:22:40] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:22:41] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:22:41] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:22:41] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:22:41] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:22:41] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:22:42] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:22:42] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2451 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 448/448 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 60644ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63380 ms. Remains : 1250/1250 places, 1201/1201 transitions.
[2024-05-28 16:22:44] [INFO ] Flatten gal took : 75 ms
[2024-05-28 16:22:44] [INFO ] Flatten gal took : 63 ms
[2024-05-28 16:22:44] [INFO ] Input system was already deterministic with 1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 33 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:22:44] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:22:45] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-28 16:22:45] [INFO ] Invariant cache hit.
[2024-05-28 16:22:46] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:22:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30023 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-28 16:23:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:23:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:23:40] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:23:40] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:23:41] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:23:41] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:23:41] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:23:41] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:23:42] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:23:42] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:23:42] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:23:43] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:23:43] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:23:43] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60438ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Finished structural reductions in LTL mode , in 1 iterations and 62559 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:23:47] [INFO ] Flatten gal took : 57 ms
[2024-05-28 16:23:47] [INFO ] Flatten gal took : 60 ms
[2024-05-28 16:23:47] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:23:47] [INFO ] Flatten gal took : 57 ms
[2024-05-28 16:23:47] [INFO ] Flatten gal took : 58 ms
[2024-05-28 16:23:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1270132936321782751.gal : 32 ms
[2024-05-28 16:23:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7721637524823876023.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1270132936321782751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7721637524823876023.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:24:17] [INFO ] Flatten gal took : 56 ms
[2024-05-28 16:24:17] [INFO ] Applying decomposition
[2024-05-28 16:24:17] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph602218316909283921.txt' '-o' '/tmp/graph602218316909283921.bin' '-w' '/tmp/graph602218316909283921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph602218316909283921.bin' '-l' '-1' '-v' '-w' '/tmp/graph602218316909283921.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:24:18] [INFO ] Decomposing Gal with order
[2024-05-28 16:24:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:24:18] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:24:18] [INFO ] Flatten gal took : 142 ms
[2024-05-28 16:24:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 744 labels/synchronizations in 164 ms.
[2024-05-28 16:24:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3097407961306401343.gal : 21 ms
[2024-05-28 16:24:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8018677158314888895.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3097407961306401343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8018677158314888895.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:24:48] [INFO ] Invariant cache hit.
[2024-05-28 16:24:49] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-28 16:24:49] [INFO ] Invariant cache hit.
[2024-05-28 16:24:50] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:24:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:25:42] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:25:42] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:25:42] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:25:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-05-28 16:25:43] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:25:43] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:25:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:25:43] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-28 16:25:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:25:44] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:25:44] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:25:44] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:25:45] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:25:45] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:25:45] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:25:45] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 3 ms to minimize.
[2024-05-28 16:25:46] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-28 16:25:46] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:25:46] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:25:47] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:25:50] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:25:51] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1726 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30030 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 22/22 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60463ms
Finished structural reductions in LTL mode , in 1 iterations and 62482 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:25:51] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:25:51] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:25:51] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:25:51] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:25:51] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:25:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14867928485181059233.gal : 6 ms
[2024-05-28 16:25:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2027921945820552103.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14867928485181059233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2027921945820552103.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:26:21] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:26:21] [INFO ] Applying decomposition
[2024-05-28 16:26:21] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13680735686490991390.txt' '-o' '/tmp/graph13680735686490991390.bin' '-w' '/tmp/graph13680735686490991390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13680735686490991390.bin' '-l' '-1' '-v' '-w' '/tmp/graph13680735686490991390.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:26:21] [INFO ] Decomposing Gal with order
[2024-05-28 16:26:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:26:22] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:26:22] [INFO ] Flatten gal took : 71 ms
[2024-05-28 16:26:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 732 labels/synchronizations in 57 ms.
[2024-05-28 16:26:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7348925841258037200.gal : 14 ms
[2024-05-28 16:26:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7105915159103969657.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7348925841258037200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7105915159103969657.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:26:52] [INFO ] Invariant cache hit.
[2024-05-28 16:26:52] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-28 16:26:52] [INFO ] Invariant cache hit.
[2024-05-28 16:26:54] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:26:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:27:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:27:46] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:27:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:27:47] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:27:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:27:47] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:27:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:27:48] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:27:48] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:27:48] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:27:48] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:27:49] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:27:49] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:27:49] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:27:49] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:27:50] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:27:50] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:27:50] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:27:51] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:27:51] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Finished structural reductions in LTL mode , in 1 iterations and 62530 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:27:54] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:27:54] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:27:54] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:27:54] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:27:55] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:27:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17478832771661342487.gal : 6 ms
[2024-05-28 16:27:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6677430407786642120.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17478832771661342487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6677430407786642120.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:28:25] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:28:25] [INFO ] Applying decomposition
[2024-05-28 16:28:25] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6981800367937161168.txt' '-o' '/tmp/graph6981800367937161168.bin' '-w' '/tmp/graph6981800367937161168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6981800367937161168.bin' '-l' '-1' '-v' '-w' '/tmp/graph6981800367937161168.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:28:25] [INFO ] Decomposing Gal with order
[2024-05-28 16:28:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:28:25] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:28:25] [INFO ] Flatten gal took : 85 ms
[2024-05-28 16:28:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 760 labels/synchronizations in 55 ms.
[2024-05-28 16:28:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12700427900480313143.gal : 13 ms
[2024-05-28 16:28:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10350691343659915327.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12700427900480313143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10350691343659915327.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 88 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:28:55] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:28:56] [INFO ] Implicit Places using invariants in 694 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 705 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 828 ms. Remains : 1250/1253 places, 1201/1203 transitions.
[2024-05-28 16:28:56] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:28:56] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:28:56] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-28 16:28:56] [INFO ] Flatten gal took : 55 ms
[2024-05-28 16:28:56] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:28:56] [INFO ] Time to serialize gal into /tmp/CTLFireability4984181708163773481.gal : 6 ms
[2024-05-28 16:28:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17866092055579788409.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4984181708163773481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17866092055579788409.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:29:26] [INFO ] Flatten gal took : 57 ms
[2024-05-28 16:29:26] [INFO ] Applying decomposition
[2024-05-28 16:29:26] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11459709048552224649.txt' '-o' '/tmp/graph11459709048552224649.bin' '-w' '/tmp/graph11459709048552224649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11459709048552224649.bin' '-l' '-1' '-v' '-w' '/tmp/graph11459709048552224649.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:29:27] [INFO ] Decomposing Gal with order
[2024-05-28 16:29:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:29:27] [INFO ] Removed a total of 797 redundant transitions.
[2024-05-28 16:29:27] [INFO ] Flatten gal took : 62 ms
[2024-05-28 16:29:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 756 labels/synchronizations in 52 ms.
[2024-05-28 16:29:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16641646552041766386.gal : 13 ms
[2024-05-28 16:29:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17263103911633010237.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16641646552041766386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17263103911633010237.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:29:57] [INFO ] Computed 451 invariants in 11 ms
[2024-05-28 16:29:57] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-05-28 16:29:57] [INFO ] Invariant cache hit.
[2024-05-28 16:29:59] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:29:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:30:51] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:30:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:30:51] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:30:51] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:30:52] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:30:52] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:30:52] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:30:52] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:30:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:30:53] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:30:53] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:30:53] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:30:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 3 ms to minimize.
[2024-05-28 16:30:54] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:30:54] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:30:54] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:30:59] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-05-28 16:30:59] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 1)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 1)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 0)
(s566 1)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 0)
(s576 1)
(s577 0)
(s578 1)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 1)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 1)
(s603 1)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 1)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 1)
(s628 1)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 1)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 0)
(s646 1)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 1)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 1)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 1)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 1)
(s741 0)
(s742 0)
(s743 1)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 1)
(s753 1)
(s754 0)
(s755 1)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 1)
(s766 0)
(s767 0)
(s768 1)
(s769 0)
(s770 0)
(s771 1)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 1)
(s779 0)
(s780 1)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 1)
(s787 0)
(s788 1)
(s789 0)
(s790 1)
(s791 0)
(s792 0)
(s793 1)
(s794 0)
(s795 0)
(s796 1)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 1)
(s803 1)
(s804 0)
(s805 1)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 1)
(s812 0)
(s813 1)
(s814 0)
(s815 1)
(s816 0)
(s817 0)
(s818 1)
(s819 0)
(s820 0)
(s821 1)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 1)
(s828 1)
(s829 0)
(s830 1)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 1)
(s837 0)
(s838 1)
(s839 0)
(s840 1)
(s841 0)
(s842 0)
(s843 1)
(s844 0)
(s845 0)
(s846 1)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 1)
(s853 1)
(s854 0)
(s855 1)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 1)
(s862 0)
(s863 1)
(s864 0)
(s865 1)
(s866 0)
(s867 0)
(s868 1)
(s869 0)
(s870 0)
(s871 1)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 1)
(s878 1)
(s879 0)
(s880 1)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 1)
(s887 0)
(s888 1)
(s889 0)
(s890 1)
(s891 0)
(s892 0)
(s893 1)
(s894 0)
(s895 0)
(s896 1)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 1)
(s903 1)
(s904 0)
(s905 1)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 1)
(s912 0)
(s913 1)
(s914 0)
(s915 1)
(s916 0)
(s917 0)
(s918 1)
(s919 0)
(s920 0)
(s921 1)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 1)
(s928 1)
(s929 0)
(s930 1)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 1)
(s937 0)
(s938 1)
(s939 0)
(s940 1)
(s941 0)
(s942 0)
(s943 1)
(s944 0)
(s945 0)
(s946 1)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 1)
(s953 1)
(s954 0)
(s955 1)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 1)
(s962 0)
(s963 1)
(s964 0)
(s965 1)
(s966 0)
(s967 0)
(s968 1)
(s969 0)
(s970 0)
(s971 1)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 1)
(s978 1)
(s979 0)
(s980 1)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 1)
(s987 0)
(s988 1)
(s989 0)
(s990 1)
(s991 0)
(s992 0)
(s993 1)
(s994 0)
(s995 0)
(s996 1)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 1)
(s1003 1)
(s1004 0)
(s1005 1)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 1)
(s1012 0)
(s1013 1)
(s1014 0)
(s1015 1)
(s1016 0)
(s1017 0)
(s1018 1)
(s1019 0)
(s1020 0)
(s1021 1)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 1)
(s1028 1)
(s1029 0)
(s1030 1)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 1)
(s1037 0)
(s1038 1)
(s1039 0)
(s1040 1)
(s1041 0)
(s1042 0)
(s1043 1)
(s1044 0)
(s1045 0)
(s1046 1)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 1)
(s1053 1)
(s1054 0)
(s1055 1)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 1)
(s1062 0)
(s1063 1)
(s1064 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1726 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30019 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 22/22 constraints]
After SMT, in 60493ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Finished structural reductions in LTL mode , in 1 iterations and 62510 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:30:59] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:30:59] [INFO ] Flatten gal took : 68 ms
[2024-05-28 16:31:00] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:31:00] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:31:00] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:31:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10352202294350251424.gal : 6 ms
[2024-05-28 16:31:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6756769297627666710.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10352202294350251424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6756769297627666710.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:31:30] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:31:30] [INFO ] Applying decomposition
[2024-05-28 16:31:30] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7897538538129468790.txt' '-o' '/tmp/graph7897538538129468790.bin' '-w' '/tmp/graph7897538538129468790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7897538538129468790.bin' '-l' '-1' '-v' '-w' '/tmp/graph7897538538129468790.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:31:30] [INFO ] Decomposing Gal with order
[2024-05-28 16:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:31:30] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:31:30] [INFO ] Flatten gal took : 61 ms
[2024-05-28 16:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 31 ms.
[2024-05-28 16:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10502777673027382770.gal : 10 ms
[2024-05-28 16:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11719853405957377383.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10502777673027382770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11719853405957377383.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:32:00] [INFO ] Invariant cache hit.
[2024-05-28 16:32:01] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-28 16:32:01] [INFO ] Invariant cache hit.
[2024-05-28 16:32:02] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:32:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:32:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:32:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:32:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:32:55] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:32:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:32:55] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:32:55] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:32:55] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:32:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:32:56] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:32:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:32:56] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:32:57] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:32:57] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:32:57] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:32:57] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:32:58] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:32:58] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:32:58] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:32:59] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:33:02] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:33:03] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 60468ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Finished structural reductions in LTL mode , in 1 iterations and 62440 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:33:03] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:33:03] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:33:03] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:33:03] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:33:03] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:33:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5932727166992809311.gal : 6 ms
[2024-05-28 16:33:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14033040096773593982.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5932727166992809311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14033040096773593982.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:33:33] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:33:33] [INFO ] Applying decomposition
[2024-05-28 16:33:33] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph666011268627037082.txt' '-o' '/tmp/graph666011268627037082.bin' '-w' '/tmp/graph666011268627037082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph666011268627037082.bin' '-l' '-1' '-v' '-w' '/tmp/graph666011268627037082.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:33:33] [INFO ] Decomposing Gal with order
[2024-05-28 16:33:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:33:33] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:33:33] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 756 labels/synchronizations in 80 ms.
[2024-05-28 16:33:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6103793866230723594.gal : 10 ms
[2024-05-28 16:33:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15053762457860487503.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6103793866230723594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15053762457860487503.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:34:03] [INFO ] Invariant cache hit.
[2024-05-28 16:34:04] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-05-28 16:34:04] [INFO ] Invariant cache hit.
[2024-05-28 16:34:05] [INFO ] Implicit Places using invariants and state equation in 1357 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:34:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30020 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:34:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:34:58] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:34:59] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:35:00] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:35:01] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:35:01] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:35:01] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:35:02] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:35:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:35:06] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:35:06] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 60435ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Finished structural reductions in LTL mode , in 1 iterations and 62453 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:35:06] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:35:06] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:35:06] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:35:06] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:35:06] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:35:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4962680025162466481.gal : 6 ms
[2024-05-28 16:35:06] [INFO ] Time to serialize properties into /tmp/CTLFireability128534511681195778.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4962680025162466481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability128534511681195778.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:35:36] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:35:36] [INFO ] Applying decomposition
[2024-05-28 16:35:36] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15570487058194604119.txt' '-o' '/tmp/graph15570487058194604119.bin' '-w' '/tmp/graph15570487058194604119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15570487058194604119.bin' '-l' '-1' '-v' '-w' '/tmp/graph15570487058194604119.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:35:36] [INFO ] Decomposing Gal with order
[2024-05-28 16:35:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:35:37] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:35:37] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:35:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 776 labels/synchronizations in 52 ms.
[2024-05-28 16:35:37] [INFO ] Time to serialize gal into /tmp/CTLFireability18090812483172868105.gal : 12 ms
[2024-05-28 16:35:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2016866059254475075.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18090812483172868105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2016866059254475075.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:36:07] [INFO ] Invariant cache hit.
[2024-05-28 16:36:07] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-28 16:36:07] [INFO ] Invariant cache hit.
[2024-05-28 16:36:09] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 2000 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30018 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:37:00] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:37:01] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:37:02] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:37:02] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:37:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:37:02] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:37:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:37:03] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:37:03] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:37:03] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:37:03] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:37:04] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:37:04] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:37:04] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:37:05] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:37:05] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:37:09] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:37:09] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-28 16:37:09] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
SMT process timed out in 60449ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Finished structural reductions in LTL mode , in 1 iterations and 62480 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:37:09] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:37:09] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:37:09] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:37:09] [INFO ] Flatten gal took : 72 ms
[2024-05-28 16:37:09] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:37:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12831729383172070858.gal : 6 ms
[2024-05-28 16:37:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5460647290009429152.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12831729383172070858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5460647290009429152.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:37:40] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:37:40] [INFO ] Applying decomposition
[2024-05-28 16:37:40] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15050095216846530974.txt' '-o' '/tmp/graph15050095216846530974.bin' '-w' '/tmp/graph15050095216846530974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15050095216846530974.bin' '-l' '-1' '-v' '-w' '/tmp/graph15050095216846530974.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:37:40] [INFO ] Decomposing Gal with order
[2024-05-28 16:37:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:37:40] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:37:40] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 736 labels/synchronizations in 49 ms.
[2024-05-28 16:37:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12573641950170123401.gal : 11 ms
[2024-05-28 16:37:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7439924333609946527.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12573641950170123401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7439924333609946527.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:38:10] [INFO ] Invariant cache hit.
[2024-05-28 16:38:11] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-28 16:38:11] [INFO ] Invariant cache hit.
[2024-05-28 16:38:12] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:38:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:39:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-28 16:39:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:39:06] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:39:06] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:39:06] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:39:06] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:39:07] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:39:07] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:39:07] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:39:07] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:39:08] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:39:08] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:39:08] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:39:12] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:39:12] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1726 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30032 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 22/22 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in LTL mode , in 1 iterations and 62425 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:39:12] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:39:12] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:39:13] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:39:13] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:39:13] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:39:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16874304780279758234.gal : 6 ms
[2024-05-28 16:39:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5104534753728362096.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16874304780279758234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5104534753728362096.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:39:43] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:39:43] [INFO ] Applying decomposition
[2024-05-28 16:39:43] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8131868787692429984.txt' '-o' '/tmp/graph8131868787692429984.bin' '-w' '/tmp/graph8131868787692429984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8131868787692429984.bin' '-l' '-1' '-v' '-w' '/tmp/graph8131868787692429984.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:39:43] [INFO ] Decomposing Gal with order
[2024-05-28 16:39:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:39:43] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:39:43] [INFO ] Flatten gal took : 57 ms
[2024-05-28 16:39:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 752 labels/synchronizations in 44 ms.
[2024-05-28 16:39:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8667833885689342604.gal : 9 ms
[2024-05-28 16:39:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5794443757366349969.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8667833885689342604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5794443757366349969.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:40:13] [INFO ] Invariant cache hit.
[2024-05-28 16:40:14] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-28 16:40:14] [INFO ] Invariant cache hit.
[2024-05-28 16:40:15] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:40:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:41:07] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:41:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:41:07] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:41:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:41:09] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:41:09] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:41:09] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:41:09] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:41:10] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:41:10] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:41:10] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:41:10] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:41:11] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:41:11] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:41:11] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:41:12] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 21/21 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in LTL mode , in 1 iterations and 62462 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:41:16] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:41:16] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:41:16] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:41:16] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:41:16] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1791902361594724987.gal : 6 ms
[2024-05-28 16:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17136054922295931729.ctl : 61 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1791902361594724987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17136054922295931729.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:41:46] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:41:46] [INFO ] Applying decomposition
[2024-05-28 16:41:46] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3661214551133495501.txt' '-o' '/tmp/graph3661214551133495501.bin' '-w' '/tmp/graph3661214551133495501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3661214551133495501.bin' '-l' '-1' '-v' '-w' '/tmp/graph3661214551133495501.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:41:46] [INFO ] Decomposing Gal with order
[2024-05-28 16:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:41:46] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:41:46] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 740 labels/synchronizations in 46 ms.
[2024-05-28 16:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9257323808156906793.gal : 11 ms
[2024-05-28 16:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability5164818077172076479.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9257323808156906793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5164818077172076479.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:42:16] [INFO ] Invariant cache hit.
[2024-05-28 16:42:17] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-28 16:42:17] [INFO ] Invariant cache hit.
[2024-05-28 16:42:19] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:42:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 16:43:13] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:43:14] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:43:14] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:43:14] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:43:15] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:43:15] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:43:15] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:43:19] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 21/21 constraints]
After SMT, in 60368ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in LTL mode , in 1 iterations and 62502 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:43:19] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:43:19] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:43:19] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:43:19] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:43:19] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13194713095170379396.gal : 6 ms
[2024-05-28 16:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7310986460204507114.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13194713095170379396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7310986460204507114.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:43:49] [INFO ] Flatten gal took : 64 ms
[2024-05-28 16:43:49] [INFO ] Applying decomposition
[2024-05-28 16:43:49] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6772524250593075247.txt' '-o' '/tmp/graph6772524250593075247.bin' '-w' '/tmp/graph6772524250593075247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6772524250593075247.bin' '-l' '-1' '-v' '-w' '/tmp/graph6772524250593075247.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:43:49] [INFO ] Decomposing Gal with order
[2024-05-28 16:43:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:43:50] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:43:50] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 28 ms.
[2024-05-28 16:43:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3330483055833213610.gal : 8 ms
[2024-05-28 16:43:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1097513649531907079.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3330483055833213610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1097513649531907079.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:44:20] [INFO ] Invariant cache hit.
[2024-05-28 16:44:20] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-28 16:44:20] [INFO ] Invariant cache hit.
[2024-05-28 16:44:22] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:44:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:45:14] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:45:14] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:45:14] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:45:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:45:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:45:15] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:45:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:45:15] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:45:15] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:45:15] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:45:16] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:45:16] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:45:16] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:45:16] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:45:22] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:45:22] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1726 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 22/22 constraints]
After SMT, in 60363ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Finished structural reductions in LTL mode , in 1 iterations and 62443 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:45:22] [INFO ] Flatten gal took : 55 ms
[2024-05-28 16:45:22] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:45:22] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:45:22] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:45:22] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15531536887117595156.gal : 5 ms
[2024-05-28 16:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7597842936845467967.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15531536887117595156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7597842936845467967.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:45:53] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:45:53] [INFO ] Applying decomposition
[2024-05-28 16:45:53] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8202814043239249662.txt' '-o' '/tmp/graph8202814043239249662.bin' '-w' '/tmp/graph8202814043239249662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8202814043239249662.bin' '-l' '-1' '-v' '-w' '/tmp/graph8202814043239249662.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:45:53] [INFO ] Decomposing Gal with order
[2024-05-28 16:45:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:45:53] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:45:53] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:45:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 752 labels/synchronizations in 45 ms.
[2024-05-28 16:45:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18288377329977086024.gal : 10 ms
[2024-05-28 16:45:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12080963843593200536.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18288377329977086024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12080963843593200536.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 88 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:46:23] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:46:24] [INFO ] Implicit Places using invariants in 674 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 675 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 45 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 808 ms. Remains : 1250/1253 places, 1201/1203 transitions.
[2024-05-28 16:46:24] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:46:24] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:46:24] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-28 16:46:24] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:46:24] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:46:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6129065374215776942.gal : 5 ms
[2024-05-28 16:46:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5427975799649328492.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6129065374215776942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5427975799649328492.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:46:54] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:46:54] [INFO ] Applying decomposition
[2024-05-28 16:46:54] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11105452951402161475.txt' '-o' '/tmp/graph11105452951402161475.bin' '-w' '/tmp/graph11105452951402161475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11105452951402161475.bin' '-l' '-1' '-v' '-w' '/tmp/graph11105452951402161475.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:46:54] [INFO ] Decomposing Gal with order
[2024-05-28 16:46:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:46:54] [INFO ] Removed a total of 797 redundant transitions.
[2024-05-28 16:46:54] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:46:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 732 labels/synchronizations in 45 ms.
[2024-05-28 16:46:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9762258250508612731.gal : 11 ms
[2024-05-28 16:46:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15909693463177161497.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9762258250508612731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15909693463177161497.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:47:25] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:47:25] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-28 16:47:25] [INFO ] Invariant cache hit.
[2024-05-28 16:47:26] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:47:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30017 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:48:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:48:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:48:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:48:21] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:48:23] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:48:26] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:48:27] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:48:27] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 60460ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Finished structural reductions in LTL mode , in 1 iterations and 62419 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:48:27] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:48:27] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:48:27] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:48:27] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:48:27] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:48:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5893042403215170803.gal : 5 ms
[2024-05-28 16:48:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6072098121998264710.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5893042403215170803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6072098121998264710.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:48:57] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:48:57] [INFO ] Applying decomposition
[2024-05-28 16:48:57] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7672499771330789241.txt' '-o' '/tmp/graph7672499771330789241.bin' '-w' '/tmp/graph7672499771330789241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7672499771330789241.bin' '-l' '-1' '-v' '-w' '/tmp/graph7672499771330789241.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:48:57] [INFO ] Decomposing Gal with order
[2024-05-28 16:48:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:48:58] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:48:58] [INFO ] Flatten gal took : 61 ms
[2024-05-28 16:48:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 740 labels/synchronizations in 45 ms.
[2024-05-28 16:48:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14311276517658931580.gal : 10 ms
[2024-05-28 16:48:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17861314019510664209.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14311276517658931580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17861314019510664209.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 65 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:49:28] [INFO ] Computed 451 invariants in 3 ms
[2024-05-28 16:49:28] [INFO ] Implicit Places using invariants in 615 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 616 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 26 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 708 ms. Remains : 1250/1253 places, 1201/1203 transitions.
[2024-05-28 16:49:28] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:49:29] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:49:29] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-28 16:49:29] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:49:29] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:49:29] [INFO ] Time to serialize gal into /tmp/CTLFireability611041983541057751.gal : 5 ms
[2024-05-28 16:49:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12030611265785805718.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability611041983541057751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12030611265785805718.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:49:59] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:49:59] [INFO ] Applying decomposition
[2024-05-28 16:49:59] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph458967817196706844.txt' '-o' '/tmp/graph458967817196706844.bin' '-w' '/tmp/graph458967817196706844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph458967817196706844.bin' '-l' '-1' '-v' '-w' '/tmp/graph458967817196706844.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:49:59] [INFO ] Decomposing Gal with order
[2024-05-28 16:49:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:49:59] [INFO ] Removed a total of 797 redundant transitions.
[2024-05-28 16:49:59] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:49:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 28 ms.
[2024-05-28 16:49:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5670598243589689353.gal : 8 ms
[2024-05-28 16:49:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14702965719993514194.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5670598243589689353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14702965719993514194.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 33 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:50:29] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:50:30] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-28 16:50:30] [INFO ] Invariant cache hit.
[2024-05-28 16:50:31] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:50:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:51:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:51:23] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:51:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:51:23] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:51:24] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:51:24] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:51:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:51:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:51:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:51:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:51:25] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:51:25] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:51:25] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:51:26] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:51:27] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:51:27] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:51:27] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:51:31] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-28 16:51:31] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:51:32] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1727 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30016 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 23/23 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60443ms
Finished structural reductions in LTL mode , in 1 iterations and 62400 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-05-28 16:51:32] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:51:32] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:51:32] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 16:51:32] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:51:32] [INFO ] Flatten gal took : 45 ms
[2024-05-28 16:51:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2231862891422736936.gal : 6 ms
[2024-05-28 16:51:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15041317956460739861.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2231862891422736936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15041317956460739861.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:52:02] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:52:02] [INFO ] Applying decomposition
[2024-05-28 16:52:02] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1444782256018544003.txt' '-o' '/tmp/graph1444782256018544003.bin' '-w' '/tmp/graph1444782256018544003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1444782256018544003.bin' '-l' '-1' '-v' '-w' '/tmp/graph1444782256018544003.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:52:02] [INFO ] Decomposing Gal with order
[2024-05-28 16:52:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:52:02] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:52:02] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:52:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 768 labels/synchronizations in 46 ms.
[2024-05-28 16:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4508461400244349597.gal : 11 ms
[2024-05-28 16:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12314105089266804550.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4508461400244349597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12314105089266804550.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:52:32] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:52:32] [INFO ] Flatten gal took : 55 ms
[2024-05-28 16:52:33] [INFO ] Applying decomposition
[2024-05-28 16:52:33] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9991078919626356891.txt' '-o' '/tmp/graph9991078919626356891.bin' '-w' '/tmp/graph9991078919626356891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9991078919626356891.bin' '-l' '-1' '-v' '-w' '/tmp/graph9991078919626356891.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:52:33] [INFO ] Decomposing Gal with order
[2024-05-28 16:52:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:52:33] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:52:33] [INFO ] Flatten gal took : 51 ms
[2024-05-28 16:52:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 748 labels/synchronizations in 44 ms.
[2024-05-28 16:52:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4009413541651671884.gal : 10 ms
[2024-05-28 16:52:33] [INFO ] Time to serialize properties into /tmp/CTLFireability17234007482431834704.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4009413541651671884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17234007482431834704.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 17:08:53] [INFO ] Applying decomposition
[2024-05-28 17:08:53] [INFO ] Flatten gal took : 49 ms
[2024-05-28 17:08:53] [INFO ] Decomposing Gal with order
[2024-05-28 17:08:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:08:53] [INFO ] Removed a total of 850 redundant transitions.
[2024-05-28 17:08:53] [INFO ] Flatten gal took : 55 ms
[2024-05-28 17:08:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 52 ms.
[2024-05-28 17:08:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4164105916740793859.gal : 7 ms
[2024-05-28 17:08:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8424594299918061338.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4164105916740793859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8424594299918061338.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 17:15:27] [INFO ] Flatten gal took : 50 ms
[2024-05-28 17:15:27] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-28 17:15:27] [INFO ] Transformed 1253 places.
[2024-05-28 17:15:27] [INFO ] Transformed 1203 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-28 17:15:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4504373937893643914.gal : 11 ms
[2024-05-28 17:15:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11714180831418945431.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4504373937893643914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11714180831418945431.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ShieldIIPs-PT-050A"
export BK_EXAMINATION="CTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-050A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760500146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;