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.r476-tall-171620505100098.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 ltsminxred
Input is CANInsertWithFailure-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K 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 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K May 18 16:42 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 CANInsertWithFailure-PT-010-CTLFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2023-12
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2023-13
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2023-14
FORMULA_NAME CANInsertWithFailure-PT-010-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717186090201

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:08:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:08:11] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-31 20:08:11] [INFO ] Transformed 324 places.
[2024-05-31 20:08:11] [INFO ] Transformed 660 transitions.
[2024-05-31 20:08:11] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 98 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 35 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-31 20:08:11] [INFO ] Computed 12 invariants in 31 ms
[2024-05-31 20:08:11] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-31 20:08:11] [INFO ] Invariant cache hit.
[2024-05-31 20:08:12] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-31 20:08:12] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-31 20:08:12] [INFO ] Invariant cache hit.
[2024-05-31 20:08:12] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 11 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 3 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 2 ms to minimize.
[2024-05-31 20:08:17] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 6 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:08:18] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:08:19] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:08:20] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:08:21] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:25] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:08:25] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:08:25] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:08:25] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:08:26] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:29] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 3 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:08:30] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:31] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:08:33] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:34] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 2 ms to minimize.
[2024-05-31 20:08:34] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:08:34] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-31 20:08:34] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:08:35] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:08:36] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:41] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:08:41] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:08:41] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:42] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:08:42] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:08:42] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:08:42] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 5.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 119 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 107/107 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 107/119 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:44] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:08:44] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:08:44] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:08:44] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:08:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:08:45] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:08:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:08:45] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:08:47] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:08:47] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:08:47] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:08:47] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:08:47] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:50] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:08:50] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:08:51] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:08:52] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:08:52] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:08:53] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:08:53] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:08:57] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-31 20:09:01] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:01] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:09:01] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:09:01] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:09:01] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:09:02] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:09:03] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 9/150 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 660/982 variables, 322/472 constraints. Problems are: Problem set: 0 solved, 650 unsolved
SMT process timed out in 60277ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61062 ms. Remains : 323/324 places, 660/660 transitions.
Support contains 98 out of 323 places after structural reductions.
[2024-05-31 20:09:13] [INFO ] Flatten gal took : 71 ms
[2024-05-31 20:09:13] [INFO ] Flatten gal took : 52 ms
[2024-05-31 20:09:13] [INFO ] Input system was already deterministic with 660 transitions.
RANDOM walk for 40000 steps (180 resets) in 1728 ms. (23 steps per ms) remains 7/69 properties
BEST_FIRST walk for 40003 steps (19 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (18 resets) in 36 ms. (1081 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (18 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (21 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (24 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
[2024-05-31 20:09:14] [INFO ] Invariant cache hit.
[2024-05-31 20:09:14] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 293/316 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:09:14] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/320 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/322 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 660/982 variables, 322/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp46 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 190/525 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 0/525 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/983 variables, 1/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/983 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 526 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 296/309 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:09:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 8/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/319 variables, 5/19 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/342 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/532 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 4/536 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/536 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/983 variables, 2/538 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/983 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 538 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1722 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 2869ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 951 ms.
Support contains 13 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 323 transition count 595
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 258 transition count 595
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 130 place count 258 transition count 594
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 257 transition count 594
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 302 place count 172 transition count 509
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 2 with 68 rules applied. Total rules applied 370 place count 172 transition count 441
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 375 place count 172 transition count 436
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 380 place count 167 transition count 436
Partial Free-agglomeration rule applied 108 times.
Drop transitions (Partial Free agglomeration) removed 108 transitions
Iterating global reduction 3 with 108 rules applied. Total rules applied 488 place count 167 transition count 436
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 498 place count 167 transition count 436
Applied a total of 498 rules in 100 ms. Remains 167 /323 variables (removed 156) and now considering 436/660 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 167/323 places, 436/660 transitions.
RANDOM walk for 40000 steps (772 resets) in 436 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (73 resets) in 127 ms. (312 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (67 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (63 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
// Phase 1: matrix 436 rows 167 cols
[2024-05-31 20:09:18] [INFO ] Computed 12 invariants in 6 ms
[2024-05-31 20:09:18] [INFO ] State equation strengthened by 390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:09:18] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/165 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 436/601 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 390/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/603 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/603 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 570 constraints, problems are : Problem set: 0 solved, 3 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 167/167 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:09:18] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:09:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:09:18] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:09:18] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 9 ms to minimize.
[2024-05-31 20:09:18] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:09:19] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:09:19] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:09:19] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/164 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/165 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 436/601 variables, 165/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 390/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/603 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/603 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 581 constraints, problems are : Problem set: 0 solved, 3 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 167/167 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1458ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 11 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 436/436 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 165 transition count 434
Applied a total of 4 rules in 12 ms. Remains 165 /167 variables (removed 2) and now considering 434/436 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 165/167 places, 434/436 transitions.
RANDOM walk for 40000 steps (775 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (70 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (64 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 928055 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 3
Probabilistic random walk after 928055 steps, saw 123068 distinct states, run finished after 3009 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 434 rows 165 cols
[2024-05-31 20:09:23] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 20:09:23] [INFO ] State equation strengthened by 394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:09:23] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/162 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 434/597 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 394/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/599 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/599 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/599 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 572 constraints, problems are : Problem set: 0 solved, 3 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/162 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 434/597 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 394/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/599 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/599 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 575 constraints, problems are : Problem set: 0 solved, 3 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1138ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 165 /165 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 165/165 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-31 20:09:24] [INFO ] Invariant cache hit.
[2024-05-31 20:09:24] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 20:09:24] [INFO ] Invariant cache hit.
[2024-05-31 20:09:24] [INFO ] State equation strengthened by 394 read => feed constraints.
[2024-05-31 20:09:24] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-31 20:09:24] [INFO ] Redundant transitions in 24 ms returned []
Running 424 sub problems to find dead transitions.
[2024-05-31 20:09:24] [INFO ] Invariant cache hit.
[2024-05-31 20:09:24] [INFO ] State equation strengthened by 394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
[2024-05-31 20:09:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:09:27] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:09:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:09:29] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:09:29] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:09:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:09:29] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:29] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:30] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:30] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-31 20:09:30] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:30] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:32] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:33] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:09:33] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:09:33] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:09:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:09:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:09:33] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:09:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 4 ms to minimize.
[2024-05-31 20:09:34] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:36] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:09:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:38] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:09:38] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:09:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:38] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:09:38] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:09:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:39] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:09:39] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:39] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:09:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:09:39] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:09:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:09:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:41] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:09:41] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:09:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:09:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:09:42] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:45] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:09:46] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:09:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:09:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:09:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:09:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-31 20:09:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:09:46] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:47] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-31 20:09:48] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:09:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:09:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-31 20:09:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 13 (OVERLAPS) 434/598 variables, 164/321 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/598 variables, 394/715 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/599 variables, and 715 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 145/145 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:57] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:09:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:10:01] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:10:01] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-31 20:10:01] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:10:02] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:10:02] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:10:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:10:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-31 20:10:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-31 20:10:05] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 9 (OVERLAPS) 434/598 variables, 164/332 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD427 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 394/726 constraints. Problems are: Problem set: 11 solved, 413 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 413/1139 constraints. Problems are: Problem set: 11 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 1139 constraints, problems are : Problem set: 11 solved, 413 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 413/424 constraints, Known Traps: 156/156 constraints]
After SMT, in 60194ms problems are : Problem set: 11 solved, 413 unsolved
Search for dead transitions found 11 dead transitions in 60199ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 165/165 places, 423/434 transitions.
Graph (complete) has 731 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 156 transition count 407
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 156 transition count 407
Applied a total of 17 rules in 21 ms. Remains 156 /165 variables (removed 9) and now considering 407/423 (removed 16) transitions.
// Phase 1: matrix 407 rows 156 cols
[2024-05-31 20:10:25] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 20:10:25] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 20:10:25] [INFO ] Invariant cache hit.
[2024-05-31 20:10:25] [INFO ] State equation strengthened by 375 read => feed constraints.
[2024-05-31 20:10:25] [INFO ] Implicit Places using invariants and state equation in 623 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 737 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/165 places, 407/434 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 405
Applied a total of 4 rules in 12 ms. Remains 153 /155 variables (removed 2) and now considering 405/407 (removed 2) transitions.
// Phase 1: matrix 405 rows 153 cols
[2024-05-31 20:10:25] [INFO ] Computed 10 invariants in 4 ms
[2024-05-31 20:10:25] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 20:10:25] [INFO ] Invariant cache hit.
[2024-05-31 20:10:25] [INFO ] State equation strengthened by 366 read => feed constraints.
[2024-05-31 20:10:26] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 153/165 places, 405/434 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62162 ms. Remains : 153/165 places, 405/434 transitions.
RANDOM walk for 40000 steps (785 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (66 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1034377 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 3
Probabilistic random walk after 1034377 steps, saw 136919 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
[2024-05-31 20:10:29] [INFO ] Invariant cache hit.
[2024-05-31 20:10:29] [INFO ] State equation strengthened by 366 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:10:29] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/37 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 81/118 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 51/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 334/452 variables, 45/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 280/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 106/558 variables, 71/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 35/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/558 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 530 constraints, problems are : Problem set: 0 solved, 3 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/37 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 81/118 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 51/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 334/452 variables, 45/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 280/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 106/558 variables, 71/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 35/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/558 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 533 constraints, problems are : Problem set: 0 solved, 3 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 11 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 405/405 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 153/153 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 405/405 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-31 20:10:30] [INFO ] Invariant cache hit.
[2024-05-31 20:10:30] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 20:10:30] [INFO ] Invariant cache hit.
[2024-05-31 20:10:30] [INFO ] State equation strengthened by 366 read => feed constraints.
[2024-05-31 20:10:30] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2024-05-31 20:10:30] [INFO ] Redundant transitions in 13 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-31 20:10:30] [INFO ] Invariant cache hit.
[2024-05-31 20:10:30] [INFO ] State equation strengthened by 366 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/557 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 366/528 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/558 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/558 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 529 constraints, problems are : Problem set: 0 solved, 395 unsolved in 28717 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/557 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 366/528 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 395/923 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/558 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 924 constraints, problems are : Problem set: 0 solved, 395 unsolved in 25606 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54398ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 54401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54962 ms. Remains : 153/153 places, 405/405 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 24 ms
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 41 ms
[2024-05-31 20:11:25] [INFO ] Input system was already deterministic with 660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 158 place count 244 transition count 581
Applied a total of 158 rules in 23 ms. Remains 244 /323 variables (removed 79) and now considering 581/660 (removed 79) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 244/323 places, 581/660 transitions.
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:11:25] [INFO ] Input system was already deterministic with 581 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 33 ms
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 21 ms
[2024-05-31 20:11:25] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 243 transition count 580
Applied a total of 160 rules in 36 ms. Remains 243 /323 variables (removed 80) and now considering 580/660 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 243/323 places, 580/660 transitions.
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 20 ms
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:11:25] [INFO ] Input system was already deterministic with 580 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 323 transition count 598
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 126 place count 261 transition count 596
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 259 transition count 596
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 128 place count 259 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 258 transition count 595
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 144 place count 251 transition count 588
Applied a total of 144 rules in 43 ms. Remains 251 /323 variables (removed 72) and now considering 588/660 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 251/323 places, 588/660 transitions.
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:11:25] [INFO ] Input system was already deterministic with 588 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:11:25] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 158 place count 244 transition count 581
Applied a total of 158 rules in 16 ms. Remains 244 /323 variables (removed 79) and now considering 581/660 (removed 79) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 244/323 places, 581/660 transitions.
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:11:25] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:11:25] [INFO ] Input system was already deterministic with 581 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 25 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 323 transition count 603
Reduce places removed 57 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 67 rules applied. Total rules applied 124 place count 266 transition count 593
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 134 place count 256 transition count 593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 134 place count 256 transition count 592
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 154 place count 246 transition count 583
Applied a total of 154 rules in 19 ms. Remains 246 /323 variables (removed 77) and now considering 583/660 (removed 77) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 246/323 places, 583/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 583 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 243 transition count 580
Applied a total of 160 rules in 15 ms. Remains 243 /323 variables (removed 80) and now considering 580/660 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 243/323 places, 580/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 580 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 31 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 256 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 156 place count 245 transition count 582
Applied a total of 156 rules in 17 ms. Remains 245 /323 variables (removed 78) and now considering 582/660 (removed 78) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 245/323 places, 582/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 24 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:11:26] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:11:26] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:11:26] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-05-31 20:11:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 323 places, 660 transitions and 1780 arcs took 14 ms.
Total runtime 195522 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-00
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-05
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-07
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2024-11
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2023-12
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2023-14
Could not compute solution for formula : CANInsertWithFailure-PT-010-CTLFireability-2023-15

BK_STOP 1717186287225

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1594/ctl_0_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1594/ctl_1_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1594/ctl_2_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1594/ctl_3_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1594/ctl_4_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1594/ctl_5_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1594/ctl_6_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1594/ctl_7_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1594/ctl_8_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1594/ctl_9_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1594/ctl_10_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1594/ctl_11_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1594/ctl_12_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1594/ctl_13_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1594/ctl_14_
ctl formula name CANInsertWithFailure-PT-010-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1594/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CANInsertWithFailure-PT-010, 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 r476-tall-171620505100098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;