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.r289-tajo-171654445800389.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 greatspnxred
Input is PolyORBNT-COL-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445800389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K 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 PolyORBNT-COL-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716877944954

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:32:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 06:32:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:32:26] [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 06:32:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:32:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 652 ms
[2024-05-28 06:32:27] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-28 06:32:27] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 06:32:27] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 06:32:27] [INFO ] Computed 13 invariants in 16 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 10, 5, 0, 0, 1] Max Struct:[+inf, +inf, 1, 61, 4, +inf, 4, 5, +inf, 10, +inf, +inf, 5, +inf, 1, +inf]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 06:32:27] [INFO ] Invariant cache hit.
[2024-05-28 06:32:27] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 06:32:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 06:32:27] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 06:32:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:32:27] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:32:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:32:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-28 06:32:28] [INFO ] Added : 3 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 27 ms.
[2024-05-28 06:32:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:32:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:32:28] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 41 ms to minimize.
[2024-05-28 06:32:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-05-28 06:32:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-28 06:32:28] [INFO ] Added : 20 causal constraints over 4 iterations in 144 ms. Result :sat
Minimization took 26 ms.
[2024-05-28 06:32:28] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:32:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 06:32:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-28 06:32:29] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 06:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-28 06:32:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 06:32:29] [INFO ] Added : 20 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 49 ms.
[2024-05-28 06:32:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:32:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2024-05-28 06:32:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:32:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 06:32:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-28 06:32:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:29] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 06:32:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2024-05-28 06:32:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-28 06:32:29] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-28 06:32:29] [INFO ] Added : 22 causal constraints over 5 iterations in 182 ms. Result :sat
Minimization took 126 ms.
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:32:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 06:32:30] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-28 06:32:30] [INFO ] Added : 36 causal constraints over 8 iterations in 122 ms. Result :sat
Minimization took 103 ms.
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 06:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-28 06:32:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 06:32:30] [INFO ] Added : 36 causal constraints over 8 iterations in 59 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 06:32:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-28 06:32:30] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-28 06:32:30] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:32:31] [INFO ] Added : 22 causal constraints over 5 iterations in 531 ms. Result :sat
Minimization took 207 ms.
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 06:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:32:31] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:32:31] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 15 ms.
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 06:32:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-28 06:32:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:32:32] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 19 ms.
[2024-05-28 06:32:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 164 ms
[2024-05-28 06:32:32] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:32:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2024-05-28 06:32:32] [INFO ] Added : 36 causal constraints over 8 iterations in 100 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 06:32:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 06:32:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, 4, 1, 4, 5, +inf, 10, +inf, 10, +inf, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:32:32] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 114 ms.
[2024-05-28 06:32:32] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 14 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, 4, 4, 5, +inf, 10, +inf, +inf, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 4, 4, 5, +inf, 10, +inf, +inf, 1]
[2024-05-28 06:32:32] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 06:32:32] [INFO ] Computed 142 invariants in 105 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 61, 4, 4, 5, 244, 10, 11, 61, 1]
RANDOM walk for 10000 steps (680 resets) in 234 ms. (42 steps per ms)
FORMULA PolyORBNT-COL-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (1155 resets) in 395 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 3, 4, 1, 4, 1, 1] Max Struct:[11, 61, 4, 5, 244, 10, 11, 61]
[2024-05-28 06:32:33] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 06:32:33] [INFO ] Invariant cache hit.
[2024-05-28 06:32:33] [INFO ] [Real]Absence check using 135 positive place invariants in 44 ms returned sat
[2024-05-28 06:32:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2024-05-28 06:32:33] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-28 06:32:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
[2024-05-28 06:32:33] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2024-05-28 06:32:33] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 06:32:34] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-05-28 06:32:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:34] [INFO ] [Nat]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-28 06:32:34] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-28 06:32:35] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2024-05-28 06:32:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:32:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2024-05-28 06:32:35] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 179 ms.
[2024-05-28 06:32:36] [INFO ] Deduced a trap composed of 507 places in 491 ms of which 7 ms to minimize.
[2024-05-28 06:32:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 866 ms
[2024-05-28 06:32:36] [INFO ] Added : 19 causal constraints over 4 iterations in 1524 ms. Result :sat
Minimization took 634 ms.
[2024-05-28 06:32:37] [INFO ] [Real]Absence check using 135 positive place invariants in 41 ms returned sat
[2024-05-28 06:32:37] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-28 06:32:38] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2024-05-28 06:32:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:32:38] [INFO ] [Nat]Absence check using 135 positive place invariants in 41 ms returned sat
[2024-05-28 06:32:38] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-28 06:32:39] [INFO ] [Nat]Absence check using state equation in 1390 ms returned unknown
[2024-05-28 06:32:39] [INFO ] [Real]Absence check using 135 positive place invariants in 40 ms returned sat
[2024-05-28 06:32:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
[2024-05-28 06:32:40] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-28 06:32:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned unsat
[2024-05-28 06:32:40] [INFO ] [Real]Absence check using 135 positive place invariants in 45 ms returned sat
[2024-05-28 06:32:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2024-05-28 06:32:40] [INFO ] [Real]Absence check using 135 positive place invariants in 42 ms returned sat
[2024-05-28 06:32:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 3, 4, 1, 4, 1, 1] Max Struct:[1, 1, 4, 5, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[4, 5]
Support contains 306 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 294 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-28 06:32:41] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-28 06:32:41] [INFO ] Computed 137 invariants in 111 ms
[2024-05-28 06:32:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 06:33:17] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 6 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 285 places in 371 ms of which 6 ms to minimize.
[2024-05-28 06:33:21] [INFO ] Deduced a trap composed of 188 places in 380 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 06:33:24] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 136 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 4/4 constraints]
After SMT, in 44010ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 44073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44394 ms. Remains : 770/909 places, 1181/1315 transitions.
[2024-05-28 06:33:25] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:33:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4] Max Struct:[4, 5]
RANDOM walk for 1000000 steps (52155 resets) in 10623 ms. (94 steps per ms)
BEST_FIRST walk for 1902267 steps (6539 resets) in 6770 ms. (280 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4] Max Struct:[4, 5]
[2024-05-28 06:33:42] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:33:42] [INFO ] Invariant cache hit.
[2024-05-28 06:33:42] [INFO ] [Real]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-05-28 06:33:42] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 06:33:43] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2024-05-28 06:33:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:33:43] [INFO ] [Nat]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-05-28 06:33:43] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 06:33:43] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-05-28 06:33:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:33:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 78 ms returned sat
[2024-05-28 06:33:44] [INFO ] Deduced a trap composed of 168 places in 440 ms of which 5 ms to minimize.
[2024-05-28 06:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2024-05-28 06:33:44] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 106 ms.
[2024-05-28 06:33:44] [INFO ] Added : 11 causal constraints over 3 iterations in 594 ms. Result :sat
Minimization took 1971 ms.
[2024-05-28 06:33:47] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2024-05-28 06:33:47] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-28 06:33:47] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-05-28 06:33:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:33:47] [INFO ] [Nat]Absence check using 130 positive place invariants in 32 ms returned sat
[2024-05-28 06:33:47] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 06:33:50] [INFO ] [Nat]Absence check using state equation in 3334 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4] Max Struct:[4, 4]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 96 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 770/770 places, 1181/1181 transitions.
[2024-05-28 06:33:51] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:33:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (52229 resets) in 5985 ms. (167 steps per ms)
BEST_FIRST walk for 1000001 steps (3395 resets) in 1511 ms. (661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 06:33:58] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:33:58] [INFO ] Invariant cache hit.
[2024-05-28 06:33:58] [INFO ] [Real]Absence check using 130 positive place invariants in 32 ms returned sat
[2024-05-28 06:33:58] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-28 06:33:59] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-05-28 06:33:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:33:59] [INFO ] [Nat]Absence check using 130 positive place invariants in 31 ms returned sat
[2024-05-28 06:33:59] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 06:33:59] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2024-05-28 06:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:33:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 64 ms returned sat
[2024-05-28 06:34:00] [INFO ] Deduced a trap composed of 168 places in 376 ms of which 5 ms to minimize.
[2024-05-28 06:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2024-05-28 06:34:00] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 94 ms.
[2024-05-28 06:34:01] [INFO ] Added : 11 causal constraints over 3 iterations in 714 ms. Result :sat
Minimization took 2006 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 55 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 45 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-28 06:34:03] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:34:03] [INFO ] Invariant cache hit.
[2024-05-28 06:34:04] [INFO ] Implicit Places using invariants in 966 ms returned []
[2024-05-28 06:34:04] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:34:04] [INFO ] Invariant cache hit.
[2024-05-28 06:34:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:34:10] [INFO ] Implicit Places using invariants and state equation in 6803 ms returned []
Implicit Place search using SMT with State Equation took 7773 ms to find 0 implicit places.
[2024-05-28 06:34:11] [INFO ] Redundant transitions in 88 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 06:34:11] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:34:11] [INFO ] Invariant cache hit.
[2024-05-28 06:34:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1947 variables, and 136 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
[2024-05-28 06:34:47] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 0/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 4 (OVERLAPS) 4/769 variables, 4/137 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1947 variables, and 137 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 63393ms problems are : Problem set: 78 solved, 1097 unsolved
Search for dead transitions found 78 dead transitions in 63409ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1103/1181 transitions.
Applied a total of 0 rules in 28 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:35:14] [INFO ] Redundant transitions in 35 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71403 ms. Remains : 770/770 places, 1103/1181 transitions.
[2024-05-28 06:35:14] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 06:35:14] [INFO ] Computed 137 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (51955 resets) in 5322 ms. (187 steps per ms)
BEST_FIRST walk for 1000001 steps (3415 resets) in 1374 ms. (727 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 06:35:21] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:35:21] [INFO ] Invariant cache hit.
[2024-05-28 06:35:21] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-05-28 06:35:21] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 06:35:21] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-28 06:35:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:35:21] [INFO ] [Nat]Absence check using 130 positive place invariants in 29 ms returned sat
[2024-05-28 06:35:21] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-28 06:35:22] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2024-05-28 06:35:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:35:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 175 ms returned sat
[2024-05-28 06:35:23] [INFO ] Deduced a trap composed of 156 places in 385 ms of which 5 ms to minimize.
[2024-05-28 06:35:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2024-05-28 06:35:23] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 92 ms.
[2024-05-28 06:35:23] [INFO ] Added : 5 causal constraints over 1 iterations in 598 ms. Result :sat
Minimization took 1519 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 38 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:35:25] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:35:25] [INFO ] Invariant cache hit.
[2024-05-28 06:35:26] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-05-28 06:35:26] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:35:26] [INFO ] Invariant cache hit.
[2024-05-28 06:35:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:35:33] [INFO ] Implicit Places using invariants and state equation in 7354 ms returned []
Implicit Place search using SMT with State Equation took 8358 ms to find 0 implicit places.
[2024-05-28 06:35:33] [INFO ] Redundant transitions in 12 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:35:33] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:35:33] [INFO ] Invariant cache hit.
[2024-05-28 06:35:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:35:48] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:35:48] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:35:49] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:35:49] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 5 ms to minimize.
[2024-05-28 06:35:49] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:35:50] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:35:50] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:35:50] [INFO ] Deduced a trap composed of 245 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 5 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-05-28 06:35:51] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 6 ms to minimize.
[2024-05-28 06:35:52] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 7 ms to minimize.
[2024-05-28 06:35:52] [INFO ] Deduced a trap composed of 254 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:35:52] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-05-28 06:35:53] [INFO ] Deduced a trap composed of 196 places in 666 ms of which 5 ms to minimize.
[2024-05-28 06:35:53] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 5 ms to minimize.
[2024-05-28 06:35:54] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-05-28 06:35:54] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-28 06:35:55] [INFO ] Deduced a trap composed of 242 places in 306 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:35:55] [INFO ] Deduced a trap composed of 254 places in 234 ms of which 4 ms to minimize.
[2024-05-28 06:35:56] [INFO ] Deduced a trap composed of 245 places in 330 ms of which 5 ms to minimize.
[2024-05-28 06:35:56] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:35:56] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-05-28 06:35:57] [INFO ] Deduced a trap composed of 251 places in 327 ms of which 6 ms to minimize.
[2024-05-28 06:35:57] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-05-28 06:35:57] [INFO ] Deduced a trap composed of 233 places in 301 ms of which 4 ms to minimize.
[2024-05-28 06:35:58] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 4 ms to minimize.
[2024-05-28 06:35:58] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 5 ms to minimize.
[2024-05-28 06:35:58] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 5 ms to minimize.
[2024-05-28 06:35:59] [INFO ] Deduced a trap composed of 260 places in 260 ms of which 5 ms to minimize.
[2024-05-28 06:35:59] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 9 ms to minimize.
[2024-05-28 06:35:59] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:35:59] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:36:00] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 6 ms to minimize.
[2024-05-28 06:36:00] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:36:00] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:36:01] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 5 ms to minimize.
[2024-05-28 06:36:01] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-05-28 06:36:01] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 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/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:36:12] [INFO ] Deduced a trap composed of 200 places in 339 ms of which 4 ms to minimize.
[2024-05-28 06:36:12] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 5 ms to minimize.
[2024-05-28 06:36:12] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:36:12] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 5 ms to minimize.
[2024-05-28 06:36:13] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 4 ms to minimize.
[2024-05-28 06:36:13] [INFO ] Deduced a trap composed of 200 places in 322 ms of which 5 ms to minimize.
[2024-05-28 06:36:13] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 06:36:14] [INFO ] Deduced a trap composed of 200 places in 284 ms of which 5 ms to minimize.
[2024-05-28 06:36:14] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:36:14] [INFO ] Deduced a trap composed of 200 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 200 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:36:15] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 200 places in 308 ms of which 4 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:36:16] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 200 places in 366 ms of which 4 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 200 places in 277 ms of which 5 ms to minimize.
[2024-05-28 06:36:17] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:36:21] [INFO ] Deduced a trap composed of 345 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:36:21] [INFO ] Deduced a trap composed of 335 places in 329 ms of which 5 ms to minimize.
[2024-05-28 06:36:21] [INFO ] Deduced a trap composed of 246 places in 307 ms of which 4 ms to minimize.
[2024-05-28 06:36:22] [INFO ] Deduced a trap composed of 239 places in 266 ms of which 5 ms to minimize.
[2024-05-28 06:36:22] [INFO ] Deduced a trap composed of 246 places in 289 ms of which 5 ms to minimize.
[2024-05-28 06:36:22] [INFO ] Deduced a trap composed of 245 places in 308 ms of which 4 ms to minimize.
[2024-05-28 06:36:23] [INFO ] Deduced a trap composed of 248 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:36:23] [INFO ] Deduced a trap composed of 258 places in 293 ms of which 4 ms to minimize.
[2024-05-28 06:36:23] [INFO ] Deduced a trap composed of 239 places in 308 ms of which 5 ms to minimize.
[2024-05-28 06:36:24] [INFO ] Deduced a trap composed of 242 places in 304 ms of which 5 ms to minimize.
[2024-05-28 06:36:24] [INFO ] Deduced a trap composed of 248 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:36:24] [INFO ] Deduced a trap composed of 306 places in 492 ms of which 6 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 236 places in 303 ms of which 5 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 242 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:36:25] [INFO ] Deduced a trap composed of 251 places in 372 ms of which 4 ms to minimize.
[2024-05-28 06:36:26] [INFO ] Deduced a trap composed of 248 places in 323 ms of which 5 ms to minimize.
[2024-05-28 06:36:26] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 4 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 234 places in 320 ms of which 4 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 242 places in 312 ms of which 5 ms to minimize.
[2024-05-28 06:36:27] [INFO ] Deduced a trap composed of 251 places in 274 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 196 places in 375 ms of which 5 ms to minimize.
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 6 ms to minimize.
[2024-05-28 06:36:33] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 06:36:34] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 9 ms to minimize.
[2024-05-28 06:36:34] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:36:34] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:36:35] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 6 ms to minimize.
[2024-05-28 06:36:35] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-28 06:36:35] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 4 ms to minimize.
[2024-05-28 06:36:36] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 6 ms to minimize.
[2024-05-28 06:36:36] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 4 ms to minimize.
[2024-05-28 06:36:36] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 4 ms to minimize.
[2024-05-28 06:36:37] [INFO ] Deduced a trap composed of 196 places in 371 ms of which 6 ms to minimize.
SMT process timed out in 63333ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71765 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2125 resets) in 1389 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (139 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 245796 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 245796 steps, saw 74705 distinct states, run finished after 3008 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-28 06:36:40] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:36:40] [INFO ] Invariant cache hit.
[2024-05-28 06:36:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1922ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:36:42] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:36:42] [INFO ] Invariant cache hit.
[2024-05-28 06:36:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:36:58] [INFO ] Deduced a trap composed of 245 places in 366 ms of which 5 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 233 places in 307 ms of which 4 ms to minimize.
[2024-05-28 06:36:59] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:37:00] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:37:00] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:37:00] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:37:01] [INFO ] Deduced a trap composed of 245 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:37:01] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 6 ms to minimize.
[2024-05-28 06:37:01] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 6 ms to minimize.
[2024-05-28 06:37:02] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
[2024-05-28 06:37:02] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 5 ms to minimize.
[2024-05-28 06:37:03] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 4 ms to minimize.
[2024-05-28 06:37:03] [INFO ] Deduced a trap composed of 254 places in 309 ms of which 5 ms to minimize.
[2024-05-28 06:37:03] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 4 ms to minimize.
[2024-05-28 06:37:04] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 06:37:04] [INFO ] Deduced a trap composed of 242 places in 303 ms of which 4 ms to minimize.
[2024-05-28 06:37:04] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
[2024-05-28 06:37:05] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-05-28 06:37:05] [INFO ] Deduced a trap composed of 242 places in 370 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:06] [INFO ] Deduced a trap composed of 254 places in 351 ms of which 5 ms to minimize.
SMT process timed out in 23307ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23327ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23376 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40001 steps (2108 resets) in 472 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (123 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (126 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 281442 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 281442 steps, saw 85587 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-28 06:37:09] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:37:09] [INFO ] Invariant cache hit.
[2024-05-28 06:37:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2014ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:37:11] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:37:11] [INFO ] Invariant cache hit.
[2024-05-28 06:37:12] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2024-05-28 06:37:12] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:37:12] [INFO ] Invariant cache hit.
[2024-05-28 06:37:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:37:20] [INFO ] Implicit Places using invariants and state equation in 7483 ms returned []
Implicit Place search using SMT with State Equation took 8517 ms to find 0 implicit places.
[2024-05-28 06:37:20] [INFO ] Redundant transitions in 15 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:37:20] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:37:20] [INFO ] Invariant cache hit.
[2024-05-28 06:37:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:34] [INFO ] Deduced a trap composed of 245 places in 314 ms of which 5 ms to minimize.
[2024-05-28 06:37:34] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:37:35] [INFO ] Deduced a trap composed of 233 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:37:35] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:37:35] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:37:36] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 5 ms to minimize.
[2024-05-28 06:37:36] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:37:36] [INFO ] Deduced a trap composed of 245 places in 255 ms of which 5 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 5 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 06:37:37] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 6 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 4 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 4 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 242 places in 314 ms of which 5 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 242 places in 322 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 4 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 248 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 251 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 196 places in 393 ms of which 5 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 233 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 5 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 5 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 260 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 5 ms to minimize.
[2024-05-28 06:37:45] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:37:45] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:37:45] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:37:46] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
[2024-05-28 06:37:46] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:37:46] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:37:47] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:37:47] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 200 places in 345 ms of which 5 ms to minimize.
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-05-28 06:37:59] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 6 ms to minimize.
[2024-05-28 06:37:59] [INFO ] Deduced a trap composed of 196 places in 379 ms of which 6 ms to minimize.
[2024-05-28 06:37:59] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 200 places in 357 ms of which 5 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 200 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 200 places in 340 ms of which 5 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 200 places in 287 ms of which 8 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 4 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 3 ms to minimize.
[2024-05-28 06:38:03] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:38:04] [INFO ] Deduced a trap composed of 200 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:38:04] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 345 places in 282 ms of which 5 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 335 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 246 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 239 places in 313 ms of which 3 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 246 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 245 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 248 places in 335 ms of which 5 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 258 places in 317 ms of which 5 ms to minimize.
[2024-05-28 06:38:10] [INFO ] Deduced a trap composed of 239 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:38:10] [INFO ] Deduced a trap composed of 242 places in 275 ms of which 5 ms to minimize.
[2024-05-28 06:38:10] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:38:11] [INFO ] Deduced a trap composed of 306 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:38:11] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:38:11] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 5 ms to minimize.
[2024-05-28 06:38:11] [INFO ] Deduced a trap composed of 251 places in 266 ms of which 6 ms to minimize.
[2024-05-28 06:38:12] [INFO ] Deduced a trap composed of 248 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:38:12] [INFO ] Deduced a trap composed of 236 places in 304 ms of which 4 ms to minimize.
[2024-05-28 06:38:12] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 5 ms to minimize.
[2024-05-28 06:38:13] [INFO ] Deduced a trap composed of 242 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:38:13] [INFO ] Deduced a trap composed of 251 places in 283 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:38:18] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
[2024-05-28 06:38:19] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 4 ms to minimize.
[2024-05-28 06:38:20] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-05-28 06:38:21] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-28 06:38:22] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 06:38:22] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-28 06:38:22] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62881ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71476 ms. Remains : 770/770 places, 1103/1103 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 06:38:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:38:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (527 resets) in 50 ms. (196 steps per ms)
BEST_FIRST walk for 10000 steps (35 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 06:38:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:38:23] [INFO ] Invariant cache hit.
[2024-05-28 06:38:23] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-05-28 06:38:23] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-28 06:38:23] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-05-28 06:38:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:38:23] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2024-05-28 06:38:23] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 06:38:24] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2024-05-28 06:38:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:38:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 147 ms returned sat
[2024-05-28 06:38:24] [INFO ] Deduced a trap composed of 156 places in 330 ms of which 5 ms to minimize.
[2024-05-28 06:38:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 548 ms
[2024-05-28 06:38:25] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 109 ms.
[2024-05-28 06:38:25] [INFO ] Added : 5 causal constraints over 1 iterations in 582 ms. Result :sat
Minimization took 614 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:38:26] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:38:26] [INFO ] Invariant cache hit.
[2024-05-28 06:38:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 245 places in 341 ms of which 5 ms to minimize.
[2024-05-28 06:38:40] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 5 ms to minimize.
[2024-05-28 06:38:41] [INFO ] Deduced a trap composed of 233 places in 322 ms of which 4 ms to minimize.
[2024-05-28 06:38:41] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:38:42] [INFO ] Deduced a trap composed of 230 places in 355 ms of which 6 ms to minimize.
[2024-05-28 06:38:42] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 06:38:42] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-05-28 06:38:43] [INFO ] Deduced a trap composed of 245 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:38:43] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:38:43] [INFO ] Deduced a trap composed of 196 places in 359 ms of which 5 ms to minimize.
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:38:44] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 3 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 254 places in 295 ms of which 6 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:38:45] [INFO ] Deduced a trap composed of 242 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 6 ms to minimize.
[2024-05-28 06:38:46] [INFO ] Deduced a trap composed of 242 places in 272 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 254 places in 240 ms of which 4 ms to minimize.
[2024-05-28 06:38:47] [INFO ] Deduced a trap composed of 245 places in 292 ms of which 4 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 248 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:38:48] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:38:49] [INFO ] Deduced a trap composed of 251 places in 345 ms of which 8 ms to minimize.
[2024-05-28 06:38:49] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 158 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 26/158 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:38:52] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 3 ms to minimize.
[2024-05-28 06:38:54] [INFO ] Deduced a trap composed of 246 places in 343 ms of which 4 ms to minimize.
[2024-05-28 06:38:54] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:38:55] [INFO ] Deduced a trap composed of 227 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:38:55] [INFO ] Deduced a trap composed of 227 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:38:55] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:38:55] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:38:56] [INFO ] Deduced a trap composed of 225 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:38:56] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:38:56] [INFO ] Deduced a trap composed of 249 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:38:57] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:38:57] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:38:57] [INFO ] Deduced a trap composed of 345 places in 307 ms of which 4 ms to minimize.
[2024-05-28 06:38:58] [INFO ] Deduced a trap composed of 343 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:38:58] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:38:58] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:38:58] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:38:59] [INFO ] Deduced a trap composed of 243 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:38:59] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-05-28 06:38:59] [INFO ] Deduced a trap composed of 239 places in 272 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:39:00] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:39:01] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:39:01] [INFO ] Deduced a trap composed of 248 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:39:01] [INFO ] Deduced a trap composed of 239 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 243 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 245 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:39:02] [INFO ] Deduced a trap composed of 261 places in 283 ms of which 4 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 248 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 218 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:39:03] [INFO ] Deduced a trap composed of 236 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:39:04] [INFO ] Deduced a trap composed of 248 places in 304 ms of which 4 ms to minimize.
[2024-05-28 06:39:04] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:39:04] [INFO ] Deduced a trap composed of 245 places in 282 ms of which 5 ms to minimize.
[2024-05-28 06:39:05] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:39:05] [INFO ] Deduced a trap composed of 254 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:39:05] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:39:06] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 4 ms to minimize.
[2024-05-28 06:39:06] [INFO ] Deduced a trap composed of 240 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:39:06] [INFO ] Deduced a trap composed of 197 places in 292 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:39:08] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-05-28 06:39:09] [INFO ] Deduced a trap composed of 200 places in 295 ms of which 5 ms to minimize.
[2024-05-28 06:39:09] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 4 ms to minimize.
SMT process timed out in 43287ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 43301ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43336 ms. Remains : 770/770 places, 1103/1103 transitions.
[2024-05-28 06:39:09] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:39:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (51945 resets) in 4984 ms. (200 steps per ms)
BEST_FIRST walk for 1000001 steps (3358 resets) in 1255 ms. (796 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 06:39:15] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:39:15] [INFO ] Invariant cache hit.
[2024-05-28 06:39:16] [INFO ] [Real]Absence check using 130 positive place invariants in 27 ms returned sat
[2024-05-28 06:39:16] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 06:39:16] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2024-05-28 06:39:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:39:16] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2024-05-28 06:39:16] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-28 06:39:17] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2024-05-28 06:39:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:39:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 88 ms returned sat
[2024-05-28 06:39:17] [INFO ] Deduced a trap composed of 156 places in 339 ms of which 5 ms to minimize.
[2024-05-28 06:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-05-28 06:39:17] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 78 ms.
[2024-05-28 06:39:18] [INFO ] Added : 5 causal constraints over 1 iterations in 482 ms. Result :sat
Minimization took 1621 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:39:19] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:39:19] [INFO ] Invariant cache hit.
[2024-05-28 06:39:20] [INFO ] Implicit Places using invariants in 926 ms returned []
[2024-05-28 06:39:20] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:39:20] [INFO ] Invariant cache hit.
[2024-05-28 06:39:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:39:28] [INFO ] Implicit Places using invariants and state equation in 7459 ms returned []
Implicit Place search using SMT with State Equation took 8399 ms to find 0 implicit places.
[2024-05-28 06:39:28] [INFO ] Redundant transitions in 23 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:39:28] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:39:28] [INFO ] Invariant cache hit.
[2024-05-28 06:39:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:39:43] [INFO ] Deduced a trap composed of 245 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:39:44] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 230 places in 316 ms of which 4 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:39:45] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 3 ms to minimize.
[2024-05-28 06:39:46] [INFO ] Deduced a trap composed of 245 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:39:46] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-05-28 06:39:46] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:39:47] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:39:47] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:39:47] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:39:48] [INFO ] Deduced a trap composed of 254 places in 264 ms of which 3 ms to minimize.
[2024-05-28 06:39:48] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:39:48] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:39:48] [INFO ] Deduced a trap composed of 242 places in 292 ms of which 4 ms to minimize.
[2024-05-28 06:39:49] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:39:49] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 06:39:49] [INFO ] Deduced a trap composed of 242 places in 266 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:39:50] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:39:50] [INFO ] Deduced a trap composed of 245 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:39:51] [INFO ] Deduced a trap composed of 248 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:39:51] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:39:51] [INFO ] Deduced a trap composed of 251 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:39:52] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:39:52] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:39:52] [INFO ] Deduced a trap composed of 236 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:39:53] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:39:53] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:39:53] [INFO ] Deduced a trap composed of 260 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:39:53] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:39:54] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:39:54] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 5 ms to minimize.
[2024-05-28 06:39:54] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 06:39:55] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:39:55] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-05-28 06:39:55] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-05-28 06:39:56] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-05-28 06:39:56] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:40:06] [INFO ] Deduced a trap composed of 200 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 4 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 3 ms to minimize.
[2024-05-28 06:40:07] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:40:08] [INFO ] Deduced a trap composed of 200 places in 278 ms of which 5 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 200 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:40:09] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 4 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 200 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:40:10] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:40:11] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 06:40:11] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:40:11] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:40:12] [INFO ] Deduced a trap composed of 200 places in 313 ms of which 4 ms to minimize.
[2024-05-28 06:40:12] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:40:15] [INFO ] Deduced a trap composed of 345 places in 305 ms of which 5 ms to minimize.
[2024-05-28 06:40:16] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 5 ms to minimize.
[2024-05-28 06:40:16] [INFO ] Deduced a trap composed of 246 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:40:16] [INFO ] Deduced a trap composed of 239 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:40:16] [INFO ] Deduced a trap composed of 246 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 245 places in 241 ms of which 3 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 248 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:40:17] [INFO ] Deduced a trap composed of 258 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 248 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:40:18] [INFO ] Deduced a trap composed of 306 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:40:19] [INFO ] Deduced a trap composed of 251 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:40:20] [INFO ] Deduced a trap composed of 248 places in 289 ms of which 4 ms to minimize.
[2024-05-28 06:40:20] [INFO ] Deduced a trap composed of 236 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:40:20] [INFO ] Deduced a trap composed of 234 places in 310 ms of which 4 ms to minimize.
[2024-05-28 06:40:21] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:40:21] [INFO ] Deduced a trap composed of 251 places in 267 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:40:26] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 6 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:40:27] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:40:28] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:40:28] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 3 ms to minimize.
[2024-05-28 06:40:28] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:40:29] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:40:29] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:40:29] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:40:30] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 63602ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63676ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72134 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2114 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 289060 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 289060 steps, saw 87892 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-28 06:40:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:40:35] [INFO ] Invariant cache hit.
[2024-05-28 06:40:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1979ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 37 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:40:37] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:40:37] [INFO ] Invariant cache hit.
[2024-05-28 06:40:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 245 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:40:51] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 233 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:40:52] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 4 ms to minimize.
[2024-05-28 06:40:53] [INFO ] Deduced a trap composed of 245 places in 276 ms of which 3 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:40:54] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:40:55] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:40:55] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:40:55] [INFO ] Deduced a trap composed of 254 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:40:55] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:40:56] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:40:56] [INFO ] Deduced a trap composed of 242 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:40:56] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:40:57] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-05-28 06:40:57] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:40:58] [INFO ] Deduced a trap composed of 254 places in 268 ms of which 3 ms to minimize.
[2024-05-28 06:40:58] [INFO ] Deduced a trap composed of 245 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 248 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 251 places in 265 ms of which 4 ms to minimize.
[2024-05-28 06:40:59] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:41:00] [INFO ] Deduced a trap composed of 233 places in 297 ms of which 4 ms to minimize.
SMT process timed out in 23011ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23025ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23065 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2057 resets) in 429 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (125 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (148 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 235064 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 235064 steps, saw 71435 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-28 06:41:03] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:41:03] [INFO ] Invariant cache hit.
[2024-05-28 06:41:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1984ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:41:05] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:41:05] [INFO ] Invariant cache hit.
[2024-05-28 06:41:06] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-28 06:41:06] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:41:06] [INFO ] Invariant cache hit.
[2024-05-28 06:41:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:41:14] [INFO ] Implicit Places using invariants and state equation in 7891 ms returned []
Implicit Place search using SMT with State Equation took 8872 ms to find 0 implicit places.
[2024-05-28 06:41:14] [INFO ] Redundant transitions in 9 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:41:14] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:41:14] [INFO ] Invariant cache hit.
[2024-05-28 06:41:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:41:28] [INFO ] Deduced a trap composed of 245 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:41:29] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 06:41:29] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:41:29] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:41:30] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 5 ms to minimize.
[2024-05-28 06:41:30] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:41:30] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 06:41:31] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 3 ms to minimize.
[2024-05-28 06:41:31] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 3 ms to minimize.
[2024-05-28 06:41:31] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:41:31] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:41:32] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:41:32] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 3 ms to minimize.
[2024-05-28 06:41:32] [INFO ] Deduced a trap composed of 254 places in 279 ms of which 3 ms to minimize.
[2024-05-28 06:41:33] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
[2024-05-28 06:41:33] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:41:33] [INFO ] Deduced a trap composed of 242 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 3 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:41:34] [INFO ] Deduced a trap composed of 242 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 3 ms to minimize.
[2024-05-28 06:41:35] [INFO ] Deduced a trap composed of 245 places in 283 ms of which 4 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 248 places in 256 ms of which 5 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 3 ms to minimize.
[2024-05-28 06:41:36] [INFO ] Deduced a trap composed of 251 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:41:37] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 5 ms to minimize.
[2024-05-28 06:41:37] [INFO ] Deduced a trap composed of 233 places in 294 ms of which 4 ms to minimize.
[2024-05-28 06:41:37] [INFO ] Deduced a trap composed of 236 places in 320 ms of which 4 ms to minimize.
[2024-05-28 06:41:38] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 4 ms to minimize.
[2024-05-28 06:41:38] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 4 ms to minimize.
[2024-05-28 06:41:38] [INFO ] Deduced a trap composed of 260 places in 334 ms of which 4 ms to minimize.
[2024-05-28 06:41:39] [INFO ] Deduced a trap composed of 236 places in 302 ms of which 4 ms to minimize.
[2024-05-28 06:41:39] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 06:41:39] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 06:41:39] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 3 ms to minimize.
[2024-05-28 06:41:40] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 06:41:41] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:41:41] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:41:51] [INFO ] Deduced a trap composed of 200 places in 322 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:41:52] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:41:53] [INFO ] Deduced a trap composed of 200 places in 320 ms of which 4 ms to minimize.
[2024-05-28 06:41:53] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 06:41:53] [INFO ] Deduced a trap composed of 200 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:41:54] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:41:54] [INFO ] Deduced a trap composed of 200 places in 321 ms of which 4 ms to minimize.
[2024-05-28 06:41:54] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-05-28 06:41:55] [INFO ] Deduced a trap composed of 200 places in 312 ms of which 5 ms to minimize.
[2024-05-28 06:41:55] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 06:41:55] [INFO ] Deduced a trap composed of 200 places in 301 ms of which 4 ms to minimize.
[2024-05-28 06:41:56] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 06:41:56] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:41:56] [INFO ] Deduced a trap composed of 200 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:41:57] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 4 ms to minimize.
[2024-05-28 06:41:57] [INFO ] Deduced a trap composed of 200 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:41:57] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:42:00] [INFO ] Deduced a trap composed of 345 places in 287 ms of which 4 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 335 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 246 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:42:01] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 246 places in 246 ms of which 4 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 245 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 248 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:42:02] [INFO ] Deduced a trap composed of 258 places in 284 ms of which 4 ms to minimize.
[2024-05-28 06:42:03] [INFO ] Deduced a trap composed of 239 places in 274 ms of which 4 ms to minimize.
[2024-05-28 06:42:03] [INFO ] Deduced a trap composed of 242 places in 276 ms of which 4 ms to minimize.
[2024-05-28 06:42:03] [INFO ] Deduced a trap composed of 248 places in 299 ms of which 4 ms to minimize.
[2024-05-28 06:42:04] [INFO ] Deduced a trap composed of 306 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:42:04] [INFO ] Deduced a trap composed of 236 places in 334 ms of which 5 ms to minimize.
[2024-05-28 06:42:04] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 4 ms to minimize.
[2024-05-28 06:42:05] [INFO ] Deduced a trap composed of 251 places in 306 ms of which 4 ms to minimize.
[2024-05-28 06:42:05] [INFO ] Deduced a trap composed of 248 places in 297 ms of which 4 ms to minimize.
[2024-05-28 06:42:05] [INFO ] Deduced a trap composed of 236 places in 306 ms of which 3 ms to minimize.
[2024-05-28 06:42:06] [INFO ] Deduced a trap composed of 234 places in 289 ms of which 5 ms to minimize.
[2024-05-28 06:42:06] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 4 ms to minimize.
[2024-05-28 06:42:06] [INFO ] Deduced a trap composed of 251 places in 347 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:42:11] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 14 ms to minimize.
[2024-05-28 06:42:12] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:42:12] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:42:12] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 06:42:13] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 06:42:13] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:42:13] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:42:14] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 06:42:14] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 06:42:14] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 06:42:15] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 4 ms to minimize.
[2024-05-28 06:42:15] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 6 ms to minimize.
[2024-05-28 06:42:15] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62331ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71272 ms. Remains : 770/770 places, 1103/1103 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06 in 233733 ms.
[2024-05-28 06:42:17] [INFO ] Flatten gal took : 302 ms
[2024-05-28 06:42:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 9 ms.
[2024-05-28 06:42:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1103 transitions and 5634 arcs took 32 ms.
Total runtime 590712 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S05J60

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 770
TRANSITIONS: 1103
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2406
MODEL NAME: /home/mcc/execution/416/model
770 places, 1103 transitions.

No place bound informations found.
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBNT-COL-S05J60, 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 r289-tajo-171654445800389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;