About the Execution of GreatSPN+red for SafeBus-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3412.275 | 185504.00 | 232214.00 | 535.10 | 1 1 1 1 1 10 1 1 1 1 1 1 1 10 9 9 | 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-171679078300373.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-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078300373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 8.0K Apr 12 15:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 15:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 14K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 15:19 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-10-UpperBounds-00
FORMULA_NAME SafeBus-COL-10-UpperBounds-01
FORMULA_NAME SafeBus-COL-10-UpperBounds-02
FORMULA_NAME SafeBus-COL-10-UpperBounds-03
FORMULA_NAME SafeBus-COL-10-UpperBounds-04
FORMULA_NAME SafeBus-COL-10-UpperBounds-05
FORMULA_NAME SafeBus-COL-10-UpperBounds-06
FORMULA_NAME SafeBus-COL-10-UpperBounds-07
FORMULA_NAME SafeBus-COL-10-UpperBounds-08
FORMULA_NAME SafeBus-COL-10-UpperBounds-09
FORMULA_NAME SafeBus-COL-10-UpperBounds-10
FORMULA_NAME SafeBus-COL-10-UpperBounds-11
FORMULA_NAME SafeBus-COL-10-UpperBounds-12
FORMULA_NAME SafeBus-COL-10-UpperBounds-13
FORMULA_NAME SafeBus-COL-10-UpperBounds-14
FORMULA_NAME SafeBus-COL-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716840875123
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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:14:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 20:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:14:36] [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:14:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:14:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 538 ms
[2024-05-27 20:14:36] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2024-05-27 20:14:36] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-27 20:14:36] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 3 ms.
[2024-05-27 20:14:36] [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:14:36] [INFO ] Computed 7 invariants in 11 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 10, 0, 0] Max Struct:[1, 1, 3, 1, 1, 10, 1, 1, 1, 5, 1, 1, 1, 10, 10, 10]
FORMULA SafeBus-COL-10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 20:14:36] [INFO ] Invariant cache hit.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 20:14:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:14:37] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 20:14:37] [INFO ] Added : 12 causal constraints over 5 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 20:14:37] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 12 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:14:37] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:14:37] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 20:14:37] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 20:14:37] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:14:37] [INFO ] Added : 8 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 7 ms.
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 20:14:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:14:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 20:14:38] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 14 ms.
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 20:14:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 20:14:38] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 20:14:38] [INFO ] Added : 8 causal constraints over 2 iterations in 6 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, 1, 3, 10, 1, 1, 5, 1, 10, 10]
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2024-05-27 20:14:38] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 62 ms.
[2024-05-27 20:14:38] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 20 places and 20 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, 1, 3, 10, 1, 1, 5, 1, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 10, 1, 1, 5, 1, 10, 10]
[2024-05-27 20:14:38] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2024-05-27 20:14:38] [INFO ] Computed 45 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 10, 1, 1, 5, 1, 10, 10]
RANDOM walk for 10000 steps (2 resets) in 204 ms. (48 steps per ms)
FORMULA SafeBus-COL-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 9, 7] Max Struct:[3, 5, 10, 10]
[2024-05-27 20:14:38] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:14:38] [INFO ] Invariant cache hit.
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned unsat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 5 ms returned unsat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-27 20:14:38] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-27 20:14:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-27 20:14:39] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-27 20:14:39] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2024-05-27 20:14:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:14:39] [INFO ] [Nat]Added 111 Read/Feed constraints in 474 ms returned sat
[2024-05-27 20:14:39] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 115 ms.
[2024-05-27 20:14:40] [INFO ] Added : 0 causal constraints over 0 iterations in 173 ms. Result :sat
Minimization took 510 ms.
[2024-05-27 20:14:40] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-27 20:14:40] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-27 20:14:40] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-27 20:14:40] [INFO ] [Real]Added 111 Read/Feed constraints in 95 ms returned sat
[2024-05-27 20:14:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-27 20:14:40] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-27 20:14:41] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-27 20:14:41] [INFO ] [Nat]Added 111 Read/Feed constraints in 304 ms returned sat
[2024-05-27 20:14:41] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 97 ms.
[2024-05-27 20:14:41] [INFO ] Added : 0 causal constraints over 0 iterations in 167 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 9, 7] Max Struct:[1, 1, 10, 10]
FORMULA SafeBus-COL-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 7] Max Struct:[10, 10]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 234 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 306/306 places, 1631/1631 transitions.
[2024-05-27 20:14:42] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:14:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 7] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (2 resets) in 5181 ms. (192 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 2504 ms. (798 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 9] Max Struct:[10, 10]
[2024-05-27 20:14:50] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:14:50] [INFO ] Invariant cache hit.
[2024-05-27 20:14:50] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-27 20:14:50] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 11 ms returned sat
[2024-05-27 20:14:50] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-27 20:14:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-27 20:14:50] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-27 20:14:50] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-05-27 20:14:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:14:51] [INFO ] [Nat]Added 111 Read/Feed constraints in 475 ms returned sat
[2024-05-27 20:14:51] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 66 ms.
[2024-05-27 20:14:51] [INFO ] Added : 0 causal constraints over 0 iterations in 124 ms. Result :sat
Minimization took 1019 ms.
[2024-05-27 20:14:52] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-27 20:14:52] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-27 20:14:52] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-27 20:14:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-27 20:14:52] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-27 20:14:52] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2024-05-27 20:14:53] [INFO ] [Nat]Added 111 Read/Feed constraints in 282 ms returned sat
[2024-05-27 20:14:53] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 21 ms to minimize.
[2024-05-27 20:14:53] [INFO ] Deduced a trap composed of 79 places in 251 ms of which 3 ms to minimize.
[2024-05-27 20:14:53] [INFO ] Deduced a trap composed of 90 places in 218 ms of which 3 ms to minimize.
[2024-05-27 20:14:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 813 ms
Current structural bounds on expressions (after SMT) : Max Seen:[9, 9] Max Struct:[10, 9]
FORMULA SafeBus-COL-10-UpperBounds-15 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 165 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 306/306 places, 1631/1631 transitions.
[2024-05-27 20:14:54] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:14:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[10]
RANDOM walk for 1000000 steps (2 resets) in 5051 ms. (197 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1222 ms. (817 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[10]
[2024-05-27 20:15:00] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:15:00] [INFO ] Invariant cache hit.
[2024-05-27 20:15:00] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-27 20:15:00] [INFO ] [Real]Absence check using 21 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-27 20:15:00] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-27 20:15:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:15:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-05-27 20:15:00] [INFO ] [Nat]Absence check using 21 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-27 20:15:01] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-27 20:15:01] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:15:01] [INFO ] [Nat]Added 111 Read/Feed constraints in 482 ms returned sat
[2024-05-27 20:15:01] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 53 ms.
[2024-05-27 20:15:01] [INFO ] Added : 0 causal constraints over 0 iterations in 109 ms. Result :sat
Minimization took 1014 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 172 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 145 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 20:15:03] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:15:03] [INFO ] Invariant cache hit.
[2024-05-27 20:15:03] [INFO ] Implicit Places using invariants in 486 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 495 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 215 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 859 ms. Remains : 296/306 places, 1631/1631 transitions.
[2024-05-27 20:15:03] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 296 cols
[2024-05-27 20:15:03] [INFO ] Computed 35 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[10]
RANDOM walk for 1000000 steps (2 resets) in 4643 ms. (215 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1058 ms. (944 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[10]
[2024-05-27 20:15:09] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:15:09] [INFO ] Invariant cache hit.
[2024-05-27 20:15:09] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 20:15:09] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-27 20:15:09] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-27 20:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:15:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-27 20:15:09] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-27 20:15:10] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-27 20:15:10] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:15:10] [INFO ] [Nat]Added 111 Read/Feed constraints in 558 ms returned sat
[2024-05-27 20:15:10] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 63 ms.
[2024-05-27 20:15:10] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 1216 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 113 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 296/296 places, 1631/1631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1631/1631 transitions.
Applied a total of 0 rules in 108 ms. Remains 296 /296 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2024-05-27 20:15:12] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:15:12] [INFO ] Invariant cache hit.
[2024-05-27 20:15:13] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-27 20:15:13] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:15:13] [INFO ] Invariant cache hit.
[2024-05-27 20:15:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:15:14] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2024-05-27 20:15:15] [INFO ] Redundant transitions in 102 ms returned []
Running 1621 sub problems to find dead transitions.
[2024-05-27 20:15:15] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2024-05-27 20:15:15] [INFO ] Invariant cache hit.
[2024-05-27 20:15:15] [INFO ] State equation strengthened by 111 read => feed constraints.
Problem TDEAD91 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD991 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 10 solved, 1611 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:15:28] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 5 ms to minimize.
[2024-05-27 20:15:29] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:15:29] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-05-27 20:15:29] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-05-27 20:15:29] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2024-05-27 20:15:29] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2024-05-27 20:15:37] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 1 ms to minimize.
[2024-05-27 20:15:37] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:15:37] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2024-05-27 20:15:38] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 2 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 2 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 2 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 1 ms to minimize.
[2024-05-27 20:15:39] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:15:42] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 1 ms to minimize.
[2024-05-27 20:15:42] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 2 ms to minimize.
[2024-05-27 20:15:43] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-05-27 20:15:43] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 1 ms to minimize.
[2024-05-27 20:15:43] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
[2024-05-27 20:15:59] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 2 ms to minimize.
[2024-05-27 20:16:00] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 1 ms to minimize.
[2024-05-27 20:16:00] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 2 ms to minimize.
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 2 ms to minimize.
[2024-05-27 20:16:01] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 57 places in 214 ms of which 2 ms to minimize.
[2024-05-27 20:16:02] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 3 ms to minimize.
[2024-05-27 20:16:05] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 2 ms to minimize.
[2024-05-27 20:16:05] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 2 ms to minimize.
[2024-05-27 20:16:05] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2024-05-27 20:16:05] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 2 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 5 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-27 20:16:06] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 19/74 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 74 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 39/39 constraints]
After SMT, in 64961ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 64994ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 296/296 places, 1531/1631 transitions.
Applied a total of 0 rules in 94 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:16:20] [INFO ] Redundant transitions in 27 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67548 ms. Remains : 296/296 places, 1531/1631 transitions.
[2024-05-27 20:16:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[10]
RANDOM walk for 1000000 steps (2 resets) in 4348 ms. (229 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1069 ms. (934 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[10]
[2024-05-27 20:16:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:25] [INFO ] Invariant cache hit.
[2024-05-27 20:16:25] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 20:16:25] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-27 20:16:25] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-27 20:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:16:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-27 20:16:25] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 10 ms returned sat
[2024-05-27 20:16:26] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-27 20:16:26] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:16:26] [INFO ] [Nat]Added 111 Read/Feed constraints in 317 ms returned sat
[2024-05-27 20:16:26] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 66 ms.
[2024-05-27 20:16:26] [INFO ] Added : 1 causal constraints over 1 iterations in 137 ms. Result :sat
Minimization took 1278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[10]
Support contains 10 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 101 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 296/296 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 90 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-27 20:16:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:28] [INFO ] Invariant cache hit.
[2024-05-27 20:16:28] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-27 20:16:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:28] [INFO ] Invariant cache hit.
[2024-05-27 20:16:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 20:16:30] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
[2024-05-27 20:16:30] [INFO ] Redundant transitions in 19 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-05-27 20:16:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:16:30] [INFO ] Invariant cache hit.
[2024-05-27 20:16:30] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:16:42] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2024-05-27 20:16:43] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:16:50] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 2 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 2 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 2 ms to minimize.
[2024-05-27 20:16:51] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:16:52] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:16:52] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 2 ms to minimize.
[2024-05-27 20:16:53] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 2 ms to minimize.
[2024-05-27 20:16:53] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2024-05-27 20:16:53] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 2 ms to minimize.
[2024-05-27 20:16:56] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 2 ms to minimize.
[2024-05-27 20:16:56] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 4 ms to minimize.
[2024-05-27 20:16:56] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 2 ms to minimize.
[2024-05-27 20:16:56] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 2 ms to minimize.
[2024-05-27 20:16:57] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 2 ms to minimize.
[2024-05-27 20:16:57] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-27 20:16:57] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 2 ms to minimize.
[2024-05-27 20:16:57] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 55 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:17:05] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 2 ms to minimize.
[2024-05-27 20:17:06] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:17:06] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2024-05-27 20:17:14] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 2 ms to minimize.
[2024-05-27 20:17:14] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 2 ms to minimize.
[2024-05-27 20:17:15] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 2 ms to minimize.
[2024-05-27 20:17:16] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 2 ms to minimize.
[2024-05-27 20:17:16] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:17:16] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2024-05-27 20:17:16] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 2 ms to minimize.
[2024-05-27 20:17:19] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-27 20:17:19] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:17:19] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:17:19] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-27 20:17:19] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:17:19] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-27 20:17:20] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-27 20:17:20] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
[2024-05-27 20:17:29] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 2 ms to minimize.
[2024-05-27 20:17:30] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2024-05-27 20:17:31] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
[2024-05-27 20:17:31] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-05-27 20:17:31] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 78 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 43/43 constraints]
After SMT, in 64094ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 64112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66377 ms. Remains : 296/296 places, 1531/1531 transitions.
RANDOM walk for 40000 steps (8 resets) in 1075 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 263596 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 263596 steps, saw 134038 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-27 20:17:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2024-05-27 20:17:37] [INFO ] Invariant cache hit.
[2024-05-27 20:17:37] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:17:38] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/255 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/293 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 641/935 variables, 294/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 110/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/938 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/938 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/938 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/938 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 443 constraints, problems are : Problem set: 0 solved, 2 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 296/296 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 244/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 20:17:38] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 1 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-27 20:17:39] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/255 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 38/293 variables, 21/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/294 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 641/935 variables, 294/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 110/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 935/938 variables, and 449 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 294/296 constraints, ReadFeed: 110/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 2670ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SafeBus-COL-10-UpperBounds-14 9 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 184368 ms.
ITS solved all properties within timeout
BK_STOP 1716841060627
--------------------
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-10"
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-10, 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-171679078300373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 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 ;