About the Execution of GreatSPN+red for SafeBus-COL-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3321.556 | 405762.00 | 594393.00 | 1011.30 | 1 1 5 5 6 1 6 1 1 1 1 5 6 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r333-tall-171679078300365.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SafeBus-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078300365
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-06-UpperBounds-00
FORMULA_NAME SafeBus-COL-06-UpperBounds-01
FORMULA_NAME SafeBus-COL-06-UpperBounds-02
FORMULA_NAME SafeBus-COL-06-UpperBounds-03
FORMULA_NAME SafeBus-COL-06-UpperBounds-04
FORMULA_NAME SafeBus-COL-06-UpperBounds-05
FORMULA_NAME SafeBus-COL-06-UpperBounds-06
FORMULA_NAME SafeBus-COL-06-UpperBounds-07
FORMULA_NAME SafeBus-COL-06-UpperBounds-08
FORMULA_NAME SafeBus-COL-06-UpperBounds-09
FORMULA_NAME SafeBus-COL-06-UpperBounds-10
FORMULA_NAME SafeBus-COL-06-UpperBounds-11
FORMULA_NAME SafeBus-COL-06-UpperBounds-12
FORMULA_NAME SafeBus-COL-06-UpperBounds-13
FORMULA_NAME SafeBus-COL-06-UpperBounds-14
FORMULA_NAME SafeBus-COL-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716840183089
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:03:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 20:03:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:03:04] [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-27 20:03:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:03:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 595 ms
[2024-05-27 20:03:04] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-05-27 20:03:04] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-27 20:03:05] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 3 ms.
[2024-05-27 20:03:05] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 20:03:05] [INFO ] Computed 7 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 0, 0, 0, 6, 0, 0, 1, 0, 0, 6, 0, 1, 1] Max Struct:[1, 1, 6, 6, 6, 1, 6, 3, 1, 1, 1, 6, 6, 1, 1, 1]
FORMULA SafeBus-COL-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 20:03:05] [INFO ] Invariant cache hit.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 20:03:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:05] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:05] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 9 ms.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:05] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 9 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 20:03:05] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:05] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:05] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:03:05] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 9 ms.
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 20:03:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:03:05] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:03:06] [INFO ] Added : 12 causal constraints over 5 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 20:03:06] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Added 3 Read/Feed constraints in 6 ms returned sat
[2024-05-27 20:03:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:03:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:03:06] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2024-05-27 20:03:06] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 34 ms.
[2024-05-27 20:03:06] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 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:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
[2024-05-27 20:03:06] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:03:06] [INFO ] Computed 29 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
RANDOM walk for 10000 steps (2 resets) in 80 ms. (123 steps per ms)
FORMULA SafeBus-COL-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 1, 5] Max Struct:[6, 6, 3, 6]
[2024-05-27 20:03:06] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 20:03:06] [INFO ] Invariant cache hit.
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-27 20:03:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-27 20:03:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:03:06] [INFO ] [Nat]Added 43 Read/Feed constraints in 42 ms returned sat
[2024-05-27 20:03:06] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 29 ms.
[2024-05-27 20:03:06] [INFO ] Added : 1 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 100 ms.
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-27 20:03:06] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-27 20:03:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Nat]Added 43 Read/Feed constraints in 58 ms returned sat
[2024-05-27 20:03:07] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 12 ms to minimize.
[2024-05-27 20:03:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-27 20:03:07] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 32 ms.
[2024-05-27 20:03:07] [INFO ] Added : 1 causal constraints over 1 iterations in 68 ms. Result :sat
Minimization took 112 ms.
[2024-05-27 20:03:07] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned unsat
[2024-05-27 20:03:07] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-27 20:03:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-27 20:03:07] [INFO ] [Nat]Added 43 Read/Feed constraints in 40 ms returned sat
[2024-05-27 20:03:07] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 311 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 1, 5] Max Struct:[6, 6, 1, 5]
FORMULA SafeBus-COL-06-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 44 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 138/138 places, 451/451 transitions.
[2024-05-27 20:03:08] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 20:03:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2395 ms. (417 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1715 ms. (1165 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-27 20:03:12] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 20:03:12] [INFO ] Invariant cache hit.
[2024-05-27 20:03:12] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:12] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 20:03:12] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-27 20:03:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:12] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 20:03:12] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-27 20:03:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:03:12] [INFO ] [Nat]Added 43 Read/Feed constraints in 42 ms returned sat
[2024-05-27 20:03:12] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 22 ms.
[2024-05-27 20:03:12] [INFO ] Added : 1 causal constraints over 1 iterations in 56 ms. Result :sat
Minimization took 97 ms.
[2024-05-27 20:03:12] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:12] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 20:03:12] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-27 20:03:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-27 20:03:12] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 20:03:13] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-27 20:03:13] [INFO ] [Nat]Added 43 Read/Feed constraints in 58 ms returned sat
[2024-05-27 20:03:13] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-27 20:03:13] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 25 ms.
[2024-05-27 20:03:13] [INFO ] Added : 1 causal constraints over 1 iterations in 59 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 19 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 18 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-27 20:03:13] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 20:03:13] [INFO ] Invariant cache hit.
[2024-05-27 20:03:13] [INFO ] Implicit Places using invariants in 161 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 184 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/138 places, 451/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 565
Applied a total of 12 rules in 73 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2024-05-27 20:03:13] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2024-05-27 20:03:13] [INFO ] Computed 23 invariants in 16 ms
[2024-05-27 20:03:13] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-27 20:03:13] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 20:03:13] [INFO ] Invariant cache hit.
[2024-05-27 20:03:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:03:14] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/138 places, 565/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 953 ms. Remains : 126/138 places, 565/451 transitions.
[2024-05-27 20:03:14] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 20:03:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2998 ms. (333 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1997 ms. (1001 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-27 20:03:19] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 20:03:19] [INFO ] Invariant cache hit.
[2024-05-27 20:03:19] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:19] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:03:19] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-27 20:03:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:19] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:03:19] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-27 20:03:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:03:19] [INFO ] [Nat]Added 43 Read/Feed constraints in 87 ms returned sat
[2024-05-27 20:03:19] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 44 ms.
[2024-05-27 20:03:19] [INFO ] Added : 6 causal constraints over 2 iterations in 102 ms. Result :sat
Minimization took 221 ms.
[2024-05-27 20:03:20] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:03:20] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:03:20] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:03:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 20:03:20] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-27 20:03:20] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-27 20:03:20] [INFO ] [Nat]Added 43 Read/Feed constraints in 65 ms returned sat
[2024-05-27 20:03:20] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 38 ms.
[2024-05-27 20:03:20] [INFO ] Added : 1 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 211 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 55 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 126/126 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 30 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-05-27 20:03:20] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 20:03:20] [INFO ] Invariant cache hit.
[2024-05-27 20:03:21] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 20:03:21] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 20:03:21] [INFO ] Invariant cache hit.
[2024-05-27 20:03:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:03:21] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-27 20:03:21] [INFO ] Redundant transitions in 27 ms returned []
Running 559 sub problems to find dead transitions.
[2024-05-27 20:03:21] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 20:03:21] [INFO ] Invariant cache hit.
[2024-05-27 20:03:21] [INFO ] State equation strengthened by 43 read => feed constraints.
Problem TDEAD31 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 6 solved, 553 unsolved
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 20:03:24] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:03:25] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:03:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-27 20:03:25] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:03:25] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-27 20:03:26] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-27 20:03:26] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:03:26] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-27 20:03:26] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:03:26] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:03:26] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:03:26] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:03:27] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/36 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 20:03:28] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:03:29] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-05-27 20:03:29] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:03:29] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:03:29] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:03:29] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 6/42 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (OVERLAPS) 356/482 variables, 126/168 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 43/211 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 20:03:38] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 1/212 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 20:03:42] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/213 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/213 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 213 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 36 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 21/44 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 20:03:54] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:03:54] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-27 20:03:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:03:54] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-27 20:03:54] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:03:54] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:03:55] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:03:55] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-27 20:03:55] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 4 ms to minimize.
[2024-05-27 20:03:56] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:03:56] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 11/55 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 20:04:00] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/56 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/56 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/182 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/225 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/748 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 748 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/559 constraints, Known Traps: 33/33 constraints]
After SMT, in 61721ms problems are : Problem set: 36 solved, 523 unsolved
Search for dead transitions found 36 dead transitions in 61742ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 529/565 transitions.
Applied a total of 0 rules in 27 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 20:04:23] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62574 ms. Remains : 126/126 places, 529/565 transitions.
[2024-05-27 20:04:23] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:04:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2994 ms. (333 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1936 ms. (1032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-27 20:04:28] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:04:28] [INFO ] Invariant cache hit.
[2024-05-27 20:04:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:04:28] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-27 20:04:28] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-27 20:04:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:04:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 20:04:28] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:04:28] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-27 20:04:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:04:28] [INFO ] [Nat]Added 43 Read/Feed constraints in 91 ms returned sat
[2024-05-27 20:04:28] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 48 ms.
[2024-05-27 20:04:28] [INFO ] Added : 6 causal constraints over 2 iterations in 121 ms. Result :sat
Minimization took 256 ms.
[2024-05-27 20:04:29] [INFO ] [Real]Absence check using 10 positive place invariants in 80 ms returned sat
[2024-05-27 20:04:29] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 107 ms returned sat
[2024-05-27 20:04:29] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-05-27 20:04:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:04:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-27 20:04:29] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:04:29] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-27 20:04:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 63 ms returned sat
[2024-05-27 20:04:30] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 27 ms.
[2024-05-27 20:04:30] [INFO ] Added : 2 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 20:04:30] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:04:30] [INFO ] Invariant cache hit.
[2024-05-27 20:04:30] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-27 20:04:30] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:04:30] [INFO ] Invariant cache hit.
[2024-05-27 20:04:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:04:31] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
[2024-05-27 20:04:31] [INFO ] Redundant transitions in 44 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 20:04:31] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:04:31] [INFO ] Invariant cache hit.
[2024-05-27 20:04:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:04:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:04:34] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:04:34] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:04:34] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:04:34] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:04:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:04:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:04:35] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-27 20:04:35] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:04:35] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-27 20:04:35] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:04:35] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:04:35] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-27 20:04:36] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2024-05-27 20:04:36] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:04:36] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:04:36] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:04:36] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 6 ms to minimize.
[2024-05-27 20:04:36] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:04:36] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:04:37] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:04:37] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:04:38] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:04:38] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:04:38] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:04:41] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:04:50] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:05:05] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:05:08] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61292ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62332 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 1517 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 343747 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 4
Probabilistic random walk after 343747 steps, saw 154675 distinct states, run finished after 3011 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-27 20:05:36] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:05:36] [INFO ] Invariant cache hit.
[2024-05-27 20:05:36] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/123 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 355/479 variables, 124/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 42/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/482 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/482 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 192 constraints, problems are : Problem set: 0 solved, 4 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 20:05:37] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:05:37] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 4/194 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-27 20:05:37] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:05:37] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:05:37] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:05:37] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:05:37] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:05:38] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:05:38] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 7/201 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/203 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 205 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 1650ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 481079 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 2
Probabilistic random walk after 481079 steps, saw 212339 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-05-27 20:05:41] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:05:41] [INFO ] Invariant cache hit.
[2024-05-27 20:05:41] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:05:42] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 891ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 20:05:42] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:05:42] [INFO ] Invariant cache hit.
[2024-05-27 20:05:42] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-27 20:05:42] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:05:42] [INFO ] Invariant cache hit.
[2024-05-27 20:05:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:05:43] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-27 20:05:43] [INFO ] Redundant transitions in 3 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 20:05:43] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:05:43] [INFO ] Invariant cache hit.
[2024-05-27 20:05:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:05:45] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-27 20:05:46] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:05:47] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:05:48] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:05:49] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:05:49] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2024-05-27 20:05:49] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:05:50] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:05:50] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:05:53] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:06:03] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:06:16] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:06:20] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61296ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61940 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 203 place count 96 transition count 296
Iterating global reduction 1 with 30 rules applied. Total rules applied 233 place count 96 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 94 transition count 295
Graph (trivial) has 19 edges and 94 vertex of which 8 / 94 are part of one of the 1 SCC in 2 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 87 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 400 place count 87 transition count 132
Applied a total of 400 rules in 29 ms. Remains 87 /126 variables (removed 39) and now considering 132/529 (removed 397) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 87 cols
[2024-05-27 20:06:44] [INFO ] Computed 22 invariants in 3 ms
[2024-05-27 20:06:44] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 20:06:44] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:06:44] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 20:06:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 20:06:44] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:06:44] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 20:06:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-27 20:06:44] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 20:06:44] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-27 20:06:44] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
FORMULA SafeBus-COL-06-UpperBounds-03 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[5] Max Struct:[6]
Starting property specific reduction for SafeBus-COL-06-UpperBounds-02
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-27 20:06:44] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2024-05-27 20:06:44] [INFO ] Computed 23 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-27 20:06:44] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:06:44] [INFO ] Invariant cache hit.
[2024-05-27 20:06:44] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 20:06:44] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:06:44] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-27 20:06:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:06:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 20:06:44] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:06:45] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-27 20:06:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:06:45] [INFO ] [Nat]Added 43 Read/Feed constraints in 90 ms returned sat
[2024-05-27 20:06:45] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 29 ms.
[2024-05-27 20:06:45] [INFO ] Added : 6 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
[2024-05-27 20:06:45] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:06:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 2931 ms. (341 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1068 ms. (935 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-27 20:06:49] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:06:49] [INFO ] Invariant cache hit.
[2024-05-27 20:06:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:06:49] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:06:49] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-27 20:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:06:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:06:49] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:06:49] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-27 20:06:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:06:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 87 ms returned sat
[2024-05-27 20:06:49] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 24 ms.
[2024-05-27 20:06:50] [INFO ] Added : 6 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 21 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 20:06:50] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:06:50] [INFO ] Invariant cache hit.
[2024-05-27 20:06:50] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-27 20:06:50] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:06:50] [INFO ] Invariant cache hit.
[2024-05-27 20:06:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:06:51] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-27 20:06:51] [INFO ] Redundant transitions in 5 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 20:06:51] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:06:51] [INFO ] Invariant cache hit.
[2024-05-27 20:06:51] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:06:53] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:06:53] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:06:53] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:06:53] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:06:54] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 1 ms to minimize.
[2024-05-27 20:06:55] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:06:56] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:06:56] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:06:56] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-27 20:06:56] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:06:56] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:06:57] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-27 20:06:57] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:06:57] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:06:57] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:06:58] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:07:00] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:07:10] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:07:24] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:07:28] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61287ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61954 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 456026 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 2
Probabilistic random walk after 456026 steps, saw 201817 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-27 20:07:55] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:07:55] [INFO ] Invariant cache hit.
[2024-05-27 20:07:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:07:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 416 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 501078 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 2
Probabilistic random walk after 501078 steps, saw 220587 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2024-05-27 20:07:59] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:07:59] [INFO ] Invariant cache hit.
[2024-05-27 20:07:59] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:07:59] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-27 20:07:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:07:59] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-27 20:08:00] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:08:00] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 885ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 20:08:00] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:08:00] [INFO ] Invariant cache hit.
[2024-05-27 20:08:00] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-27 20:08:00] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:08:00] [INFO ] Invariant cache hit.
[2024-05-27 20:08:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:08:01] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-27 20:08:01] [INFO ] Redundant transitions in 3 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 20:08:01] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 20:08:01] [INFO ] Invariant cache hit.
[2024-05-27 20:08:01] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:08:04] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-27 20:08:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:08:04] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:08:04] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-27 20:08:04] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:08:04] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2024-05-27 20:08:04] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:08:05] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2024-05-27 20:08:05] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:08:05] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-27 20:08:05] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:08:05] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:08:05] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:08:06] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 1 ms to minimize.
[2024-05-27 20:08:06] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:08:06] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:08:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:08:06] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-05-27 20:08:06] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:08:06] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:08:07] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:08:07] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:08:07] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-27 20:08:08] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:08:08] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:08:11] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:08:20] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 (/ 3.0 5.0))
(s7timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:08:34] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 20:08:38] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61272ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61892 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 203 place count 96 transition count 296
Iterating global reduction 1 with 30 rules applied. Total rules applied 233 place count 96 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 94 transition count 295
Graph (trivial) has 19 edges and 94 vertex of which 8 / 94 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 87 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 400 place count 87 transition count 132
Applied a total of 400 rules in 26 ms. Remains 87 /126 variables (removed 39) and now considering 132/529 (removed 397) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 87 cols
[2024-05-27 20:09:02] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:09:02] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 20:09:02] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-27 20:09:02] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 20:09:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 20:09:02] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 20:09:02] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 20:09:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-27 20:09:02] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 20:09:02] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-27 20:09:02] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 245 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[6]
Ending property specific reduction for SafeBus-COL-06-UpperBounds-02 in 138105 ms.
[2024-05-27 20:09:03] [INFO ] Flatten gal took : 107 ms
[2024-05-27 20:09:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-27 20:09:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 529 transitions and 3754 arcs took 20 ms.
Total runtime 358894 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SafeBus-COL-06
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 126
TRANSITIONS: 529
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.021s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]
----------------------------------------------------------------------
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: 1375
MODEL NAME: /home/mcc/execution/414/model
126 places, 529 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SafeBus-COL-06-UpperBounds-02 5 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716840588851
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="SafeBus-COL-06"
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 SafeBus-COL-06, 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 r333-tall-171679078300365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-06.tgz
mv SafeBus-COL-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;