fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446400109
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16204.531 2891392.00 3371895.00 1308.20 0 0 1 1 8 1 1 10 1 ? 10 2 2 8 ? 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446400109.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716906612248

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 14:30:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 14:30:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:30:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 14:30:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:30:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 961 ms
[2024-05-28 14:30:14] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 48 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
[2024-05-28 14:30:14] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 8 ms.
[2024-05-28 14:30:14] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:30:15] [INFO ] Computed 26 invariants in 15 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 0, 0, 10, 0, 0, 0, 0, 0] Max Struct:[4, 3, 1, 1, 8, 1, 8, 11, 2, 28, 20, 2, 2, 8, 4, 2]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 14:30:15] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:30:15] [INFO ] Computed 26 invariants in 9 ms
[2024-05-28 14:30:15] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-28 14:30:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 21 ms returned sat
[2024-05-28 14:30:15] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-28 14:30:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-05-28 14:30:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-28 14:30:15] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 14:30:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 14:30:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:30:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-28 14:30:15] [INFO ] Added : 44 causal constraints over 10 iterations in 198 ms. Result :sat
Minimization took 49 ms.
[2024-05-28 14:30:15] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2024-05-28 14:30:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 19 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-28 14:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-05-28 14:30:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-28 14:30:16] [INFO ] Added : 54 causal constraints over 12 iterations in 194 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 14:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-28 14:30:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 14:30:16] [INFO ] Added : 10 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 14:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 14:30:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:30:16] [INFO ] Added : 54 causal constraints over 11 iterations in 59 ms. Result :sat
Minimization took 20 ms.
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 14:30:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 14:30:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:30:17] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 30 ms to minimize.
[2024-05-28 14:30:17] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 6 ms to minimize.
[2024-05-28 14:30:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2024-05-28 14:30:17] [INFO ] Added : 58 causal constraints over 12 iterations in 300 ms. Result :sat
Minimization took 21 ms.
[2024-05-28 14:30:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 14:30:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:30:17] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2024-05-28 14:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-28 14:30:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-28 14:30:17] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:30:17] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:30:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:30:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2024-05-28 14:30:17] [INFO ] Added : 54 causal constraints over 11 iterations in 245 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 14:30:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 14:30:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 14:30:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 14:30:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-28 14:30:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 14:30:18] [INFO ] Added : 29 causal constraints over 6 iterations in 83 ms. Result :sat
Minimization took 43 ms.
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-28 14:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:30:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 14:30:18] [INFO ] Added : 25 causal constraints over 6 iterations in 46 ms. Result :sat
Minimization took 35 ms.
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned unsat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 14:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:30:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:30:18] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 15 ms.
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 14:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-28 14:30:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 14:30:18] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 14 ms.
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 14:30:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 14:30:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:30:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 14:30:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:30:19] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:30:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-28 14:30:19] [INFO ] Added : 49 causal constraints over 12 iterations in 162 ms. Result :sat
Minimization took 33 ms.
[2024-05-28 14:30:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 14:30:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-28 14:30:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:30:19] [INFO ] Added : 45 causal constraints over 9 iterations in 42 ms. Result :sat
Minimization took 24 ms.
[2024-05-28 14:30:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-28 14:30:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 14:30:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 16 ms returned sat
[2024-05-28 14:30:19] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-28 14:30:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 14:30:19] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-28 14:30:19] [INFO ] Added : 58 causal constraints over 12 iterations in 126 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 10, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 10, 2, 2, 8, 4, 2]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:30:19] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 43 ms.
[2024-05-28 14:30:19] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
[2024-05-28 14:30:19] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-28 14:30:19] [INFO ] Computed 54 invariants in 69 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 3, 8, 1, 8, 11, 2, 28, 2, 2, 8, 4, 2]
RANDOM walk for 10000 steps (4 resets) in 216 ms. (46 steps per ms)
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-13 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90005 steps (19 resets) in 330 ms. (271 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 10, 1, 2, 0, 1] Max Struct:[4, 3, 8, 11, 2, 28, 4, 2]
[2024-05-28 14:30:20] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 14:30:20] [INFO ] Invariant cache hit.
[2024-05-28 14:30:20] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 14:30:20] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned sat
[2024-05-28 14:30:21] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-28 14:30:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 14:30:21] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 21 ms returned sat
[2024-05-28 14:30:22] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2024-05-28 14:30:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:30:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 473 ms returned sat
[2024-05-28 14:30:22] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 130 ms.
[2024-05-28 14:30:25] [INFO ] Deduced a trap composed of 484 places in 497 ms of which 17 ms to minimize.
[2024-05-28 14:30:26] [INFO ] Deduced a trap composed of 46 places in 337 ms of which 4 ms to minimize.
[2024-05-28 14:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1118 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 14:30:26] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-28 14:30:26] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 24 ms returned sat
[2024-05-28 14:30:26] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2024-05-28 14:30:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 27 ms returned sat
[2024-05-28 14:30:27] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 56 ms returned sat
[2024-05-28 14:30:27] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-28 14:30:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:30:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 662 ms returned sat
[2024-05-28 14:30:28] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 165 ms.
[2024-05-28 14:30:29] [INFO ] Added : 77 causal constraints over 16 iterations in 1918 ms. Result :sat
Minimization took 552 ms.
[2024-05-28 14:30:30] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 14:30:30] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 23 ms returned unsat
[2024-05-28 14:30:30] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 14:30:30] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 11 ms returned unsat
[2024-05-28 14:30:30] [INFO ] [Real]Absence check using 16 positive place invariants in 34 ms returned sat
[2024-05-28 14:30:30] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 38 ms returned unsat
[2024-05-28 14:30:30] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-28 14:30:31] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 17 ms returned sat
[2024-05-28 14:30:31] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2024-05-28 14:30:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2024-05-28 14:30:31] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 24 ms returned sat
[2024-05-28 14:30:32] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2024-05-28 14:30:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:30:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 1018 ms returned unknown
[2024-05-28 14:30:33] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 14:30:33] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 18 ms returned sat
[2024-05-28 14:30:34] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2024-05-28 14:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 14:30:34] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 18 ms returned sat
[2024-05-28 14:30:34] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-05-28 14:30:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:30:35] [INFO ] [Nat]Added 96 Read/Feed constraints in 766 ms returned sat
[2024-05-28 14:30:35] [INFO ] Computed and/alt/rep : 824/3142/816 causal constraints (skipped 472 transitions) in 140 ms.
[2024-05-28 14:30:38] [INFO ] Added : 55 causal constraints over 11 iterations in 2748 ms. Result :sat
Minimization took 551 ms.
[2024-05-28 14:30:39] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-28 14:30:39] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 10, 1, 2, 0, 1] Max Struct:[4, 3, 1, 10, 1, 28, 4, 1]
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 688 transition count 1242
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 138 place count 624 transition count 1234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 434 place count 472 transition count 1090
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 442 place count 472 transition count 1082
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 450 place count 464 transition count 1082
Applied a total of 450 rules in 330 ms. Remains 464 /690 variables (removed 226) and now considering 1082/1306 (removed 224) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 14:30:39] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 464 cols
[2024-05-28 14:30:39] [INFO ] Computed 52 invariants in 62 ms
[2024-05-28 14:30:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:30:49] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:30:49] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:30:49] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:30:49] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:30:49] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:30:49] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:30:50] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:30:50] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 2 ms to minimize.
[2024-05-28 14:30:50] [INFO ] Deduced a trap composed of 172 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:30:50] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:30:51] [INFO ] Deduced a trap composed of 195 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:30:51] [INFO ] Deduced a trap composed of 185 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:30:51] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:30:51] [INFO ] Deduced a trap composed of 179 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:30:51] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 2 ms to minimize.
[2024-05-28 14:30:52] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:30:58] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 2 ms to minimize.
[2024-05-28 14:30:58] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:30:59] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:30:59] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 276 places in 210 ms of which 15 ms to minimize.
SMT process timed out in 22797ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 22842ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23217 ms. Remains : 464/690 places, 1082/1306 transitions.
[2024-05-28 14:31:02] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:31:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
RANDOM walk for 1000000 steps (385 resets) in 3576 ms. (279 steps per ms)
BEST_FIRST walk for 4000002 steps (651 resets) in 6507 ms. (614 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
[2024-05-28 14:31:12] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:31:12] [INFO ] Invariant cache hit.
[2024-05-28 14:31:12] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:31:12] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 21 ms returned sat
[2024-05-28 14:31:13] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-05-28 14:31:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:31:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-28 14:31:13] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 32 ms returned sat
[2024-05-28 14:31:13] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2024-05-28 14:31:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:31:14] [INFO ] [Nat]Added 96 Read/Feed constraints in 872 ms returned sat
[2024-05-28 14:31:14] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 80 ms.
[2024-05-28 14:31:15] [INFO ] Added : 63 causal constraints over 13 iterations in 1305 ms. Result :sat
Minimization took 3837 ms.
[2024-05-28 14:31:19] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:31:19] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 13 ms returned sat
[2024-05-28 14:31:20] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-05-28 14:31:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:31:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:31:20] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 12 ms returned sat
[2024-05-28 14:31:20] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2024-05-28 14:31:21] [INFO ] [Nat]Added 96 Read/Feed constraints in 477 ms returned sat
[2024-05-28 14:31:21] [INFO ] Deduced a trap composed of 186 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2024-05-28 14:31:21] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 77 ms.
[2024-05-28 14:31:23] [INFO ] Added : 36 causal constraints over 8 iterations in 1475 ms. Result :sat
Minimization took 3219 ms.
[2024-05-28 14:31:26] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 14:31:26] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 13 ms returned sat
[2024-05-28 14:31:26] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-05-28 14:31:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:31:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-28 14:31:26] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 12 ms returned sat
[2024-05-28 14:31:27] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2024-05-28 14:31:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 400 ms returned sat
[2024-05-28 14:31:27] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 71 ms.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:31:28] [INFO ] Deduced a trap composed of 185 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:31:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 845 ms
[2024-05-28 14:31:29] [INFO ] Added : 42 causal constraints over 10 iterations in 1616 ms. Result :sat
Minimization took 3445 ms.
[2024-05-28 14:31:32] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:31:32] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 12 ms returned sat
[2024-05-28 14:31:33] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-05-28 14:31:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:31:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:31:33] [INFO ] [Nat]Absence check using 15 positive and 37 generalized place invariants in 12 ms returned sat
[2024-05-28 14:31:33] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-05-28 14:31:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 850 ms returned sat
[2024-05-28 14:31:34] [INFO ] Computed and/alt/rep : 416/1526/408 causal constraints (skipped 656 transitions) in 63 ms.
[2024-05-28 14:31:35] [INFO ] Added : 29 causal constraints over 6 iterations in 968 ms. Result :sat
Minimization took 3315 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 23 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 464/464 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1082/1082 transitions.
Applied a total of 0 rules in 28 ms. Remains 464 /464 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2024-05-28 14:31:40] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2024-05-28 14:31:40] [INFO ] Invariant cache hit.
[2024-05-28 14:31:40] [INFO ] Implicit Places using invariants in 587 ms returned [418, 419, 420, 421, 422, 423, 424, 425]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 607 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/464 places, 1082/1082 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 448 transition count 1074
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 1074
Applied a total of 16 rules in 45 ms. Remains 448 /456 variables (removed 8) and now considering 1074/1082 (removed 8) transitions.
[2024-05-28 14:31:40] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 448 cols
[2024-05-28 14:31:40] [INFO ] Computed 44 invariants in 14 ms
[2024-05-28 14:31:41] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-28 14:31:41] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:31:41] [INFO ] Invariant cache hit.
[2024-05-28 14:31:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:31:47] [INFO ] Implicit Places using invariants and state equation in 6120 ms returned []
Implicit Place search using SMT with State Equation took 6683 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 448/464 places, 1074/1082 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7377 ms. Remains : 448/464 places, 1074/1082 transitions.
[2024-05-28 14:31:47] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:31:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
RANDOM walk for 1000000 steps (422 resets) in 3411 ms. (293 steps per ms)
BEST_FIRST walk for 4000001 steps (676 resets) in 6659 ms. (600 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
[2024-05-28 14:31:57] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:31:57] [INFO ] Invariant cache hit.
[2024-05-28 14:31:57] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 14:31:57] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 14:31:58] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-05-28 14:31:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:31:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:31:58] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-28 14:31:58] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2024-05-28 14:31:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:32:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:32:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 4740 ms returned sat
[2024-05-28 14:32:03] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:32:03] [INFO ] Deduced a trap composed of 159 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:32:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 755 ms
[2024-05-28 14:32:04] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 62 ms.
[2024-05-28 14:32:04] [INFO ] Added : 31 causal constraints over 7 iterations in 507 ms. Result :sat
Minimization took 4502 ms.
[2024-05-28 14:32:09] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:32:09] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-28 14:32:09] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-05-28 14:32:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:32:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:32:09] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-28 14:32:10] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2024-05-28 14:32:10] [INFO ] [Nat]Added 96 Read/Feed constraints in 464 ms returned sat
[2024-05-28 14:32:10] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 17 ms to minimize.
[2024-05-28 14:32:11] [INFO ] Deduced a trap composed of 184 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:32:11] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:32:12] [INFO ] Deduced a trap composed of 189 places in 241 ms of which 2 ms to minimize.
[2024-05-28 14:32:12] [INFO ] Deduced a trap composed of 180 places in 270 ms of which 4 ms to minimize.
[2024-05-28 14:32:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2768 ms
[2024-05-28 14:32:13] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 176 ms.
[2024-05-28 14:32:14] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-28 14:32:14] [INFO ] Added : 42 causal constraints over 9 iterations in 994 ms. Result :sat
Minimization took 4447 ms.
[2024-05-28 14:32:18] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:32:18] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 14:32:19] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-05-28 14:32:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:32:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 14:32:19] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-28 14:32:19] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2024-05-28 14:32:20] [INFO ] [Nat]Added 96 Read/Feed constraints in 235 ms returned sat
[2024-05-28 14:32:20] [INFO ] Deduced a trap composed of 189 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2024-05-28 14:32:20] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 73 ms.
[2024-05-28 14:32:21] [INFO ] Added : 41 causal constraints over 9 iterations in 1026 ms. Result :sat
Minimization took 3571 ms.
[2024-05-28 14:32:25] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:32:25] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-28 14:32:25] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-05-28 14:32:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:32:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:32:25] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-28 14:32:26] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-05-28 14:32:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 572 ms returned sat
[2024-05-28 14:32:27] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:32:27] [INFO ] Deduced a trap composed of 194 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:32:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2024-05-28 14:32:27] [INFO ] Computed and/alt/rep : 400/1445/392 causal constraints (skipped 664 transitions) in 97 ms.
[2024-05-28 14:32:28] [INFO ] Added : 30 causal constraints over 6 iterations in 569 ms. Result :sat
Minimization took 3339 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 28 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 448/448 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1074/1074 transitions.
Applied a total of 0 rules in 49 ms. Remains 448 /448 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-05-28 14:32:32] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:32:32] [INFO ] Invariant cache hit.
[2024-05-28 14:32:33] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-28 14:32:33] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:32:33] [INFO ] Invariant cache hit.
[2024-05-28 14:32:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:32:39] [INFO ] Implicit Places using invariants and state equation in 6300 ms returned []
Implicit Place search using SMT with State Equation took 6934 ms to find 0 implicit places.
[2024-05-28 14:32:39] [INFO ] Redundant transitions in 76 ms returned []
Running 1072 sub problems to find dead transitions.
[2024-05-28 14:32:39] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-28 14:32:39] [INFO ] Invariant cache hit.
[2024-05-28 14:32:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-28 14:32:47] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 45 places in 27 ms of which 1 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:32:48] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 8 ms to minimize.
[2024-05-28 14:32:49] [INFO ] Deduced a trap composed of 191 places in 228 ms of which 2 ms to minimize.
[2024-05-28 14:32:49] [INFO ] Deduced a trap composed of 167 places in 181 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-28 14:32:57] [INFO ] Deduced a trap composed of 172 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:32:57] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2024-05-28 14:33:02] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:33:03] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 145 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:33:04] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1506 variables, and 63 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-28 14:33:17] [INFO ] Deduced a trap composed of 276 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:33:17] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:33:22] [INFO ] Deduced a trap composed of 225 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:33:22] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:33:23] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/447 variables, 1/69 constraints. Problems are: Problem set: 18 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/1506 variables, and 69 constraints, problems are : Problem set: 18 solved, 1054 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 26/26 constraints]
After SMT, in 62184ms problems are : Problem set: 18 solved, 1054 unsolved
Search for dead transitions found 18 dead transitions in 62201ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/448 places, 1056/1074 transitions.
Applied a total of 0 rules in 25 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-28 14:33:42] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69358 ms. Remains : 448/448 places, 1056/1074 transitions.
[2024-05-28 14:33:42] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
// Phase 1: matrix 1040 rows 448 cols
[2024-05-28 14:33:42] [INFO ] Computed 44 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
RANDOM walk for 1000000 steps (448 resets) in 3446 ms. (290 steps per ms)
BEST_FIRST walk for 4000004 steps (639 resets) in 7090 ms. (564 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
[2024-05-28 14:33:52] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:33:52] [INFO ] Invariant cache hit.
[2024-05-28 14:33:52] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 14:33:52] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-28 14:33:53] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-28 14:33:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:33:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:33:53] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-28 14:33:54] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2024-05-28 14:33:54] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:33:54] [INFO ] [Nat]Added 96 Read/Feed constraints in 544 ms returned sat
[2024-05-28 14:33:55] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 3 ms to minimize.
[2024-05-28 14:33:55] [INFO ] Deduced a trap composed of 178 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:33:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 869 ms
[2024-05-28 14:33:55] [INFO ] Computed and/alt/rep : 424/1631/416 causal constraints (skipped 622 transitions) in 76 ms.
[2024-05-28 14:33:56] [INFO ] Added : 33 causal constraints over 7 iterations in 1028 ms. Result :sat
Minimization took 4501 ms.
[2024-05-28 14:34:01] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 14:34:01] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-28 14:34:01] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-05-28 14:34:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:34:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-28 14:34:01] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-28 14:34:03] [INFO ] [Nat]Absence check using state equation in 1664 ms returned sat
[2024-05-28 14:34:03] [INFO ] [Nat]Added 96 Read/Feed constraints in 434 ms returned sat
[2024-05-28 14:34:03] [INFO ] Computed and/alt/rep : 424/1631/416 causal constraints (skipped 622 transitions) in 86 ms.
[2024-05-28 14:34:04] [INFO ] Added : 22 causal constraints over 5 iterations in 880 ms. Result :sat
Minimization took 3002 ms.
[2024-05-28 14:34:07] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 14:34:07] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-28 14:34:08] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-28 14:34:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:34:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 14:34:08] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-28 14:34:08] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-05-28 14:34:09] [INFO ] [Nat]Added 96 Read/Feed constraints in 550 ms returned sat
[2024-05-28 14:34:09] [INFO ] Deduced a trap composed of 193 places in 299 ms of which 3 ms to minimize.
[2024-05-28 14:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2024-05-28 14:34:10] [INFO ] Computed and/alt/rep : 424/1631/416 causal constraints (skipped 622 transitions) in 103 ms.
[2024-05-28 14:34:10] [INFO ] Added : 43 causal constraints over 9 iterations in 991 ms. Result :sat
Minimization took 3121 ms.
[2024-05-28 14:34:14] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 14:34:14] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-28 14:34:14] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2024-05-28 14:34:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:34:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 14:34:14] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-28 14:34:15] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2024-05-28 14:34:16] [INFO ] [Nat]Added 96 Read/Feed constraints in 1346 ms returned sat
[2024-05-28 14:34:17] [INFO ] Deduced a trap composed of 192 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:34:17] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-28 14:34:17] [INFO ] Deduced a trap composed of 199 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:34:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 870 ms
[2024-05-28 14:34:17] [INFO ] Computed and/alt/rep : 424/1631/416 causal constraints (skipped 622 transitions) in 66 ms.
[2024-05-28 14:34:18] [INFO ] Deduced a trap composed of 216 places in 251 ms of which 4 ms to minimize.
[2024-05-28 14:34:19] [INFO ] Deduced a trap composed of 178 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:34:19] [INFO ] Deduced a trap composed of 190 places in 259 ms of which 4 ms to minimize.
[2024-05-28 14:34:19] [INFO ] Deduced a trap composed of 175 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:34:20] [INFO ] Deduced a trap composed of 216 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:34:20] [INFO ] Deduced a trap composed of 187 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:34:21] [INFO ] Deduced a trap composed of 213 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:34:21] [INFO ] Deduced a trap composed of 208 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:34:21] [INFO ] Deduced a trap composed of 189 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:34:21] [INFO ] Deduced a trap composed of 213 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:34:26] [INFO ] Deduced a trap composed of 221 places in 285 ms of which 4 ms to minimize.
[2024-05-28 14:34:26] [INFO ] Deduced a trap composed of 217 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:34:31] [INFO ] Trap strengthening (SAT) tested/added 12/12 trap constraints in 12741 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 0] Max Struct:[4, 3, 28, 4]
Support contains 18 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 15 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 448/448 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 13 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-28 14:35:00] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:35:00] [INFO ] Invariant cache hit.
[2024-05-28 14:35:00] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 14:35:00] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:35:00] [INFO ] Invariant cache hit.
[2024-05-28 14:35:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:35:06] [INFO ] Implicit Places using invariants and state equation in 6049 ms returned []
Implicit Place search using SMT with State Equation took 6485 ms to find 0 implicit places.
[2024-05-28 14:35:06] [INFO ] Redundant transitions in 7 ms returned []
Running 1054 sub problems to find dead transitions.
[2024-05-28 14:35:06] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:35:06] [INFO ] Invariant cache hit.
[2024-05-28 14:35:06] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:35:15] [INFO ] Deduced a trap composed of 186 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:35:16] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:35:16] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:35:16] [INFO ] Deduced a trap composed of 173 places in 260 ms of which 3 ms to minimize.
[2024-05-28 14:35:17] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:35:19] [INFO ] Deduced a trap composed of 276 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:35:22] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:35:22] [INFO ] Deduced a trap composed of 218 places in 229 ms of which 4 ms to minimize.
[2024-05-28 14:35:23] [INFO ] Deduced a trap composed of 223 places in 290 ms of which 3 ms to minimize.
[2024-05-28 14:35:23] [INFO ] Deduced a trap composed of 209 places in 235 ms of which 3 ms to minimize.
[2024-05-28 14:35:23] [INFO ] Deduced a trap composed of 209 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:35:24] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 3 ms to minimize.
[2024-05-28 14:35:24] [INFO ] Deduced a trap composed of 213 places in 254 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:35:25] [INFO ] Deduced a trap composed of 205 places in 266 ms of which 3 ms to minimize.
[2024-05-28 14:35:25] [INFO ] Deduced a trap composed of 184 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:35:26] [INFO ] Deduced a trap composed of 193 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:35:26] [INFO ] Deduced a trap composed of 179 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:35:26] [INFO ] Deduced a trap composed of 184 places in 185 ms of which 2 ms to minimize.
[2024-05-28 14:35:26] [INFO ] Deduced a trap composed of 183 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:35:27] [INFO ] Deduced a trap composed of 204 places in 282 ms of which 4 ms to minimize.
[2024-05-28 14:35:27] [INFO ] Deduced a trap composed of 187 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:35:27] [INFO ] Deduced a trap composed of 187 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:35:29] [INFO ] Deduced a trap composed of 160 places in 278 ms of which 3 ms to minimize.
[2024-05-28 14:35:30] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:35:30] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 3 ms to minimize.
[2024-05-28 14:35:34] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 3 ms to minimize.
[2024-05-28 14:35:35] [INFO ] Deduced a trap composed of 150 places in 227 ms of which 2 ms to minimize.
[2024-05-28 14:35:36] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:35:36] [INFO ] Deduced a trap composed of 96 places in 258 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1488 variables, and 78 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1054/1054 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:35:40] [INFO ] Deduced a trap composed of 202 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:35:41] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 4 ms to minimize.
[2024-05-28 14:35:42] [INFO ] Deduced a trap composed of 211 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:35:45] [INFO ] Deduced a trap composed of 241 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:35:53] [INFO ] Deduced a trap composed of 137 places in 282 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1488 variables, and 83 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1054 constraints, Known Traps: 41/41 constraints]
After SMT, in 61683ms problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 61694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68214 ms. Remains : 448/448 places, 1056/1056 transitions.
RANDOM walk for 40000 steps (20 resets) in 1154 ms. (34 steps per ms) remains 8/8 properties
[2024-05-28 14:36:08] [INFO ] Flatten gal took : 276 ms
BEST_FIRST walk for 40004 steps (9 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
[2024-05-28 14:36:09] [INFO ] Flatten gal took : 139 ms
[2024-05-28 14:36:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17514634134118045720.gal : 43 ms
BEST_FIRST walk for 40000 steps (9 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
[2024-05-28 14:36:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13978278149580535210.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17514634134118045720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13978278149580535210.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40003 steps (10 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 228 ms. (174 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (14 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality13978278149580535210.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 206 ms. (193 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :10 after 28
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :28 after 80
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :80 after 416
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :416 after 864
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :864 after 1120
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1120 after 2132
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2132 after 3120
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :3120 after 9420
Interrupted probabilistic random walk after 145121 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 8
Probabilistic random walk after 145121 steps, saw 83016 distinct states, run finished after 3007 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-28 14:36:12] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:36:12] [INFO ] Invariant cache hit.
[2024-05-28 14:36:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 174/192 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 25/217 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 14/231 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX2 is UNSAT
At refinement iteration 8 (OVERLAPS) 208/439 variables, 25/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/43 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1040/1486 variables, 446/489 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1486 variables, 96/585 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/1488 variables, 2/587 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 1/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1488/1488 variables, and 588 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2937 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 174/192 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 25/217 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 14/231 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 208/439 variables, 25/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :9420 after 20494
[2024-05-28 14:36:16] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1040/1486 variables, 446/495 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 96/591 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/1486 variables, 7/598 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1486/1488 variables, and 598 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 446/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 7981ms problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 33 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Running 1054 sub problems to find dead transitions.
[2024-05-28 14:36:20] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:36:20] [INFO ] Invariant cache hit.
[2024-05-28 14:36:20] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :20494 after 35734
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:36:29] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:36:29] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-05-28 14:36:29] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:36:29] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:36:29] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:36:29] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:36:29] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:36:30] [INFO ] Deduced a trap composed of 186 places in 273 ms of which 3 ms to minimize.
[2024-05-28 14:36:30] [INFO ] Deduced a trap composed of 165 places in 235 ms of which 4 ms to minimize.
[2024-05-28 14:36:30] [INFO ] Deduced a trap composed of 180 places in 254 ms of which 4 ms to minimize.
[2024-05-28 14:36:30] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:36:31] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:36:33] [INFO ] Deduced a trap composed of 276 places in 236 ms of which 2 ms to minimize.
[2024-05-28 14:36:36] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 2 ms to minimize.
[2024-05-28 14:36:36] [INFO ] Deduced a trap composed of 218 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:36:36] [INFO ] Deduced a trap composed of 223 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:36:36] [INFO ] Deduced a trap composed of 209 places in 202 ms of which 2 ms to minimize.
[2024-05-28 14:36:37] [INFO ] Deduced a trap composed of 209 places in 178 ms of which 2 ms to minimize.
[2024-05-28 14:36:37] [INFO ] Deduced a trap composed of 198 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:36:37] [INFO ] Deduced a trap composed of 213 places in 186 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:36:38] [INFO ] Deduced a trap composed of 205 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:36:38] [INFO ] Deduced a trap composed of 184 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:36:39] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:36:39] [INFO ] Deduced a trap composed of 179 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:36:39] [INFO ] Deduced a trap composed of 184 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:36:39] [INFO ] Deduced a trap composed of 183 places in 234 ms of which 3 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :35734 after 85120
[2024-05-28 14:36:40] [INFO ] Deduced a trap composed of 204 places in 206 ms of which 2 ms to minimize.
[2024-05-28 14:36:40] [INFO ] Deduced a trap composed of 187 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:36:40] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 4 ms to minimize.
[2024-05-28 14:36:42] [INFO ] Deduced a trap composed of 160 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:36:42] [INFO ] Deduced a trap composed of 167 places in 174 ms of which 2 ms to minimize.
SMT process timed out in 21887ms, After SMT, problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 21906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21947 ms. Remains : 448/448 places, 1056/1056 transitions.
RANDOM walk for 40000 steps (24 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 216496 steps, run timeout after 3003 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 216496 steps, saw 121445 distinct states, run finished after 3004 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-28 14:36:45] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:36:45] [INFO ] Invariant cache hit.
[2024-05-28 14:36:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 175/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 209/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:36:46] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/443 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/446 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1040/1486 variables, 446/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1486 variables, 96/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1488 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1488 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1488 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1488 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1488/1488 variables, and 593 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1433 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 175/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/216 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 14/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 209/439 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:36:47] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/443 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/446 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1040/1486 variables, 446/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 96/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1486 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1486 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1488 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1488 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:36:49] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 2 ms to minimize.
[2024-05-28 14:36:49] [INFO ] Deduced a trap composed of 181 places in 205 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1488 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1488 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1488 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Detected timeout of ITS tools.
[2024-05-28 14:36:59] [INFO ] Flatten gal took : 116 ms
[2024-05-28 14:36:59] [INFO ] Applying decomposition
[2024-05-28 14:36:59] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5659789233088316328.txt' '-o' '/tmp/graph5659789233088316328.bin' '-w' '/tmp/graph5659789233088316328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5659789233088316328.bin' '-l' '-1' '-v' '-w' '/tmp/graph5659789233088316328.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:36:59] [INFO ] Decomposing Gal with order
[2024-05-28 14:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:37:00] [INFO ] Removed a total of 931 redundant transitions.
[2024-05-28 14:37:00] [INFO ] Flatten gal took : 324 ms
[2024-05-28 14:37:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 601 labels/synchronizations in 41 ms.
[2024-05-28 14:37:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6038915011611907983.gal : 15 ms
[2024-05-28 14:37:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1884361346113068157.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6038915011611907983.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1884361346113068157.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
No progress, stopping.
Loading property file /tmp/ReachabilityCardinality1884361346113068157.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :7 after 13
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :13 after 16
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :16 after 28
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :28 after 58
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :58 after 122
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :122 after 187
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :187 after 297
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :297 after 948
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :948 after 1879
After SMT solving in domain Int declared 1488/1488 variables, and 599 constraints, problems are : Problem set: 0 solved, 3 unsolved in 14038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 15490ms problems are : Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1879 after 5012
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5012 after 20020
Parikh walk visited 0 properties in 2233 ms.
Support contains 16 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 14 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 448/448 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 12 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-28 14:37:03] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:37:03] [INFO ] Invariant cache hit.
[2024-05-28 14:37:04] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-28 14:37:04] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:37:04] [INFO ] Invariant cache hit.
[2024-05-28 14:37:04] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:37:09] [INFO ] Implicit Places using invariants and state equation in 5571 ms returned []
Implicit Place search using SMT with State Equation took 5871 ms to find 0 implicit places.
[2024-05-28 14:37:09] [INFO ] Redundant transitions in 18 ms returned []
Running 1054 sub problems to find dead transitions.
[2024-05-28 14:37:09] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:37:09] [INFO ] Invariant cache hit.
[2024-05-28 14:37:09] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :54904 after 64099
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 6 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 0 ms to minimize.
[2024-05-28 14:37:17] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:37:18] [INFO ] Deduced a trap composed of 186 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:37:18] [INFO ] Deduced a trap composed of 165 places in 323 ms of which 4 ms to minimize.
[2024-05-28 14:37:19] [INFO ] Deduced a trap composed of 180 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:37:19] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:37:19] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:37:21] [INFO ] Deduced a trap composed of 276 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:37:24] [INFO ] Deduced a trap composed of 224 places in 258 ms of which 4 ms to minimize.
[2024-05-28 14:37:24] [INFO ] Deduced a trap composed of 218 places in 223 ms of which 3 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :64099 after 116208
[2024-05-28 14:37:25] [INFO ] Deduced a trap composed of 223 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:37:25] [INFO ] Deduced a trap composed of 209 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:37:25] [INFO ] Deduced a trap composed of 209 places in 249 ms of which 3 ms to minimize.
[2024-05-28 14:37:26] [INFO ] Deduced a trap composed of 198 places in 219 ms of which 3 ms to minimize.
[2024-05-28 14:37:26] [INFO ] Deduced a trap composed of 213 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:37:27] [INFO ] Deduced a trap composed of 205 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 184 places in 218 ms of which 4 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 193 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 179 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 184 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:37:28] [INFO ] Deduced a trap composed of 183 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:37:29] [INFO ] Deduced a trap composed of 204 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:37:29] [INFO ] Deduced a trap composed of 187 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:37:29] [INFO ] Deduced a trap composed of 187 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:37:31] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 4 ms to minimize.
[2024-05-28 14:37:31] [INFO ] Deduced a trap composed of 167 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:37:31] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 3 ms to minimize.
[2024-05-28 14:37:35] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 4 ms to minimize.
[2024-05-28 14:37:35] [INFO ] Deduced a trap composed of 150 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:37:37] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:37:37] [INFO ] Deduced a trap composed of 96 places in 222 ms of which 3 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :116208 after 384928
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1488 variables, and 78 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1054/1054 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:37:43] [INFO ] Deduced a trap composed of 202 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:37:44] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:37:45] [INFO ] Deduced a trap composed of 211 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:37:47] [INFO ] Deduced a trap composed of 241 places in 202 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 14:37:54] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1488 variables, and 83 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1054 constraints, Known Traps: 41/41 constraints]
After SMT, in 61828ms problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 61848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67765 ms. Remains : 448/448 places, 1056/1056 transitions.
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-01 0 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-COL-S02J06T08-UpperBounds-00 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[2, 0] Max Struct:[28, 4]
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[28]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[28]
[2024-05-28 14:38:11] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[28]
RANDOM walk for 10000 steps (6 resets) in 36 ms. (270 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[28]
[2024-05-28 14:38:11] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:11] [INFO ] Invariant cache hit.
[2024-05-28 14:38:11] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-28 14:38:11] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 16 ms returned sat
[2024-05-28 14:38:11] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-05-28 14:38:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:38:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:38:12] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-28 14:38:12] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-28 14:38:12] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:38:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:38:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 810 ms returned sat
[2024-05-28 14:38:13] [INFO ] Computed and/alt/rep : 424/1631/416 causal constraints (skipped 622 transitions) in 86 ms.
[2024-05-28 14:38:14] [INFO ] Added : 46 causal constraints over 10 iterations in 976 ms. Result :sat
Minimization took 592 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[28]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 19 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Running 1054 sub problems to find dead transitions.
[2024-05-28 14:38:14] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:14] [INFO ] Invariant cache hit.
[2024-05-28 14:38:14] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:38:24] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:38:25] [INFO ] Deduced a trap composed of 186 places in 288 ms of which 3 ms to minimize.
[2024-05-28 14:38:25] [INFO ] Deduced a trap composed of 165 places in 203 ms of which 2 ms to minimize.
[2024-05-28 14:38:26] [INFO ] Deduced a trap composed of 180 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:38:26] [INFO ] Deduced a trap composed of 173 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:38:27] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:38:29] [INFO ] Deduced a trap composed of 276 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:38:32] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:38:32] [INFO ] Deduced a trap composed of 218 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:38:33] [INFO ] Deduced a trap composed of 223 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:38:33] [INFO ] Deduced a trap composed of 209 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:38:33] [INFO ] Deduced a trap composed of 209 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 198 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:38:34] [INFO ] Deduced a trap composed of 213 places in 284 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:38:35] [INFO ] Deduced a trap composed of 205 places in 201 ms of which 2 ms to minimize.
[2024-05-28 14:38:36] [INFO ] Deduced a trap composed of 184 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:38:36] [INFO ] Deduced a trap composed of 193 places in 282 ms of which 3 ms to minimize.
[2024-05-28 14:38:36] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 2 ms to minimize.
[2024-05-28 14:38:36] [INFO ] Deduced a trap composed of 184 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:38:37] [INFO ] Deduced a trap composed of 183 places in 226 ms of which 3 ms to minimize.
SMT process timed out in 22402ms, After SMT, problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 22418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22442 ms. Remains : 448/448 places, 1056/1056 transitions.
[2024-05-28 14:38:37] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[28]
RANDOM walk for 1000000 steps (421 resets) in 3798 ms. (263 steps per ms)
BEST_FIRST walk for 1000000 steps (179 resets) in 1607 ms. (621 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[28]
[2024-05-28 14:38:42] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:42] [INFO ] Invariant cache hit.
[2024-05-28 14:38:42] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 14:38:42] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-28 14:38:43] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-05-28 14:38:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:38:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 14:38:43] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-28 14:38:43] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-28 14:38:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:38:43] [INFO ] [Nat]Added 96 Read/Feed constraints in 433 ms returned sat
[2024-05-28 14:38:44] [INFO ] Deduced a trap composed of 193 places in 299 ms of which 5 ms to minimize.
[2024-05-28 14:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2024-05-28 14:38:44] [INFO ] Computed and/alt/rep : 424/1631/416 causal constraints (skipped 622 transitions) in 78 ms.
[2024-05-28 14:38:45] [INFO ] Added : 43 causal constraints over 9 iterations in 1347 ms. Result :sat
Minimization took 3377 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[28]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 17 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 448/448 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 18 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-28 14:38:49] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:49] [INFO ] Invariant cache hit.
[2024-05-28 14:38:50] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-28 14:38:50] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:50] [INFO ] Invariant cache hit.
[2024-05-28 14:38:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:38:55] [INFO ] Implicit Places using invariants and state equation in 5474 ms returned []
Implicit Place search using SMT with State Equation took 5946 ms to find 0 implicit places.
[2024-05-28 14:38:55] [INFO ] Redundant transitions in 17 ms returned []
Running 1054 sub problems to find dead transitions.
[2024-05-28 14:38:55] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:38:55] [INFO ] Invariant cache hit.
[2024-05-28 14:38:55] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:39:04] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 3 ms to minimize.
[2024-05-28 14:39:04] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:39:04] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-28 14:39:04] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:39:04] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:39:04] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:39:04] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:39:05] [INFO ] Deduced a trap composed of 186 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:39:05] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 180 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:39:06] [INFO ] Deduced a trap composed of 173 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:39:07] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:39:09] [INFO ] Deduced a trap composed of 276 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:39:12] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 218 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 223 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 209 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:39:14] [INFO ] Deduced a trap composed of 209 places in 264 ms of which 5 ms to minimize.
[2024-05-28 14:39:14] [INFO ] Deduced a trap composed of 198 places in 257 ms of which 4 ms to minimize.
[2024-05-28 14:39:14] [INFO ] Deduced a trap composed of 213 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:39:16] [INFO ] Deduced a trap composed of 205 places in 264 ms of which 4 ms to minimize.
[2024-05-28 14:39:16] [INFO ] Deduced a trap composed of 184 places in 232 ms of which 3 ms to minimize.
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 193 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 179 places in 218 ms of which 3 ms to minimize.
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 184 places in 204 ms of which 2 ms to minimize.
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 204 places in 203 ms of which 2 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 187 places in 199 ms of which 2 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 187 places in 217 ms of which 4 ms to minimize.
[2024-05-28 14:39:20] [INFO ] Deduced a trap composed of 160 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:39:21] [INFO ] Deduced a trap composed of 167 places in 248 ms of which 4 ms to minimize.
[2024-05-28 14:39:21] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 4 ms to minimize.
[2024-05-28 14:39:26] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 3 ms to minimize.
[2024-05-28 14:39:26] [INFO ] Deduced a trap composed of 150 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:39:27] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 3 ms to minimize.
SMT process timed out in 32175ms, After SMT, problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 32194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38195 ms. Remains : 448/448 places, 1056/1056 transitions.
RANDOM walk for 40000 steps (16 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
[2024-05-28 14:39:27] [INFO ] Flatten gal took : 106 ms
BEST_FIRST walk for 40003 steps (11 resets) in 409 ms. (97 steps per ms) remains 2/2 properties
[2024-05-28 14:39:28] [INFO ] Flatten gal took : 124 ms
[2024-05-28 14:39:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1903135635642028361.gal : 12 ms
[2024-05-28 14:39:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3630108328863413420.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1903135635642028361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3630108328863413420.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (10 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3630108328863413420.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :10 after 28
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :28 after 80
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :80 after 416
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :416 after 864
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :864 after 1120
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1120 after 2132
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2132 after 3120
Interrupted probabilistic random walk after 207762 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 207762 steps, saw 116824 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-28 14:39:31] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:39:31] [INFO ] Invariant cache hit.
[2024-05-28 14:39:31] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3120 after 9420
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/403 variables, 7/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/445 variables, 19/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/446 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1040/1486 variables, 446/489 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1486 variables, 96/585 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1486 variables, 0/585 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1488 variables, 2/587 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 1/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1488/1488 variables, and 588 constraints, problems are : Problem set: 1 solved, 1 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 271 places in 237 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/403 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 217 places in 218 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/445 variables, 19/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:39:32] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:39:33] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 5/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/446 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1040/1486 variables, 446/496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9420 after 20494
After SMT solving in domain Int declared 1486/1488 variables, and 592 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2615 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 446/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3372ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 24 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Running 1054 sub problems to find dead transitions.
[2024-05-28 14:39:34] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:39:34] [INFO ] Invariant cache hit.
[2024-05-28 14:39:34] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :20494 after 35734
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:39:43] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:39:43] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:39:43] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:39:43] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:39:43] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:39:43] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:39:43] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 186 places in 198 ms of which 4 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 3 ms to minimize.
[2024-05-28 14:39:44] [INFO ] Deduced a trap composed of 180 places in 231 ms of which 3 ms to minimize.
[2024-05-28 14:39:45] [INFO ] Deduced a trap composed of 173 places in 202 ms of which 4 ms to minimize.
[2024-05-28 14:39:46] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:39:47] [INFO ] Deduced a trap composed of 276 places in 243 ms of which 3 ms to minimize.
[2024-05-28 14:39:51] [INFO ] Deduced a trap composed of 224 places in 221 ms of which 4 ms to minimize.
[2024-05-28 14:39:51] [INFO ] Deduced a trap composed of 218 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:39:52] [INFO ] Deduced a trap composed of 223 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:39:52] [INFO ] Deduced a trap composed of 209 places in 205 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :35734 after 85120
[2024-05-28 14:39:52] [INFO ] Deduced a trap composed of 209 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 198 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:39:53] [INFO ] Deduced a trap composed of 213 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:39:54] [INFO ] Deduced a trap composed of 205 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 184 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 193 places in 195 ms of which 3 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 179 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 184 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:39:55] [INFO ] Deduced a trap composed of 183 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:39:56] [INFO ] Deduced a trap composed of 204 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:39:56] [INFO ] Deduced a trap composed of 187 places in 168 ms of which 2 ms to minimize.
[2024-05-28 14:39:56] [INFO ] Deduced a trap composed of 187 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1488 variables, and 71 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1054/1054 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 29/71 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:39:58] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:39:59] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:40:04] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 150 places in 238 ms of which 4 ms to minimize.
[2024-05-28 14:40:07] [INFO ] Deduced a trap composed of 161 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:40:11] [INFO ] Deduced a trap composed of 206 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:40:11] [INFO ] Deduced a trap composed of 226 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:40:11] [INFO ] Deduced a trap composed of 197 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:40:11] [INFO ] Deduced a trap composed of 201 places in 204 ms of which 2 ms to minimize.
[2024-05-28 14:40:12] [INFO ] Deduced a trap composed of 210 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:40:12] [INFO ] Deduced a trap composed of 201 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:40:12] [INFO ] Deduced a trap composed of 223 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:40:12] [INFO ] Deduced a trap composed of 235 places in 172 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :85120 after 196410
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1488 variables, and 84 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1054 constraints, Known Traps: 42/42 constraints]
After SMT, in 42186ms problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 42202ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42229 ms. Remains : 448/448 places, 1056/1056 transitions.
RANDOM walk for 40000 steps (23 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Detected timeout of ITS tools.
[2024-05-28 14:40:18] [INFO ] Flatten gal took : 88 ms
[2024-05-28 14:40:18] [INFO ] Applying decomposition
[2024-05-28 14:40:18] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9068967572597862874.txt' '-o' '/tmp/graph9068967572597862874.bin' '-w' '/tmp/graph9068967572597862874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9068967572597862874.bin' '-l' '-1' '-v' '-w' '/tmp/graph9068967572597862874.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:40:18] [INFO ] Decomposing Gal with order
[2024-05-28 14:40:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:40:18] [INFO ] Removed a total of 911 redundant transitions.
[2024-05-28 14:40:18] [INFO ] Flatten gal took : 177 ms
[2024-05-28 14:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 459 labels/synchronizations in 56 ms.
[2024-05-28 14:40:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3474047389005076300.gal : 16 ms
[2024-05-28 14:40:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15665483932534259190.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3474047389005076300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15665483932534259190.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15665483932534259190.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 20
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :20 after 234
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :234 after 717
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :717 after 946
Interrupted probabilistic random walk after 335504 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335504 steps, saw 183018 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-28 14:40:19] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:40:19] [INFO ] Invariant cache hit.
[2024-05-28 14:40:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :946 after 1228
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/403 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/445 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/446 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1228 after 3148
At refinement iteration 11 (OVERLAPS) 1040/1486 variables, 446/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1486 variables, 96/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1486 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1488 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1488 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1488/1488 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 357/365 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/389 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 271 places in 214 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/403 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3148 after 9752
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 217 places in 204 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/445 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/446 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1040/1486 variables, 446/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1486 variables, 96/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1486 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1486 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1488 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1488 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 3 ms to minimize.
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1488 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1488 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1488 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1488/1488 variables, and 598 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3807 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 448/448 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 4713ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 20 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 448/448 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Applied a total of 0 rules in 18 ms. Remains 448 /448 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-28 14:40:24] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:40:24] [INFO ] Invariant cache hit.
[2024-05-28 14:40:25] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-28 14:40:25] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:40:25] [INFO ] Invariant cache hit.
[2024-05-28 14:40:25] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :54904 after 55178
[2024-05-28 14:40:30] [INFO ] Implicit Places using invariants and state equation in 5521 ms returned []
Implicit Place search using SMT with State Equation took 5908 ms to find 0 implicit places.
[2024-05-28 14:40:30] [INFO ] Redundant transitions in 16 ms returned []
Running 1054 sub problems to find dead transitions.
[2024-05-28 14:40:30] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:40:30] [INFO ] Invariant cache hit.
[2024-05-28 14:40:30] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:40:39] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:40:39] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:40:39] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:40:39] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:40:39] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:40:39] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:40:39] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:40:40] [INFO ] Deduced a trap composed of 186 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:40:40] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 3 ms to minimize.
[2024-05-28 14:40:41] [INFO ] Deduced a trap composed of 180 places in 242 ms of which 3 ms to minimize.
[2024-05-28 14:40:41] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 4 ms to minimize.
[2024-05-28 14:40:42] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:40:43] [INFO ] Deduced a trap composed of 276 places in 215 ms of which 3 ms to minimize.
[2024-05-28 14:40:46] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:40:47] [INFO ] Deduced a trap composed of 218 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:40:47] [INFO ] Deduced a trap composed of 223 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:40:47] [INFO ] Deduced a trap composed of 209 places in 186 ms of which 2 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 209 places in 243 ms of which 4 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 198 places in 220 ms of which 4 ms to minimize.
[2024-05-28 14:40:48] [INFO ] Deduced a trap composed of 213 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :55178 after 71860
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 205 places in 249 ms of which 4 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 184 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 193 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 179 places in 207 ms of which 2 ms to minimize.
[2024-05-28 14:40:50] [INFO ] Deduced a trap composed of 184 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 183 places in 186 ms of which 3 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 204 places in 198 ms of which 3 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 187 places in 183 ms of which 2 ms to minimize.
[2024-05-28 14:40:51] [INFO ] Deduced a trap composed of 187 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:40:53] [INFO ] Deduced a trap composed of 160 places in 277 ms of which 3 ms to minimize.
[2024-05-28 14:40:54] [INFO ] Deduced a trap composed of 167 places in 256 ms of which 4 ms to minimize.
[2024-05-28 14:40:54] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2024-05-28 14:40:58] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:40:58] [INFO ] Deduced a trap composed of 150 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:40:59] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:40:59] [INFO ] Deduced a trap composed of 96 places in 223 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1488 variables, and 78 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1054/1054 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
[2024-05-28 14:41:04] [INFO ] Deduced a trap composed of 202 places in 214 ms of which 3 ms to minimize.
[2024-05-28 14:41:05] [INFO ] Deduced a trap composed of 226 places in 211 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :71860 after 139728
[2024-05-28 14:41:06] [INFO ] Deduced a trap composed of 211 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:41:08] [INFO ] Deduced a trap composed of 241 places in 189 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 14:41:15] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1488 variables, and 83 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/448 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1054 constraints, Known Traps: 41/41 constraints]
After SMT, in 62039ms problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 62055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68009 ms. Remains : 448/448 places, 1056/1056 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[28]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-09 in 201134 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 14:41:32] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:41:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (3 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 14:41:32] [INFO ] Flow matrix only has 1040 transitions (discarded 16 similar events)
[2024-05-28 14:41:32] [INFO ] Invariant cache hit.
[2024-05-28 14:41:32] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-28 14:41:32] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-28 14:41:33] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-05-28 14:41:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:41:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 14:41:33] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-28 14:41:33] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-05-28 14:41:33] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:41:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:41:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 1023 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1056/1056 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 448 transition count 1048
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 440 transition count 1048
Applied a total of 16 rules in 62 ms. Remains 440 /448 variables (removed 8) and now considering 1048/1056 (removed 8) transitions.
Running 1046 sub problems to find dead transitions.
[2024-05-28 14:41:35] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
// Phase 1: matrix 1032 rows 440 cols
[2024-05-28 14:41:35] [INFO ] Computed 44 invariants in 30 ms
[2024-05-28 14:41:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:41:43] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 167 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 164 places in 260 ms of which 4 ms to minimize.
[2024-05-28 14:41:44] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 247 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 247 places in 224 ms of which 3 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 213 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 221 places in 208 ms of which 3 ms to minimize.
[2024-05-28 14:41:52] [INFO ] Deduced a trap composed of 150 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:41:53] [INFO ] Deduced a trap composed of 152 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:41:54] [INFO ] Deduced a trap composed of 167 places in 255 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:41:55] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 2.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.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 0.0)
(s42 0.0)
(s43 0.0)
(s44 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 438/1472 variables, and 60 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1046/1046 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1046 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:42:09] [INFO ] Deduced a trap composed of 145 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:42:09] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:42:15] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1472 variables, and 63 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1046 constraints, Known Traps: 21/21 constraints]
After SMT, in 41908ms problems are : Problem set: 0 solved, 1046 unsolved
Search for dead transitions found 0 dead transitions in 41923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41988 ms. Remains : 440/448 places, 1048/1056 transitions.
[2024-05-28 14:42:16] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:42:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (456 resets) in 3028 ms. (330 steps per ms)
BEST_FIRST walk for 1000001 steps (171 resets) in 1431 ms. (698 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 14:42:21] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:42:21] [INFO ] Invariant cache hit.
[2024-05-28 14:42:21] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-28 14:42:21] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 14:42:21] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-05-28 14:42:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:42:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-28 14:42:21] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-28 14:42:22] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-05-28 14:42:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:42:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 1118 ms returned sat
[2024-05-28 14:42:24] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2024-05-28 14:42:24] [INFO ] Computed and/alt/rep : 424/1631/416 causal constraints (skipped 614 transitions) in 71 ms.
[2024-05-28 14:42:25] [INFO ] Added : 38 causal constraints over 8 iterations in 842 ms. Result :sat
Minimization took 5135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1048/1048 transitions.
Applied a total of 0 rules in 35 ms. Remains 440 /440 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 440/440 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1048/1048 transitions.
Applied a total of 0 rules in 27 ms. Remains 440 /440 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-28 14:42:30] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:42:30] [INFO ] Invariant cache hit.
[2024-05-28 14:42:30] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-28 14:42:30] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:42:30] [INFO ] Invariant cache hit.
[2024-05-28 14:42:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:42:37] [INFO ] Implicit Places using invariants and state equation in 6515 ms returned []
Implicit Place search using SMT with State Equation took 6890 ms to find 0 implicit places.
[2024-05-28 14:42:37] [INFO ] Redundant transitions in 18 ms returned []
Running 1046 sub problems to find dead transitions.
[2024-05-28 14:42:37] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:42:37] [INFO ] Invariant cache hit.
[2024-05-28 14:42:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:42:44] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:42:45] [INFO ] Deduced a trap composed of 167 places in 278 ms of which 4 ms to minimize.
[2024-05-28 14:42:46] [INFO ] Deduced a trap composed of 159 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:42:46] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:42:47] [INFO ] Deduced a trap composed of 169 places in 262 ms of which 3 ms to minimize.
[2024-05-28 14:42:51] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 3 ms to minimize.
[2024-05-28 14:42:53] [INFO ] Deduced a trap composed of 155 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:42:54] [INFO ] Deduced a trap composed of 147 places in 241 ms of which 3 ms to minimize.
[2024-05-28 14:42:54] [INFO ] Deduced a trap composed of 158 places in 280 ms of which 3 ms to minimize.
[2024-05-28 14:42:56] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:42:57] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 229 places in 237 ms of which 3 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 150 places in 237 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1472 variables, and 61 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1046/1046 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1046 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:43:13] [INFO ] Deduced a trap composed of 262 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:43:13] [INFO ] Deduced a trap composed of 267 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:43:14] [INFO ] Deduced a trap composed of 276 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:43:14] [INFO ] Deduced a trap composed of 281 places in 209 ms of which 5 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 264 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:43:16] [INFO ] Deduced a trap composed of 269 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:43:17] [INFO ] Deduced a trap composed of 264 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:43:17] [INFO ] Deduced a trap composed of 273 places in 251 ms of which 3 ms to minimize.
[2024-05-28 14:43:21] [INFO ] Deduced a trap composed of 184 places in 268 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:43:36] [INFO ] Deduced a trap composed of 221 places in 259 ms of which 3 ms to minimize.
[2024-05-28 14:43:36] [INFO ] Deduced a trap composed of 238 places in 215 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1472 variables, and 72 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1046 constraints, Known Traps: 30/30 constraints]
After SMT, in 61719ms problems are : Problem set: 0 solved, 1046 unsolved
Search for dead transitions found 0 dead transitions in 61736ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68686 ms. Remains : 440/440 places, 1048/1048 transitions.
[2024-05-28 14:43:38] [INFO ] Flatten gal took : 78 ms
[2024-05-28 14:43:39] [INFO ] Flatten gal took : 55 ms
[2024-05-28 14:43:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14369796422830437101.gal : 8 ms
[2024-05-28 14:43:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6599736094670582484.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14369796422830437101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6599736094670582484.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (16 resets) in 537 ms. (74 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6599736094670582484.prop.
BEST_FIRST walk for 40003 steps (9 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 38
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :38 after 55
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :55 after 72
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :72 after 80
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :80 after 432
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :432 after 735
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :735 after 1432
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1432 after 3208
Interrupted probabilistic random walk after 245301 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 245301 steps, saw 136756 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-28 14:43:42] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:43:42] [INFO ] Invariant cache hit.
[2024-05-28 14:43:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:43:42] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:43:42] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:43:42] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:43:42] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:43:42] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:43:43] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1032/1470 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1470 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1470 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1472 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1472 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1472 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1472 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1472/1472 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1513 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:43:44] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1032/1470 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1470 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1470 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1470 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1472 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1472 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:43:45] [INFO ] Deduced a trap composed of 173 places in 274 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1472 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1472 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1472 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1472/1472 variables, and 590 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3997ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 671 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1048/1048 transitions.
Applied a total of 0 rules in 16 ms. Remains 440 /440 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Running 1046 sub problems to find dead transitions.
[2024-05-28 14:43:46] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:43:46] [INFO ] Invariant cache hit.
[2024-05-28 14:43:46] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3208 after 6540
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:43:55] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:43:56] [INFO ] Deduced a trap composed of 167 places in 225 ms of which 3 ms to minimize.
[2024-05-28 14:43:56] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 4 ms to minimize.
[2024-05-28 14:43:56] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:43:57] [INFO ] Deduced a trap composed of 169 places in 228 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6540 after 17140
[2024-05-28 14:44:01] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 3 ms to minimize.
[2024-05-28 14:44:03] [INFO ] Deduced a trap composed of 155 places in 239 ms of which 3 ms to minimize.
[2024-05-28 14:44:03] [INFO ] Deduced a trap composed of 147 places in 228 ms of which 3 ms to minimize.
[2024-05-28 14:44:04] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 4 ms to minimize.
[2024-05-28 14:44:05] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:44:07] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.0)
(s139 0.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 9.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.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 1.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 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.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 1.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 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 4.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 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 438/1472 variables, and 59 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1046/1046 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1046 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:44:18] [INFO ] Deduced a trap composed of 150 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:44:20] [INFO ] Deduced a trap composed of 186 places in 245 ms of which 3 ms to minimize.
[2024-05-28 14:44:20] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :17140 after 54524
[2024-05-28 14:44:24] [INFO ] Deduced a trap composed of 194 places in 285 ms of which 3 ms to minimize.
[2024-05-28 14:44:25] [INFO ] Deduced a trap composed of 182 places in 251 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 14:44:29] [INFO ] Flatten gal took : 35 ms
[2024-05-28 14:44:29] [INFO ] Applying decomposition
[2024-05-28 14:44:29] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6101874493853480474.txt' '-o' '/tmp/graph6101874493853480474.bin' '-w' '/tmp/graph6101874493853480474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6101874493853480474.bin' '-l' '-1' '-v' '-w' '/tmp/graph6101874493853480474.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:44:29] [INFO ] Decomposing Gal with order
[2024-05-28 14:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1472 variables, and 64 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1046 constraints, Known Traps: 22/22 constraints]
After SMT, in 42350ms problems are : Problem set: 0 solved, 1046 unsolved
Search for dead transitions found 0 dead transitions in 42363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42381 ms. Remains : 440/440 places, 1048/1048 transitions.
[2024-05-28 14:44:29] [INFO ] Removed a total of 813 redundant transitions.
[2024-05-28 14:44:29] [INFO ] Flatten gal took : 118 ms
[2024-05-28 14:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 538 labels/synchronizations in 56 ms.
RANDOM walk for 40000 steps (25 resets) in 832 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
[2024-05-28 14:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16448244355994337330.gal : 29 ms
[2024-05-28 14:44:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5961603049621233701.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16448244355994337330.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5961603049621233701.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (12 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5961603049621233701.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 710
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :710 after 1410
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1410 after 3822
Interrupted probabilistic random walk after 245522 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 245522 steps, saw 136874 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-28 14:44:32] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:44:32] [INFO ] Invariant cache hit.
[2024-05-28 14:44:32] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:44:33] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 5 ms to minimize.
[2024-05-28 14:44:33] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-28 14:44:33] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:44:33] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:44:33] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:44:33] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/435 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/438 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3822 after 8930
At refinement iteration 14 (OVERLAPS) 1032/1470 variables, 438/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1470 variables, 96/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1470 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1472 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1472 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1472 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1472 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1472/1472 variables, and 586 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 167/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/200 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/214 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/431 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:44:34] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1032/1470 variables, 438/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1470 variables, 96/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1470 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1470 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1472 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1472 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 14:44:36] [INFO ] Deduced a trap composed of 173 places in 284 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1472 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1472 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1472 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1472/1472 variables, and 590 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 440/440 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 4577ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 768 ms.
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1048/1048 transitions.
Applied a total of 0 rules in 17 ms. Remains 440 /440 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 440/440 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1048/1048 transitions.
Applied a total of 0 rules in 27 ms. Remains 440 /440 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-28 14:44:38] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:44:38] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8930 after 22774
[2024-05-28 14:44:38] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-28 14:44:38] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:44:38] [INFO ] Invariant cache hit.
[2024-05-28 14:44:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 14:44:45] [INFO ] Implicit Places using invariants and state equation in 6685 ms returned []
Implicit Place search using SMT with State Equation took 7064 ms to find 0 implicit places.
[2024-05-28 14:44:45] [INFO ] Redundant transitions in 17 ms returned []
Running 1046 sub problems to find dead transitions.
[2024-05-28 14:44:45] [INFO ] Flow matrix only has 1032 transitions (discarded 16 similar events)
[2024-05-28 14:44:45] [INFO ] Invariant cache hit.
[2024-05-28 14:44:45] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:44:53] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:44:53] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:44:53] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2024-05-28 14:44:53] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2024-05-28 14:44:53] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2024-05-28 14:44:54] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:44:54] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:44:54] [INFO ] Deduced a trap composed of 167 places in 239 ms of which 2 ms to minimize.
[2024-05-28 14:44:54] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:44:54] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:44:55] [INFO ] Deduced a trap composed of 169 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:44:59] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 3 ms to minimize.
[2024-05-28 14:45:01] [INFO ] Deduced a trap composed of 155 places in 244 ms of which 3 ms to minimize.
[2024-05-28 14:45:01] [INFO ] Deduced a trap composed of 147 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:45:02] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:45:03] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:45:05] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:45:10] [INFO ] Deduced a trap composed of 229 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:45:10] [INFO ] Deduced a trap composed of 150 places in 208 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :22774 after 57569
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1472 variables, and 61 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1046/1046 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1046 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
Detected timeout of ITS tools.
[2024-05-28 14:45:22] [INFO ] Deduced a trap composed of 262 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:45:22] [INFO ] Deduced a trap composed of 267 places in 253 ms of which 3 ms to minimize.
[2024-05-28 14:45:22] [INFO ] Deduced a trap composed of 276 places in 233 ms of which 3 ms to minimize.
[2024-05-28 14:45:22] [INFO ] Deduced a trap composed of 281 places in 256 ms of which 3 ms to minimize.
[2024-05-28 14:45:25] [INFO ] Deduced a trap composed of 264 places in 236 ms of which 3 ms to minimize.
[2024-05-28 14:45:25] [INFO ] Deduced a trap composed of 269 places in 272 ms of which 2 ms to minimize.
[2024-05-28 14:45:25] [INFO ] Deduced a trap composed of 264 places in 263 ms of which 3 ms to minimize.
[2024-05-28 14:45:26] [INFO ] Deduced a trap composed of 273 places in 271 ms of which 4 ms to minimize.
[2024-05-28 14:45:30] [INFO ] Deduced a trap composed of 184 places in 287 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1046 unsolved
[2024-05-28 14:45:45] [INFO ] Deduced a trap composed of 221 places in 311 ms of which 3 ms to minimize.
[2024-05-28 14:45:46] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/1472 variables, and 72 constraints, problems are : Problem set: 0 solved, 1046 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/440 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1046 constraints, Known Traps: 30/30 constraints]
After SMT, in 62107ms problems are : Problem set: 0 solved, 1046 unsolved
Search for dead transitions found 0 dead transitions in 62124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69244 ms. Remains : 440/440 places, 1048/1048 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for PolyORBLF-COL-S02J06T08-UpperBounds-14 in 254741 ms.
[2024-05-28 14:45:47] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:45:47] [INFO ] Applying decomposition
[2024-05-28 14:45:47] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13402953876090029615.txt' '-o' '/tmp/graph13402953876090029615.bin' '-w' '/tmp/graph13402953876090029615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13402953876090029615.bin' '-l' '-1' '-v' '-w' '/tmp/graph13402953876090029615.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:45:47] [INFO ] Decomposing Gal with order
[2024-05-28 14:45:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:45:47] [INFO ] Removed a total of 1017 redundant transitions.
[2024-05-28 14:45:47] [INFO ] Flatten gal took : 99 ms
[2024-05-28 14:45:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 647 labels/synchronizations in 23 ms.
[2024-05-28 14:45:47] [INFO ] Time to serialize gal into /tmp/UpperBounds5726801381767297472.gal : 6 ms
[2024-05-28 14:45:47] [INFO ] Time to serialize properties into /tmp/UpperBounds6369357829195024065.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5726801381767297472.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6369357829195024065.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds6369357829195024065.prop.
ITS-tools command line returned an error code 137
[2024-05-28 14:55:52] [INFO ] Applying decomposition
[2024-05-28 14:55:52] [INFO ] Flatten gal took : 57 ms
[2024-05-28 14:55:52] [INFO ] Decomposing Gal with order
[2024-05-28 14:55:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:55:52] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, P_1113_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, Check_Sources_B_0, Check_Sources_E_0, P_1617_0],[AwakeTasks_1, IdleTasks_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, P_1113_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, Check_Sources_B_1, Check_Sources_E_1, P_1617_1],[AwakeTasks_2, IdleTasks_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, P_1113_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, Check_Sources_B_2, Check_Sources_E_2, P_1617_2],[AwakeTasks_3, IdleTasks_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, P_1113_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, Check_Sources_B_3, Check_Sources_E_3, P_1617_3],[AwakeTasks_4, IdleTasks_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, P_1113_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, Check_Sources_B_4, Check_Sources_E_4, P_1617_4],[AwakeTasks_5, IdleTasks_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, P_1113_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, Check_Sources_B_5, Check_Sources_E_5, P_1617_5],[AwakeTasks_6, IdleTasks_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, P_1113_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, Check_Sources_B_6, Check_Sources_E_6, P_1617_6],[AwakeTasks_7, IdleTasks_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, P_1113_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, Check_Sources_B_7, Check_Sources_E_7, P_1617_7],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[Insert_Source_B_0, P_1119_0, P_2579_0],[Insert_Source_B_1, P_1119_1, P_2579_1],[Insert_Source_B_2, P_1119_2, P_2579_2],[Insert_Source_B_3, P_1119_3, P_2579_3],[Insert_Source_B_4, P_1119_4, P_2579_4],[Insert_Source_B_5, P_1119_5, P_2579_5],[Insert_Source_B_6, P_1119_6, P_2579_6],[Insert_Source_B_7, P_1119_7, P_2579_7],[Insert_Source_B_8, P_1119_8, P_2579_8],[Insert_Source_B_9, P_1119_9, P_2579_9],[Insert_Source_B_10, P_1119_10, P_2579_10],[Insert_Source_B_11, P_1119_11, P_2579_11],[Insert_Source_B_12, P_1119_12, P_2579_12],[Insert_Source_B_13, P_1119_13, P_2579_13],[Insert_Source_B_14, P_1119_14, P_2579_14],[Insert_Source_B_15, P_1119_15, P_2579_15],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 14:55:52] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:55:52] [INFO ] Time to serialize gal into /tmp/UpperBounds4702832616271338688.gal : 8 ms
[2024-05-28 14:55:52] [INFO ] Time to serialize properties into /tmp/UpperBounds7216755685161319399.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4702832616271338688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7216755685161319399.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds7216755685161319399.prop.
ITS-tools command line returned an error code 137
[2024-05-28 15:06:52] [INFO ] Flatten gal took : 52 ms
[2024-05-28 15:06:52] [INFO ] Input system was already deterministic with 1056 transitions.
[2024-05-28 15:06:52] [INFO ] Transformed 448 places.
[2024-05-28 15:06:52] [INFO ] Transformed 1056 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 15:07:22] [INFO ] Time to serialize gal into /tmp/UpperBounds4217206050189572553.gal : 8 ms
[2024-05-28 15:07:22] [INFO ] Time to serialize properties into /tmp/UpperBounds1117176027172470142.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4217206050189572553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1117176027172470142.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1117176027172470142.prop.
ITS-tools command line returned an error code 137
Total runtime 2889763 ms.

BK_STOP 1716909503640

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446400109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;