About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8208.119 | 1195678.00 | 1595378.00 | 712.80 | 2 2 6 1 1 5 1 1 1 1 1 5 2 10 1 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-171654446400101.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-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446400101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 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-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716906032697
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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 14:20:35] [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:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:20:35] [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:20:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 14:20:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1104 ms
[2024-05-28 14:20:36] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 73 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2024-05-28 14:20:36] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-28 14:20:36] [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:20:36] [INFO ] Computed 26 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 5, 0, 10, 0, 0] Max Struct:[26, 20, 6, 6, 1, 6, 1, 2, 2, 6, 6, 6, 26, 18, 1, 2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 14:20:36] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 14:20:36] [INFO ] Computed 26 invariants in 19 ms
[2024-05-28 14:20:37] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2024-05-28 14:20:37] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2024-05-28 14:20:37] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-28 14:20:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 14:20:37] [INFO ] [Real]Added 8 Read/Feed constraints in 39 ms returned sat
[2024-05-28 14:20:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-05-28 14:20:37] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:20:37] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-28 14:20:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-28 14:20:37] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 38 ms.
[2024-05-28 14:20:37] [INFO ] Added : 24 causal constraints over 5 iterations in 160 ms. Result :sat
Minimization took 70 ms.
[2024-05-28 14:20:37] [INFO ] [Real]Absence check using 11 positive place invariants in 82 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 108 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-28 14:20:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:20:38] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 14:20:38] [INFO ] Added : 54 causal constraints over 11 iterations in 142 ms. Result :sat
Minimization took 42 ms.
[2024-05-28 14:20:38] [INFO ] [Real]Absence check using 11 positive place invariants in 79 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 91 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-28 14:20:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-28 14:20:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:20:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 14:20:39] [INFO ] Added : 43 causal constraints over 10 iterations in 172 ms. Result :sat
Minimization took 36 ms.
[2024-05-28 14:20:39] [INFO ] [Real]Absence check using 11 positive place invariants in 39 ms returned sat
[2024-05-28 14:20:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 14:20:39] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-05-28 14:20:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 14:20:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:40] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-28 14:20:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-28 14:20:40] [INFO ] Deduced a trap composed of 18 places in 498 ms of which 32 ms to minimize.
[2024-05-28 14:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 548 ms
[2024-05-28 14:20:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-28 14:20:40] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2024-05-28 14:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-28 14:20:40] [INFO ] Added : 59 causal constraints over 12 iterations in 206 ms. Result :sat
Minimization took 33 ms.
[2024-05-28 14:20:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 14:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 14:20:41] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 73 ms
[2024-05-28 14:20:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-28 14:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:20:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 14:20:41] [INFO ] Added : 34 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 14:20:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 29 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 14:20:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:20:42] [INFO ] Deduced a trap composed of 23 places in 1098 ms of which 25 ms to minimize.
[2024-05-28 14:20:42] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1183 ms
[2024-05-28 14:20:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-28 14:20:43] [INFO ] Added : 57 causal constraints over 12 iterations in 124 ms. Result :sat
Minimization took 33 ms.
[2024-05-28 14:20:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 14:20:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 14:20:43] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-28 14:20:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 14:20:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-05-28 14:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-28 14:20:43] [INFO ] Added : 54 causal constraints over 11 iterations in 162 ms. Result :sat
Minimization took 21 ms.
[2024-05-28 14:20:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 14:20:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-28 14:20:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:20:43] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-28 14:20:43] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-28 14:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-28 14:20:43] [INFO ] Added : 60 causal constraints over 14 iterations in 315 ms. Result :sat
Minimization took 53 ms.
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-28 14:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 18 ms returned sat
[2024-05-28 14:20:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 14:20:44] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-28 14:20:44] [INFO ] Added : 21 causal constraints over 5 iterations in 120 ms. Result :sat
Minimization took 21 ms.
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 14:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 14:20:44] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 14:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 14:20:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-28 14:20:44] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 14:20:44] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 20 ms.
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned unsat
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 14:20:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 14:20:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 14:20:45] [INFO ] Added : 54 causal constraints over 11 iterations in 84 ms. Result :sat
Minimization took 27 ms.
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 14:20:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-28 14:20:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2024-05-28 14:20:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 14:20:45] [INFO ] Added : 58 causal constraints over 12 iterations in 116 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 5, 0, 10, 0, 0] Max Struct:[26, 20, 6, 6, 5, 1, 2, 2, 6, 6, 5, 26, 10, 1, 2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 14:20:45] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 47 ms.
[2024-05-28 14:20:45] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
[2024-05-28 14:20:45] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-28 14:20:45] [INFO ] Computed 50 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[26, 20, 6, 6, 1, 2, 2, 6, 6, 26, 1, 2]
RANDOM walk for 10000 steps (2 resets) in 170 ms. (58 steps per ms)
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90005 steps (21 resets) in 412 ms. (217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1] Max Struct:[26, 20, 6, 2, 2, 6, 6, 26, 2]
[2024-05-28 14:20:46] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 14:20:46] [INFO ] Invariant cache hit.
[2024-05-28 14:20:46] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 14:20:46] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 21 ms returned sat
[2024-05-28 14:20:46] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-28 14:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 14:20:47] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 25 ms returned sat
[2024-05-28 14:20:47] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-28 14:20:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:20:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 492 ms returned sat
[2024-05-28 14:20:48] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 124 ms.
[2024-05-28 14:20:49] [INFO ] Added : 77 causal constraints over 16 iterations in 1677 ms. Result :sat
Minimization took 600 ms.
[2024-05-28 14:20:50] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2024-05-28 14:20:50] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 29 ms returned sat
[2024-05-28 14:20:51] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2024-05-28 14:20:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 14:20:51] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 12 ms returned sat
[2024-05-28 14:20:51] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-05-28 14:20:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 400 ms returned sat
[2024-05-28 14:20:52] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 70 ms.
[2024-05-28 14:20:53] [INFO ] Added : 80 causal constraints over 16 iterations in 1259 ms. Result :sat
Minimization took 751 ms.
[2024-05-28 14:20:54] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2024-05-28 14:20:54] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 9 ms returned unsat
[2024-05-28 14:20:54] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 14:20:54] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 18 ms returned sat
[2024-05-28 14:20:54] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-05-28 14:20:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 14:20:55] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 18 ms returned sat
[2024-05-28 14:20:56] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2024-05-28 14:20:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 282 ms returned sat
[2024-05-28 14:20:56] [INFO ] Deduced a trap composed of 73 places in 336 ms of which 4 ms to minimize.
[2024-05-28 14:20:56] [INFO ] Deduced a trap composed of 137 places in 244 ms of which 5 ms to minimize.
[2024-05-28 14:20:57] [INFO ] Deduced a trap composed of 74 places in 230 ms of which 3 ms to minimize.
[2024-05-28 14:20:57] [INFO ] Deduced a trap composed of 149 places in 268 ms of which 4 ms to minimize.
[2024-05-28 14:20:57] [INFO ] Deduced a trap composed of 133 places in 303 ms of which 4 ms to minimize.
[2024-05-28 14:20:58] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 2 ms to minimize.
[2024-05-28 14:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1938 ms
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 13 ms returned unsat
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 13 ms returned unsat
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 24 ms returned unsat
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 14:20:58] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 31 ms returned sat
[2024-05-28 14:20:59] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2024-05-28 14:20:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:20:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 14:20:59] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 21 ms returned sat
[2024-05-28 14:21:00] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2024-05-28 14:21:00] [INFO ] [Nat]Added 72 Read/Feed constraints in 280 ms returned sat
[2024-05-28 14:21:00] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 104 ms.
[2024-05-28 14:21:02] [INFO ] Added : 207 causal constraints over 42 iterations in 2567 ms. Result :sat
Minimization took 702 ms.
[2024-05-28 14:21:03] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 14:21:03] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 1, 1, 1, 1, 1, 2, 1] Max Struct:[26, 20, 1, 1, 1, 1, 1, 26, 1]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 534 transition count 920
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 486 transition count 920
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 98 place count 486 transition count 860
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 218 place count 426 transition count 860
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 302 place count 384 transition count 818
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 384 transition count 812
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 314 place count 378 transition count 812
Applied a total of 314 rules in 177 ms. Remains 378 /536 variables (removed 158) and now considering 812/968 (removed 156) transitions.
Running 810 sub problems to find dead transitions.
[2024-05-28 14:21:03] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 378 cols
[2024-05-28 14:21:04] [INFO ] Computed 48 invariants in 23 ms
[2024-05-28 14:21:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 810 unsolved
[2024-05-28 14:21:10] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:21:10] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:21:10] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:21:10] [INFO ] Deduced a trap composed of 48 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:21:10] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:21:10] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:21:10] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 810 unsolved
SMT process timed out in 21655ms, After SMT, problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 21685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21882 ms. Remains : 378/536 places, 812/968 transitions.
[2024-05-28 14:21:25] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:21:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (495 resets) in 3646 ms. (274 steps per ms)
BEST_FIRST walk for 3000001 steps (635 resets) in 5006 ms. (599 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-05-28 14:21:34] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:21:34] [INFO ] Invariant cache hit.
[2024-05-28 14:21:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 14:21:34] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 21 ms returned sat
[2024-05-28 14:21:34] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2024-05-28 14:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:21:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 14:21:34] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 25 ms returned sat
[2024-05-28 14:21:35] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2024-05-28 14:21:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:21:35] [INFO ] [Nat]Added 72 Read/Feed constraints in 463 ms returned sat
[2024-05-28 14:21:35] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 91 ms.
[2024-05-28 14:21:37] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 3 ms to minimize.
[2024-05-28 14:21:37] [INFO ] Deduced a trap composed of 135 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:21:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 754 ms
[2024-05-28 14:21:37] [INFO ] Added : 85 causal constraints over 18 iterations in 2212 ms. Result :sat
Minimization took 3499 ms.
[2024-05-28 14:21:41] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 14:21:41] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 20 ms returned sat
[2024-05-28 14:21:41] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2024-05-28 14:21:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:21:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-28 14:21:41] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 14 ms returned sat
[2024-05-28 14:21:42] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2024-05-28 14:21:42] [INFO ] [Nat]Added 72 Read/Feed constraints in 252 ms returned sat
[2024-05-28 14:21:42] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 64 ms.
[2024-05-28 14:21:44] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 3 ms to minimize.
[2024-05-28 14:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2024-05-28 14:21:44] [INFO ] Added : 94 causal constraints over 19 iterations in 2190 ms. Result :sat
Minimization took 3543 ms.
[2024-05-28 14:21:48] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-28 14:21:48] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 13 ms returned sat
[2024-05-28 14:21:48] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-28 14:21:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:21:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 14:21:48] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 25 ms returned sat
[2024-05-28 14:21:49] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-28 14:21:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 442 ms returned sat
[2024-05-28 14:21:49] [INFO ] Computed and/alt/rep : 462/2050/456 causal constraints (skipped 342 transitions) in 71 ms.
[2024-05-28 14:21:51] [INFO ] Deduced a trap composed of 113 places in 234 ms of which 3 ms to minimize.
[2024-05-28 14:21:51] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-05-28 14:21:51] [INFO ] Deduced a trap composed of 138 places in 222 ms of which 3 ms to minimize.
[2024-05-28 14:21:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1287 ms
[2024-05-28 14:21:52] [INFO ] Added : 94 causal constraints over 20 iterations in 2811 ms. Result :sat
Minimization took 3995 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 812/812 transitions.
Applied a total of 0 rules in 23 ms. Remains 378 /378 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 378/378 places, 812/812 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 812/812 transitions.
Applied a total of 0 rules in 18 ms. Remains 378 /378 variables (removed 0) and now considering 812/812 (removed 0) transitions.
[2024-05-28 14:21:58] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2024-05-28 14:21:58] [INFO ] Invariant cache hit.
[2024-05-28 14:21:58] [INFO ] Implicit Places using invariants in 394 ms returned [342, 343, 344, 345, 346, 347]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 401 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 372/378 places, 812/812 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 366 transition count 806
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 366 transition count 806
Applied a total of 12 rules in 64 ms. Remains 366 /372 variables (removed 6) and now considering 806/812 (removed 6) transitions.
[2024-05-28 14:21:59] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2024-05-28 14:21:59] [INFO ] Computed 42 invariants in 25 ms
[2024-05-28 14:21:59] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-28 14:21:59] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:21:59] [INFO ] Invariant cache hit.
[2024-05-28 14:21:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:22:02] [INFO ] Implicit Places using invariants and state equation in 3212 ms returned []
Implicit Place search using SMT with State Equation took 3535 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 366/378 places, 806/812 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4025 ms. Remains : 366/378 places, 806/812 transitions.
[2024-05-28 14:22:02] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:22:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (451 resets) in 3245 ms. (308 steps per ms)
BEST_FIRST walk for 3000001 steps (596 resets) in 4258 ms. (704 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-05-28 14:22:10] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:22:10] [INFO ] Invariant cache hit.
[2024-05-28 14:22:10] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 14:22:10] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 22 ms returned sat
[2024-05-28 14:22:10] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-05-28 14:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:22:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 14:22:10] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 20 ms returned sat
[2024-05-28 14:22:10] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-28 14:22:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:22:11] [INFO ] [Nat]Added 72 Read/Feed constraints in 337 ms returned sat
[2024-05-28 14:22:11] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 60 ms.
[2024-05-28 14:22:12] [INFO ] Added : 106 causal constraints over 22 iterations in 1580 ms. Result :sat
Minimization took 2053 ms.
[2024-05-28 14:22:14] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 14:22:14] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 22 ms returned sat
[2024-05-28 14:22:15] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2024-05-28 14:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:22:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 14:22:15] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 22 ms returned sat
[2024-05-28 14:22:15] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2024-05-28 14:22:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 101 ms returned sat
[2024-05-28 14:22:16] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 70 ms.
[2024-05-28 14:22:17] [INFO ] Deduced a trap composed of 134 places in 216 ms of which 3 ms to minimize.
[2024-05-28 14:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2024-05-28 14:22:17] [INFO ] Added : 90 causal constraints over 18 iterations in 1636 ms. Result :sat
Minimization took 2530 ms.
[2024-05-28 14:22:20] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 14:22:20] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 14 ms returned sat
[2024-05-28 14:22:20] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-05-28 14:22:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:22:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 14:22:20] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 29 ms returned sat
[2024-05-28 14:22:21] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2024-05-28 14:22:21] [INFO ] [Nat]Added 72 Read/Feed constraints in 480 ms returned sat
[2024-05-28 14:22:21] [INFO ] Computed and/alt/rep : 456/2043/450 causal constraints (skipped 342 transitions) in 80 ms.
[2024-05-28 14:22:24] [INFO ] Added : 91 causal constraints over 19 iterations in 2471 ms. Result :sat
Minimization took 2365 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 17 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 366/366 places, 806/806 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Applied a total of 0 rules in 16 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
[2024-05-28 14:22:27] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:22:27] [INFO ] Invariant cache hit.
[2024-05-28 14:22:28] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-28 14:22:28] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:22:28] [INFO ] Invariant cache hit.
[2024-05-28 14:22:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:22:31] [INFO ] Implicit Places using invariants and state equation in 3327 ms returned []
Implicit Place search using SMT with State Equation took 3670 ms to find 0 implicit places.
[2024-05-28 14:22:31] [INFO ] Redundant transitions in 41 ms returned []
Running 804 sub problems to find dead transitions.
[2024-05-28 14:22:31] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-28 14:22:31] [INFO ] Invariant cache hit.
[2024-05-28 14:22:31] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-28 14:22:37] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:22:37] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:22:37] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-28 14:22:37] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:22:37] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 6 ms to minimize.
[2024-05-28 14:22:37] [INFO ] Deduced a trap composed of 125 places in 206 ms of which 3 ms to minimize.
[2024-05-28 14:22:38] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/365 variables, 1/48 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-28 14:22:52] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:22:52] [INFO ] Deduced a trap composed of 134 places in 203 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 2/50 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-28 14:22:58] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/51 constraints. Problems are: Problem set: 36 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/1160 variables, and 51 constraints, problems are : Problem set: 36 solved, 768 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 36 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 27/40 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 10/50 constraints. Problems are: Problem set: 36 solved, 768 unsolved
[2024-05-28 14:23:04] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:23:09] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 3 ms to minimize.
[2024-05-28 14:23:10] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/53 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/53 constraints. Problems are: Problem set: 36 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/54 constraints. Problems are: Problem set: 36 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1160 variables, and 54 constraints, problems are : Problem set: 36 solved, 768 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 13/13 constraints]
After SMT, in 61223ms problems are : Problem set: 36 solved, 768 unsolved
Search for dead transitions found 36 dead transitions in 61232ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 366/366 places, 770/806 transitions.
Applied a total of 0 rules in 15 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-05-28 14:23:32] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65020 ms. Remains : 366/366 places, 770/806 transitions.
[2024-05-28 14:23:32] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-05-28 14:23:32] [INFO ] Computed 42 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
RANDOM walk for 1000000 steps (512 resets) in 2646 ms. (377 steps per ms)
BEST_FIRST walk for 3000003 steps (619 resets) in 3931 ms. (762 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
[2024-05-28 14:23:39] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:23:39] [INFO ] Invariant cache hit.
[2024-05-28 14:23:39] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 14:23:39] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-28 14:23:40] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2024-05-28 14:23:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:23:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 14:23:40] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-28 14:23:40] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-05-28 14:23:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:23:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 467 ms returned sat
[2024-05-28 14:23:41] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 66 ms.
[2024-05-28 14:23:42] [INFO ] Added : 123 causal constraints over 25 iterations in 1146 ms. Result :sat
Minimization took 2279 ms.
[2024-05-28 14:23:44] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 14:23:44] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 14:23:45] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-28 14:23:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:23:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 14:23:45] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 14:23:45] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-05-28 14:23:45] [INFO ] [Nat]Added 72 Read/Feed constraints in 318 ms returned sat
[2024-05-28 14:23:45] [INFO ] Deduced a trap composed of 117 places in 223 ms of which 3 ms to minimize.
[2024-05-28 14:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2024-05-28 14:23:46] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 58 ms.
[2024-05-28 14:23:48] [INFO ] Added : 65 causal constraints over 14 iterations in 2068 ms. Result :sat
Minimization took 2350 ms.
[2024-05-28 14:23:50] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 14:23:50] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-28 14:23:50] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-05-28 14:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:23:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 14:23:51] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-28 14:23:51] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2024-05-28 14:23:51] [INFO ] [Nat]Added 72 Read/Feed constraints in 322 ms returned sat
[2024-05-28 14:23:51] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 58 ms.
[2024-05-28 14:23:52] [INFO ] Added : 64 causal constraints over 13 iterations in 709 ms. Result :sat
Minimization took 1960 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 13 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 366/366 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 23 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-05-28 14:23:56] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:23:56] [INFO ] Invariant cache hit.
[2024-05-28 14:23:56] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-28 14:23:56] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:23:56] [INFO ] Invariant cache hit.
[2024-05-28 14:23:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:24:02] [INFO ] Implicit Places using invariants and state equation in 5535 ms returned []
Implicit Place search using SMT with State Equation took 5853 ms to find 0 implicit places.
[2024-05-28 14:24:02] [INFO ] Redundant transitions in 18 ms returned []
Running 768 sub problems to find dead transitions.
[2024-05-28 14:24:02] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:24:02] [INFO ] Invariant cache hit.
[2024-05-28 14:24:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 14:24:06] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:24:06] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:24:06] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:24:06] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:24:07] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:24:07] [INFO ] Deduced a trap composed of 119 places in 196 ms of which 2 ms to minimize.
[2024-05-28 14:24:07] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:24:07] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:24:08] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:24:08] [INFO ] Deduced a trap composed of 119 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:24:08] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 3 ms to minimize.
[2024-05-28 14:24:08] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:24:09] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-28 14:24:10] [INFO ] Deduced a trap composed of 166 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 14:24:13] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:24:14] [INFO ] Deduced a trap composed of 181 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:24:14] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
SMT process timed out in 31041ms, After SMT, problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 31057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36967 ms. Remains : 366/366 places, 770/770 transitions.
[2024-05-28 14:24:33] [INFO ] Flatten gal took : 238 ms
RANDOM walk for 40001 steps (24 resets) in 1472 ms. (27 steps per ms) remains 6/6 properties
[2024-05-28 14:24:33] [INFO ] Flatten gal took : 84 ms
[2024-05-28 14:24:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3620708100588293527.gal : 33 ms
[2024-05-28 14:24:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12154680084872657476.prop : 2 ms
BEST_FIRST walk for 40001 steps (9 resets) in 319 ms. (125 steps per ms) remains 6/6 properties
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/ReachabilityCardinality3620708100588293527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12154680084872657476.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 (13 resets) in 291 ms. (136 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality12154680084872657476.prop.
BEST_FIRST walk for 40002 steps (18 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (13 resets) in 490 ms. (81 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :7 after 10
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :10 after 64
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :64 after 80
BEST_FIRST walk for 40001 steps (16 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (13 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :430 after 1851
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1851 after 5596
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5596 after 5827
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :5827 after 9846
Interrupted probabilistic random walk after 129276 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 6
Probabilistic random walk after 129276 steps, saw 69328 distinct states, run finished after 3006 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-28 14:24:37] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:24:37] [INFO ] Invariant cache hit.
[2024-05-28 14:24:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/349 variables, 12/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/364 variables, 15/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 758/1122 variables, 364/405 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1122 variables, 72/477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/477 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1124 variables, 2/479 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 1/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 480 constraints, problems are : Problem set: 3 solved, 3 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 14:24:38] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:24:38] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:24:39] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 3/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 13/349 variables, 12/29 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 14:24:39] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:24:39] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/364 variables, 15/46 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 14:24:39] [INFO ] Deduced a trap composed of 124 places in 333 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/47 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 14:24:39] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/48 constraints. Problems are: Problem set: 3 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :9846 after 68912
[2024-05-28 14:24:40] [INFO ] Deduced a trap composed of 145 places in 747 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 758/1122 variables, 364/413 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 72/485 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 3/488 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 0/488 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1124 variables, 2/490 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1124 variables, 1/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :68912 after 112708
After SMT solving in domain Int declared 1124/1124 variables, and 491 constraints, problems are : Problem set: 3 solved, 3 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 5939ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 4242 ms.
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 50 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Running 768 sub problems to find dead transitions.
[2024-05-28 14:24:47] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:24:47] [INFO ] Invariant cache hit.
[2024-05-28 14:24:47] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :112708 after 194344
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 14:24:54] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:24:55] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 47 places in 819 ms of which 0 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:24:56] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:24:57] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:24:57] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:24:57] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:24:58] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :194344 after 291066
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 14:25:01] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:25:02] [INFO ] Deduced a trap composed of 181 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:25:02] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/1124 variables, and 57 constraints, problems are : Problem set: 0 solved, 768 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 14:25:10] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:25:10] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:25:10] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:25:12] [INFO ] Deduced a trap composed of 170 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:25:13] [INFO ] Deduced a trap composed of 222 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:25:14] [INFO ] Deduced a trap composed of 176 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:25:14] [INFO ] Deduced a trap composed of 181 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:25:15] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:25:15] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Detected timeout of ITS tools.
[2024-05-28 14:25:24] [INFO ] Flatten gal took : 109 ms
[2024-05-28 14:25:24] [INFO ] Applying decomposition
[2024-05-28 14:25:24] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1126425924155083323.txt' '-o' '/tmp/graph1126425924155083323.bin' '-w' '/tmp/graph1126425924155083323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1126425924155083323.bin' '-l' '-1' '-v' '-w' '/tmp/graph1126425924155083323.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:25:24] [INFO ] Decomposing Gal with order
[2024-05-28 14:25:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:25:25] [INFO ] Removed a total of 667 redundant transitions.
[2024-05-28 14:25:25] [INFO ] Flatten gal took : 427 ms
[2024-05-28 14:25:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 481 labels/synchronizations in 77 ms.
[2024-05-28 14:25:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1330547039974450202.gal : 39 ms
[2024-05-28 14:25:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17481960763607211616.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/ReachabilityCardinality1330547039974450202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17481960763607211616.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/ReachabilityCardinality17481960763607211616.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 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 38
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :38 after 132
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :132 after 322
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :322 after 467
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :467 after 787
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :787 after 1410
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1410 after 3520
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3520 after 14990
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 768 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :14990 after 28581
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1124 variables, and 67 constraints, problems are : Problem set: 0 solved, 768 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/768 constraints, Known Traps: 26/26 constraints]
After SMT, in 41111ms problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 41134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41187 ms. Remains : 366/366 places, 770/770 transitions.
RANDOM walk for 40000 steps (25 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (11 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (13 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :41128 after 54216
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :54216 after 174152
Interrupted probabilistic random walk after 202382 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 202382 steps, saw 103189 distinct states, run finished after 3003 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-28 14:25:32] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:25:32] [INFO ] Invariant cache hit.
[2024-05-28 14:25:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/349 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/364 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 758/1122 variables, 364/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1122 variables, 72/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1124 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1124 variables, and 480 constraints, problems are : Problem set: 0 solved, 3 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 318/336 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:25:33] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 2 ms to minimize.
[2024-05-28 14:25:33] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:25:33] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 13/349 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:25:34] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:25:34] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/364 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:25:35] [INFO ] Deduced a trap composed of 124 places in 206 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:25:35] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 14:25:35] [INFO ] Deduced a trap composed of 145 places in 306 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 758/1122 variables, 364/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1122 variables, 72/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1122 variables, 3/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :174152 after 319268
At refinement iteration 15 (INCLUDED_ONLY) 0/1122 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1124 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1124 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1124 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1124 variables, and 491 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6195 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 366/366 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 7031ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3052 ms.
Support contains 18 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 13 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 366/366 places, 770/770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Applied a total of 0 rules in 11 ms. Remains 366 /366 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-05-28 14:25:42] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:25:42] [INFO ] Invariant cache hit.
[2024-05-28 14:25:42] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-28 14:25:42] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:25:42] [INFO ] Invariant cache hit.
[2024-05-28 14:25:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:25:48] [INFO ] Implicit Places using invariants and state equation in 5445 ms returned []
Implicit Place search using SMT with State Equation took 5697 ms to find 0 implicit places.
[2024-05-28 14:25:48] [INFO ] Redundant transitions in 3 ms returned []
Running 768 sub problems to find dead transitions.
[2024-05-28 14:25:48] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:25:48] [INFO ] Invariant cache hit.
[2024-05-28 14:25:48] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :319268 after 412148
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 14:25:53] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:25:53] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:25:53] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2024-05-28 14:25:53] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:25:53] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:25:53] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:25:53] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:25:54] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:25:54] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:25:54] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:25:54] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:25:54] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2024-05-28 14:25:55] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:25:56] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-28 14:25:59] [INFO ] Deduced a trap composed of 148 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:26:00] [INFO ] Deduced a trap composed of 181 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:26:00] [INFO ] Deduced a trap composed of 166 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 5 (OVERLAPS) 1/365 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Detected timeout of ITS tools.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/59 constraints. Problems are: Problem set: 30 solved, 738 unsolved
[2024-05-28 14:26:19] [INFO ] Deduced a trap composed of 126 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:26:19] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/1124 variables, and 61 constraints, problems are : Problem set: 30 solved, 738 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 30 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 12/12 constraints. Problems are: Problem set: 30 solved, 738 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 28/40 constraints. Problems are: Problem set: 30 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 19/59 constraints. Problems are: Problem set: 30 solved, 738 unsolved
[2024-05-28 14:26:20] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:26:22] [INFO ] Deduced a trap composed of 170 places in 173 ms of which 2 ms to minimize.
[2024-05-28 14:26:22] [INFO ] Deduced a trap composed of 170 places in 238 ms of which 3 ms to minimize.
[2024-05-28 14:26:23] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 2 ms to minimize.
[2024-05-28 14:26:23] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 3 ms to minimize.
[2024-05-28 14:26:23] [INFO ] Deduced a trap composed of 181 places in 217 ms of which 3 ms to minimize.
[2024-05-28 14:26:24] [INFO ] Deduced a trap composed of 181 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:26:24] [INFO ] Deduced a trap composed of 225 places in 191 ms of which 3 ms to minimize.
[2024-05-28 14:26:26] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-28 14:26:27] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 2 ms to minimize.
[2024-05-28 14:26:27] [INFO ] Deduced a trap composed of 103 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 11/70 constraints. Problems are: Problem set: 30 solved, 738 unsolved
[2024-05-28 14:26:30] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/71 constraints. Problems are: Problem set: 30 solved, 738 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/71 constraints. Problems are: Problem set: 30 solved, 738 unsolved
At refinement iteration 6 (OVERLAPS) 1/365 variables, 1/72 constraints. Problems are: Problem set: 30 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/1124 variables, and 72 constraints, problems are : Problem set: 30 solved, 738 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/366 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/768 constraints, Known Traps: 31/31 constraints]
After SMT, in 61148ms problems are : Problem set: 30 solved, 738 unsolved
Search for dead transitions found 30 dead transitions in 61159ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 366/366 places, 740/770 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 364 transition count 728
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 352 transition count 716
Applied a total of 14 rules in 20 ms. Remains 352 /366 variables (removed 14) and now considering 716/740 (removed 24) transitions.
[2024-05-28 14:26:49] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
// Phase 1: matrix 704 rows 352 cols
[2024-05-28 14:26:49] [INFO ] Computed 42 invariants in 7 ms
[2024-05-28 14:26:49] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-28 14:26:49] [INFO ] Flow matrix only has 704 transitions (discarded 12 similar events)
[2024-05-28 14:26:49] [INFO ] Invariant cache hit.
[2024-05-28 14:26:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:26:52] [INFO ] Implicit Places using invariants and state equation in 2297 ms returned []
Implicit Place search using SMT with State Equation took 2680 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 352/366 places, 716/770 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69586 ms. Remains : 352/366 places, 716/770 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 2, 2] Max Struct:[26, 20, 26]
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-00
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:[26]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[26]
[2024-05-28 14:26:52] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-05-28 14:26:52] [INFO ] Computed 42 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[26]
RANDOM walk for 10000 steps (4 resets) in 48 ms. (204 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-28 14:26:52] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:26:52] [INFO ] Invariant cache hit.
[2024-05-28 14:26:52] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 14:26:52] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-28 14:26:52] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2024-05-28 14:26:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:26:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 14:26:52] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 35 ms returned sat
[2024-05-28 14:26:53] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2024-05-28 14:26:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:26:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 14:26:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 723 ms returned sat
[2024-05-28 14:26:53] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 64 ms.
[2024-05-28 14:26:55] [INFO ] Added : 127 causal constraints over 26 iterations in 1784 ms. Result :sat
Minimization took 675 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 366 transition count 764
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 360 transition count 764
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 360 transition count 758
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 354 transition count 758
Applied a total of 24 rules in 45 ms. Remains 354 /366 variables (removed 12) and now considering 758/770 (removed 12) transitions.
Running 756 sub problems to find dead transitions.
[2024-05-28 14:26:56] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 354 cols
[2024-05-28 14:26:56] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 14:26:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 141 places in 145 ms of which 5 ms to minimize.
[2024-05-28 14:27:02] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 2 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 126 places in 166 ms of which 2 ms to minimize.
[2024-05-28 14:27:03] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 2 ms to minimize.
[2024-05-28 14:27:04] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:27:04] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:27:04] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:27:04] [INFO ] Deduced a trap composed of 117 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:27:06] [INFO ] Deduced a trap composed of 154 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:27:08] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:27:11] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 2 ms to minimize.
[2024-05-28 14:27:11] [INFO ] Deduced a trap composed of 153 places in 198 ms of which 2 ms to minimize.
[2024-05-28 14:27:11] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 2 ms to minimize.
[2024-05-28 14:27:11] [INFO ] Deduced a trap composed of 154 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:27:14] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 3 ms to minimize.
[2024-05-28 14:27:14] [INFO ] Deduced a trap composed of 15 places in 177 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 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.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)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 66 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:27:26] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
[2024-05-28 14:27:26] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:27:33] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 69 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 29/29 constraints]
After SMT, in 41053ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 41066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41114 ms. Remains : 354/366 places, 758/770 transitions.
[2024-05-28 14:27:37] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:27:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (562 resets) in 2664 ms. (375 steps per ms)
BEST_FIRST walk for 1000000 steps (208 resets) in 1284 ms. (778 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-28 14:27:41] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:27:41] [INFO ] Invariant cache hit.
[2024-05-28 14:27:41] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 14:27:41] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-28 14:27:41] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-05-28 14:27:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:27:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 14:27:41] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-28 14:27:42] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-05-28 14:27:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:27:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 767 ms returned sat
[2024-05-28 14:27:43] [INFO ] Computed and/alt/rep : 492/2361/486 causal constraints (skipped 258 transitions) in 63 ms.
[2024-05-28 14:27:45] [INFO ] Added : 89 causal constraints over 19 iterations in 2468 ms. Result :sat
Minimization took 2546 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 17 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-28 14:27:48] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:27:48] [INFO ] Invariant cache hit.
[2024-05-28 14:27:49] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-28 14:27:49] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:27:49] [INFO ] Invariant cache hit.
[2024-05-28 14:27:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:27:52] [INFO ] Implicit Places using invariants and state equation in 3131 ms returned []
Implicit Place search using SMT with State Equation took 3518 ms to find 0 implicit places.
[2024-05-28 14:27:52] [INFO ] Redundant transitions in 9 ms returned []
Running 756 sub problems to find dead transitions.
[2024-05-28 14:27:52] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:27:52] [INFO ] Invariant cache hit.
[2024-05-28 14:27:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:27:58] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:27:58] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 4 ms to minimize.
[2024-05-28 14:27:58] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:27:58] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:27:59] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:27:59] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:27:59] [INFO ] Deduced a trap composed of 183 places in 193 ms of which 2 ms to minimize.
[2024-05-28 14:27:59] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:27:59] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:28:00] [INFO ] Deduced a trap composed of 129 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:28:00] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 122 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 120 places in 159 ms of which 2 ms to minimize.
[2024-05-28 14:28:01] [INFO ] Deduced a trap composed of 153 places in 182 ms of which 2 ms to minimize.
[2024-05-28 14:28:03] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:28:03] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 2 ms to minimize.
[2024-05-28 14:28:04] [INFO ] Deduced a trap composed of 117 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:28:06] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:28:07] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:28:10] [INFO ] Deduced a trap composed of 165 places in 240 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:28:19] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:28:22] [INFO ] Deduced a trap composed of 154 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:28:23] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 63 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 23/63 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:28:24] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:28:28] [INFO ] Deduced a trap composed of 114 places in 179 ms of which 2 ms to minimize.
[2024-05-28 14:28:28] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-28 14:28:29] [INFO ] Deduced a trap composed of 210 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:28:29] [INFO ] Deduced a trap composed of 115 places in 197 ms of which 3 ms to minimize.
[2024-05-28 14:28:30] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 3 ms to minimize.
[2024-05-28 14:28:30] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:28:35] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:28:37] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 72 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 32/32 constraints]
After SMT, in 61172ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 61188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64745 ms. Remains : 354/354 places, 758/758 transitions.
[2024-05-28 14:28:53] [INFO ] Flatten gal took : 99 ms
[2024-05-28 14:28:53] [INFO ] Flatten gal took : 73 ms
[2024-05-28 14:28:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5917956223706641797.gal : 6 ms
RANDOM walk for 40000 steps (26 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
[2024-05-28 14:28:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13388883616942991976.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/ReachabilityCardinality5917956223706641797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13388883616942991976.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 (14 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13388883616942991976.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 64
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :64 after 96
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :430 after 1674
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1674 after 3104
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3104 after 3325
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3325 after 7794
Interrupted probabilistic random walk after 184625 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184625 steps, saw 94243 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-28 14:28:56] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:28:56] [INFO ] Invariant cache hit.
[2024-05-28 14:28:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/352 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1098 variables, 352/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 72/465 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1100 variables, 2/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 1/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 468 constraints, problems are : Problem set: 1 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 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/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 14:28:58] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-05-28 14:28:58] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/352 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7794 after 38788
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1100 variables, and 395 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 352/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2122ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 20 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running 756 sub problems to find dead transitions.
[2024-05-28 14:28:59] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:28:59] [INFO ] Invariant cache hit.
[2024-05-28 14:28:59] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :38788 after 90353
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 148 places in 104 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 183 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 2 ms to minimize.
[2024-05-28 14:29:05] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 2 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 129 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 122 places in 174 ms of which 2 ms to minimize.
[2024-05-28 14:29:06] [INFO ] Deduced a trap composed of 120 places in 181 ms of which 2 ms to minimize.
[2024-05-28 14:29:07] [INFO ] Deduced a trap composed of 153 places in 187 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :90353 after 163800
[2024-05-28 14:29:14] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 4 ms to minimize.
[2024-05-28 14:29:15] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :163800 after 240166
[2024-05-28 14:29:18] [INFO ] Deduced a trap composed of 117 places in 221 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 57 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:29:22] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:29:23] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 4 ms to minimize.
[2024-05-28 14:29:27] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 4 ms to minimize.
[2024-05-28 14:29:27] [INFO ] Deduced a trap composed of 114 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:29:27] [INFO ] Deduced a trap composed of 210 places in 199 ms of which 5 ms to minimize.
[2024-05-28 14:29:28] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:29:36] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :334286 after 885036
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 64 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 24/24 constraints]
After SMT, in 41284ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 41297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41320 ms. Remains : 354/354 places, 758/758 transitions.
RANDOM walk for 40000 steps (32 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (15 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 424265 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 424265 steps, saw 200968 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
[2024-05-28 14:29:43] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:29:43] [INFO ] Invariant cache hit.
[2024-05-28 14:29:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/352 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 746/1098 variables, 352/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
At refinement iteration 14 (INCLUDED_ONLY) 0/1098 variables, 72/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:29:43] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:29:43] [INFO ] Applying decomposition
[2024-05-28 14:29:43] [INFO ] Flatten gal took : 29 ms
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1100 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1100 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1100 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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/graph5866126211976412365.txt' '-o' '/tmp/graph5866126211976412365.bin' '-w' '/tmp/graph5866126211976412365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5866126211976412365.bin' '-l' '-1' '-v' '-w' '/tmp/graph5866126211976412365.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:29:44] [INFO ] Decomposing Gal with order
[2024-05-28 14:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 248/272 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/284 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:29:44] [INFO ] Removed a total of 581 redundant transitions.
At refinement iteration 7 (OVERLAPS) 14/298 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:29:44] [INFO ] Flatten gal took : 119 ms
At refinement iteration 9 (OVERLAPS) 53/351 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 19 ms.
[2024-05-28 14:29:44] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:29:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2689902091411496407.gal : 17 ms
[2024-05-28 14:29:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10246541509524794248.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/ReachabilityCardinality2689902091411496407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10246541509524794248.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/ReachabilityCardinality10246541509524794248.prop.
[2024-05-28 14:29:44] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/352 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
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 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 206
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :206 after 550
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :550 after 661
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :661 after 1383
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1383 after 2888
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2888 after 6946
At refinement iteration 14 (OVERLAPS) 746/1098 variables, 352/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 72/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6946 after 19258
[2024-05-28 14:29:46] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1098 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1098 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1100 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1100 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1100 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 354/354 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3027ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 14 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-28 14:29:46] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:29:46] [INFO ] Invariant cache hit.
[2024-05-28 14:29:46] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-28 14:29:46] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:29:46] [INFO ] Invariant cache hit.
[2024-05-28 14:29:47] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :19258 after 36746
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :36746 after 78976
[2024-05-28 14:29:51] [INFO ] Implicit Places using invariants and state equation in 4637 ms returned []
Implicit Place search using SMT with State Equation took 4939 ms to find 0 implicit places.
[2024-05-28 14:29:51] [INFO ] Redundant transitions in 3 ms returned []
Running 756 sub problems to find dead transitions.
[2024-05-28 14:29:51] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:29:51] [INFO ] Invariant cache hit.
[2024-05-28 14:29:51] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :78976 after 331098
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:29:57] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:29:58] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:29:58] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 0 ms to minimize.
[2024-05-28 14:29:58] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:29:58] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2024-05-28 14:29:58] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 3 ms to minimize.
[2024-05-28 14:29:58] [INFO ] Deduced a trap composed of 183 places in 254 ms of which 3 ms to minimize.
[2024-05-28 14:29:59] [INFO ] Deduced a trap composed of 161 places in 258 ms of which 3 ms to minimize.
[2024-05-28 14:29:59] [INFO ] Deduced a trap composed of 141 places in 253 ms of which 7 ms to minimize.
[2024-05-28 14:29:59] [INFO ] Deduced a trap composed of 129 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:29:59] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:30:00] [INFO ] Deduced a trap composed of 122 places in 241 ms of which 2 ms to minimize.
[2024-05-28 14:30:00] [INFO ] Deduced a trap composed of 120 places in 198 ms of which 2 ms to minimize.
[2024-05-28 14:30:00] [INFO ] Deduced a trap composed of 153 places in 194 ms of which 2 ms to minimize.
[2024-05-28 14:30:02] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 2 ms to minimize.
[2024-05-28 14:30:03] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2024-05-28 14:30:03] [INFO ] Deduced a trap composed of 117 places in 204 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :331098 after 992912
[2024-05-28 14:30:06] [INFO ] Deduced a trap composed of 118 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:30:06] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:30:09] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:30:18] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 61 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:30:24] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-28 14:30:27] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-05-28 14:30:27] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 3 ms to minimize.
[2024-05-28 14:30:28] [INFO ] Deduced a trap composed of 213 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:30:28] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:30:28] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 756 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :992912 after 3.62987e+06
[2024-05-28 14:30:33] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-28 14:30:34] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:30:34] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:30:40] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 15 ms to minimize.
[2024-05-28 14:30:40] [INFO ] Deduced a trap composed of 186 places in 162 ms of which 5 ms to minimize.
[2024-05-28 14:30:40] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:30:42] [INFO ] Deduced a trap composed of 180 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:30:43] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:30:43] [INFO ] Deduced a trap composed of 191 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:30:48] [INFO ] Deduced a trap composed of 124 places in 207 ms of which 2 ms to minimize.
[2024-05-28 14:30:48] [INFO ] Deduced a trap composed of 124 places in 183 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1100 variables, and 78 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 38/38 constraints]
After SMT, in 61178ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 61186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66173 ms. Remains : 354/354 places, 758/758 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[26]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-00 in 240658 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-01
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2024-05-28 14:30:52] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-05-28 14:30:52] [INFO ] Computed 42 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (6 resets) in 47 ms. (208 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 14:30:52] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:30:52] [INFO ] Invariant cache hit.
[2024-05-28 14:30:52] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 14:30:52] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-28 14:30:53] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-05-28 14:30:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:30:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 14:30:53] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-28 14:30:53] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2024-05-28 14:30:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:30:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 238 ms returned sat
[2024-05-28 14:30:53] [INFO ] Deduced a trap composed of 117 places in 240 ms of which 3 ms to minimize.
[2024-05-28 14:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2024-05-28 14:30:54] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 60 ms.
[2024-05-28 14:30:56] [INFO ] Added : 65 causal constraints over 14 iterations in 2144 ms. Result :sat
Minimization took 604 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 360 transition count 764
Applied a total of 12 rules in 40 ms. Remains 360 /366 variables (removed 6) and now considering 764/770 (removed 6) transitions.
Running 762 sub problems to find dead transitions.
[2024-05-28 14:30:56] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
// Phase 1: matrix 752 rows 360 cols
[2024-05-28 14:30:56] [INFO ] Computed 42 invariants in 20 ms
[2024-05-28 14:30:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 3 ms to minimize.
[2024-05-28 14:31:02] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:31:03] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2024-05-28 14:31:04] [INFO ] Deduced a trap composed of 219 places in 207 ms of which 2 ms to minimize.
[2024-05-28 14:31:06] [INFO ] Deduced a trap composed of 114 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:31:07] [INFO ] Deduced a trap composed of 118 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:31:07] [INFO ] Deduced a trap composed of 106 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:31:07] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:31:08] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 2 ms to minimize.
[2024-05-28 14:31:08] [INFO ] Deduced a trap composed of 122 places in 206 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-28 14:31:10] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 2 ms to minimize.
[2024-05-28 14:31:10] [INFO ] Deduced a trap composed of 178 places in 156 ms of which 2 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/358 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 762 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1112 variables, and 58 constraints, problems are : Problem set: 0 solved, 762 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 762/762 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 762 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-28 14:31:19] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:31:19] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-28 14:31:32] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 2 ms to minimize.
[2024-05-28 14:31:32] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 762 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1112 variables, and 62 constraints, problems are : Problem set: 0 solved, 762 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/762 constraints, Known Traps: 22/22 constraints]
After SMT, in 41146ms problems are : Problem set: 0 solved, 762 unsolved
Search for dead transitions found 0 dead transitions in 41160ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41202 ms. Remains : 360/366 places, 764/770 transitions.
[2024-05-28 14:31:37] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-28 14:31:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[20]
RANDOM walk for 1000000 steps (538 resets) in 2383 ms. (419 steps per ms)
BEST_FIRST walk for 1000000 steps (216 resets) in 1253 ms. (797 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[20]
[2024-05-28 14:31:41] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-28 14:31:41] [INFO ] Invariant cache hit.
[2024-05-28 14:31:41] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 14:31:41] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 20 ms returned sat
[2024-05-28 14:31:42] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2024-05-28 14:31:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:31:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 14:31:42] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 19 ms returned sat
[2024-05-28 14:31:42] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-05-28 14:31:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:31:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 180 ms returned sat
[2024-05-28 14:31:43] [INFO ] Deduced a trap composed of 125 places in 213 ms of which 3 ms to minimize.
[2024-05-28 14:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2024-05-28 14:31:43] [INFO ] Computed and/alt/rep : 462/2289/456 causal constraints (skipped 294 transitions) in 63 ms.
[2024-05-28 14:31:44] [INFO ] Deduced a trap composed of 135 places in 209 ms of which 2 ms to minimize.
[2024-05-28 14:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1437 ms
[2024-05-28 14:31:46] [INFO ] Added : 95 causal constraints over 19 iterations in 2868 ms. Result :sat
Minimization took 2765 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[20]
Support contains 6 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 764/764 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 360/360 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 764/764 transitions.
Applied a total of 0 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-05-28 14:31:49] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-28 14:31:49] [INFO ] Invariant cache hit.
[2024-05-28 14:31:50] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-28 14:31:50] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-28 14:31:50] [INFO ] Invariant cache hit.
[2024-05-28 14:31:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:31:53] [INFO ] Implicit Places using invariants and state equation in 2917 ms returned []
Implicit Place search using SMT with State Equation took 3256 ms to find 0 implicit places.
[2024-05-28 14:31:53] [INFO ] Redundant transitions in 3 ms returned []
Running 762 sub problems to find dead transitions.
[2024-05-28 14:31:53] [INFO ] Flow matrix only has 752 transitions (discarded 12 similar events)
[2024-05-28 14:31:53] [INFO ] Invariant cache hit.
[2024-05-28 14:31:53] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-28 14:31:57] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:31:57] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:31:57] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:31:57] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:31:58] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-28 14:31:58] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:31:59] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:31:59] [INFO ] Deduced a trap composed of 224 places in 180 ms of which 2 ms to minimize.
[2024-05-28 14:32:00] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:32:01] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 1 ms to minimize.
[2024-05-28 14:32:01] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:32:01] [INFO ] Deduced a trap composed of 152 places in 126 ms of which 2 ms to minimize.
[2024-05-28 14:32:02] [INFO ] Deduced a trap composed of 144 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:32:02] [INFO ] Deduced a trap composed of 153 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:32:02] [INFO ] Deduced a trap composed of 147 places in 194 ms of which 3 ms to minimize.
[2024-05-28 14:32:02] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:32:03] [INFO ] Deduced a trap composed of 121 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-28 14:32:04] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 190 places in 191 ms of which 2 ms to minimize.
[2024-05-28 14:32:07] [INFO ] Deduced a trap composed of 141 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:32:08] [INFO ] Deduced a trap composed of 155 places in 177 ms of which 3 ms to minimize.
[2024-05-28 14:32:08] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 762 unsolved
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/360 variables, 2/65 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-28 14:32:18] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 3 ms to minimize.
[2024-05-28 14:32:23] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:32:23] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:32:23] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:32:23] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-05-28 14:32:23] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1112 variables, and 71 constraints, problems are : Problem set: 30 solved, 732 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 762/762 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 30 solved, 732 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 12/12 constraints. Problems are: Problem set: 30 solved, 732 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 28/40 constraints. Problems are: Problem set: 30 solved, 732 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 25/65 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-28 14:32:25] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:32:25] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:32:25] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:32:25] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
[2024-05-28 14:32:25] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 2 ms to minimize.
[2024-05-28 14:32:28] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 6/71 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-28 14:32:34] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:32:40] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 2/73 constraints. Problems are: Problem set: 30 solved, 732 unsolved
[2024-05-28 14:32:50] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1112 variables, and 74 constraints, problems are : Problem set: 30 solved, 732 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/360 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/762 constraints, Known Traps: 34/38 constraints]
After SMT, in 60887ms problems are : Problem set: 30 solved, 732 unsolved
Search for dead transitions found 30 dead transitions in 60893ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 360/360 places, 734/764 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 722
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 346 transition count 710
Applied a total of 14 rules in 15 ms. Remains 346 /360 variables (removed 14) and now considering 710/734 (removed 24) transitions.
[2024-05-28 14:32:53] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
// Phase 1: matrix 698 rows 346 cols
[2024-05-28 14:32:54] [INFO ] Computed 42 invariants in 10 ms
[2024-05-28 14:32:54] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-28 14:32:54] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-05-28 14:32:54] [INFO ] Invariant cache hit.
[2024-05-28 14:32:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:32:56] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 346/360 places, 710/764 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66945 ms. Remains : 346/360 places, 710/764 transitions.
[2024-05-28 14:32:56] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-05-28 14:32:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[12]
RANDOM walk for 1000000 steps (556 resets) in 2137 ms. (467 steps per ms)
BEST_FIRST walk for 1000001 steps (209 resets) in 1114 ms. (896 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[12]
[2024-05-28 14:33:00] [INFO ] Flow matrix only has 698 transitions (discarded 12 similar events)
[2024-05-28 14:33:00] [INFO ] Invariant cache hit.
[2024-05-28 14:33:00] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 14:33:00] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 14:33:00] [INFO ] Flatten gal took : 56 ms
[2024-05-28 14:33:00] [INFO ] Flatten gal took : 43 ms
[2024-05-28 14:33:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8141989172936782283.gal : 8 ms
[2024-05-28 14:33:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1784832750023589241.prop : 4 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/ReachabilityCardinality8141989172936782283.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1784832750023589241.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
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-01 in 127519 ms.
Starting property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-12
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:[26]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[26]
[2024-05-28 14:33:00] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
// Phase 1: matrix 758 rows 366 cols
[2024-05-28 14:33:00] [INFO ] Computed 42 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[26]
RANDOM walk for 10000 steps (4 resets) in 55 ms. (178 steps per ms)
BEST_FIRST walk for 10000 steps (4 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-28 14:33:00] [INFO ] Flow matrix only has 758 transitions (discarded 12 similar events)
[2024-05-28 14:33:00] [INFO ] Invariant cache hit.
[2024-05-28 14:33:00] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-28 14:33:00] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-28 14:33:00] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-28 14:33:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:33:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 14:33:00] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-28 14:33:01] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-05-28 14:33:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:33:01] [INFO ] [Nat]Added 72 Read/Feed constraints in 232 ms returned sat
[2024-05-28 14:33:01] [INFO ] Computed and/alt/rep : 504/2415/498 causal constraints (skipped 258 transitions) in 56 ms.
[2024-05-28 14:33:02] [INFO ] Added : 64 causal constraints over 13 iterations in 793 ms. Result :sat
Minimization took 632 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 770/770 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 366 transition count 764
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 360 transition count 764
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 354 transition count 758
Applied a total of 24 rules in 43 ms. Remains 354 /366 variables (removed 12) and now considering 758/770 (removed 12) transitions.
Running 756 sub problems to find dead transitions.
[2024-05-28 14:33:02] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 354 cols
[2024-05-28 14:33:02] [INFO ] Computed 42 invariants in 9 ms
[2024-05-28 14:33:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 0 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 0 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 45 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:33:08] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 2 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 118 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:33:09] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 2 ms to minimize.
[2024-05-28 14:33:10] [INFO ] Deduced a trap composed of 108 places in 204 ms of which 2 ms to minimize.
[2024-05-28 14:33:11] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:33:11] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:33:11] [INFO ] Deduced a trap composed of 117 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 5 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 2 ms to minimize.
[2024-05-28 14:33:12] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:33:14] [INFO ] Deduced a trap composed of 210 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:33:16] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:33:16] [INFO ] Deduced a trap composed of 114 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:33:16] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:33:22] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1100 variables, and 69 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:33:27] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 1/353 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/1100 variables, and 71 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 30/30 constraints]
After SMT, in 41229ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 41245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41292 ms. Remains : 354/366 places, 758/770 transitions.
[2024-05-28 14:33:44] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:33:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (554 resets) in 2576 ms. (388 steps per ms)
BEST_FIRST walk for 1000000 steps (222 resets) in 1285 ms. (777 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-28 14:33:48] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:33:48] [INFO ] Invariant cache hit.
[2024-05-28 14:33:48] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 14:33:48] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 14:33:48] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-05-28 14:33:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:33:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-28 14:33:48] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-28 14:33:48] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-28 14:33:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:33:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 452 ms returned sat
[2024-05-28 14:33:49] [INFO ] Computed and/alt/rep : 456/2283/450 causal constraints (skipped 294 transitions) in 48 ms.
[2024-05-28 14:33:50] [INFO ] Added : 98 causal constraints over 20 iterations in 1245 ms. Result :sat
Minimization took 1747 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[26]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[26]
Support contains 6 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 9 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 354/354 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 758/758 transitions.
Applied a total of 0 rules in 8 ms. Remains 354 /354 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-28 14:33:53] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:33:53] [INFO ] Invariant cache hit.
[2024-05-28 14:33:53] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-28 14:33:53] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:33:53] [INFO ] Invariant cache hit.
[2024-05-28 14:33:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:33:56] [INFO ] Implicit Places using invariants and state equation in 3003 ms returned []
Implicit Place search using SMT with State Equation took 3284 ms to find 0 implicit places.
[2024-05-28 14:33:56] [INFO ] Redundant transitions in 9 ms returned []
Running 756 sub problems to find dead transitions.
[2024-05-28 14:33:56] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2024-05-28 14:33:56] [INFO ] Invariant cache hit.
[2024-05-28 14:33:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:34:00] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-28 14:34:00] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:34:00] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:34:00] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:34:01] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:34:02] [INFO ] Deduced a trap composed of 213 places in 148 ms of which 2 ms to minimize.
[2024-05-28 14:34:03] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:34:04] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:34:05] [INFO ] Deduced a trap composed of 117 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 2 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 5 ms to minimize.
[2024-05-28 14:34:06] [INFO ] Deduced a trap composed of 118 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:34:07] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:34:10] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
[2024-05-28 14:34:11] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-28 14:34:11] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:34:19] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 6 (OVERLAPS) 1/353 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1100 variables, and 60 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 756 unsolved
[2024-05-28 14:34:29] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2024-05-28 14:34:29] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-28 14:34:30] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:34:30] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 2 ms to minimize.
[2024-05-28 14:34:30] [INFO ] Deduced a trap composed of 158 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:34:31] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:34:31] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 2 ms to minimize.
[2024-05-28 14:34:31] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 2 ms to minimize.
[2024-05-28 14:34:31] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:34:31] [INFO ] Deduced a trap composed of 169 places in 159 ms of which 15 ms to minimize.
[2024-05-28 14:34:34] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:34:34] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 1/353 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/73 constraints. Problems are: Problem set: 30 solved, 726 unsolved
[2024-05-28 14:34:49] [INFO ] Deduced a trap composed of 112 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:34:52] [INFO ] Deduced a trap composed of 109 places in 149 ms of which 2 ms to minimize.
[2024-05-28 14:34:53] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/76 constraints. Problems are: Problem set: 30 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/1100 variables, and 76 constraints, problems are : Problem set: 30 solved, 726 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 34/34 constraints]
After SMT, in 61049ms problems are : Problem set: 30 solved, 726 unsolved
Search for dead transitions found 30 dead transitions in 61061ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 354/354 places, 728/758 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 716
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 340 transition count 704
Applied a total of 14 rules in 28 ms. Remains 340 /354 variables (removed 14) and now considering 704/728 (removed 24) transitions.
[2024-05-28 14:34:57] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
// Phase 1: matrix 692 rows 340 cols
[2024-05-28 14:34:57] [INFO ] Computed 42 invariants in 8 ms
[2024-05-28 14:34:57] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-28 14:34:57] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-05-28 14:34:57] [INFO ] Invariant cache hit.
[2024-05-28 14:34:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 14:34:59] [INFO ] Implicit Places using invariants and state equation in 2157 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 340/354 places, 704/758 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66927 ms. Remains : 340/354 places, 704/758 transitions.
[2024-05-28 14:34:59] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-05-28 14:34:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[26]
RANDOM walk for 1000000 steps (582 resets) in 2861 ms. (349 steps per ms)
BEST_FIRST walk for 1000000 steps (241 resets) in 1499 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[26]
[2024-05-28 14:35:04] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2024-05-28 14:35:04] [INFO ] Invariant cache hit.
[2024-05-28 14:35:04] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 14:35:04] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 24 ms
[2024-05-28 14:35:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6178793710006657157.gal : 32 ms
[2024-05-28 14:35:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9757822212447059707.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/ReachabilityCardinality6178793710006657157.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9757822212447059707.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
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-COL-S02J06T06-UpperBounds-12 in 124357 ms.
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:35:04] [INFO ] Applying decomposition
[2024-05-28 14:35:04] [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/graph16200377938429290895.txt' '-o' '/tmp/graph16200377938429290895.bin' '-w' '/tmp/graph16200377938429290895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16200377938429290895.bin' '-l' '-1' '-v' '-w' '/tmp/graph16200377938429290895.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:35:04] [INFO ] Decomposing Gal with order
[2024-05-28 14:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:35:04] [INFO ] Removed a total of 653 redundant transitions.
[2024-05-28 14:35:04] [INFO ] Flatten gal took : 81 ms
[2024-05-28 14:35:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 249 labels/synchronizations in 17 ms.
[2024-05-28 14:35:04] [INFO ] Time to serialize gal into /tmp/UpperBounds16253057439399542374.gal : 6 ms
[2024-05-28 14:35:04] [INFO ] Time to serialize properties into /tmp/UpperBounds6392581472639507892.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/UpperBounds16253057439399542374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6392581472639507892.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 ...305
Loading property file /tmp/UpperBounds6392581472639507892.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,7.51972e+06,321.996,6936568,2,343150,5,1.08166e+07,6,0,2319,8.72206e+06,0
Total reachable state count : 7519716
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property PolyORBLF-COL-S02J06T06-UpperBounds-00 :0 <= gu1.TryAllocateOneTaskB_0+gu1.TryAllocateOneTaskB_1+gu1.TryAllocateOneTaskB_2+gu1.TryAllocateO...221
FORMULA PolyORBLF-COL-S02J06T06-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-COL-S02J06T06-UpperBounds-00,0,322.362,6936568,1,0,7,1.08166e+07,9,1,3403,8.72206e+06,4
Total runtime 1192982 ms.
BK_STOP 1716907228375
--------------------
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-S02J06T06"
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-S02J06T06, 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-171654446400101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 '
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 ;