MCC'2024- Execution of r289-tajo-171654445900421

About the Execution of GreatSPN+red for PolyORBNT-COL-S10J40

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11613.703	3600000.00	12462577.00	266.10	1 1 10 1 1 1 10 4 1 1 3 4 ? 1 2 41	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.5K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716881688453

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:34:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 07:34:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:34:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 07:34:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:34:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 927 ms
[2024-05-28 07:34:51] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-28 07:34:51] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 07:34:51] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 07:34:51] [INFO ] Computed 13 invariants in 39 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 0, 0, 3, 0, 0, 0, 0, 41] Max Struct:[1, 1, 10, +inf, 1, 1, 10, 10, +inf, +inf, +inf, 10, 4, +inf, 2, 41]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 07:34:51] [INFO ] Invariant cache hit.
[2024-05-28 07:34:51] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-28 07:34:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 07:34:51] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-28 07:34:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:34:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:34:51] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 07:34:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:34:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:34:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
[2024-05-28 07:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-28 07:34:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 2 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-28 07:34:52] [INFO ] Added : 36 causal constraints over 8 iterations in 102 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:34:52] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 15 ms.
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 177 ms
[2024-05-28 07:34:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2024-05-28 07:34:52] [INFO ] Added : 36 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:34:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:34:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:34:52] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:34:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-28 07:34:52] [INFO ] Added : 36 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 117 ms.
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2024-05-28 07:34:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-28 07:34:53] [INFO ] Added : 36 causal constraints over 8 iterations in 127 ms. Result :sat
Minimization took 32 ms.
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 07:34:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 07:34:53] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 15 ms.
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-28 07:34:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:34:53] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-28 07:34:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:34:54] [INFO ] Added : 22 causal constraints over 5 iterations in 535 ms. Result :sat
Minimization took 73 ms.
[2024-05-28 07:34:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:34:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 07:34:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 07:34:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 07:34:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:34:54] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-28 07:34:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:34:54] [INFO ] Added : 22 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 134 ms.
[2024-05-28 07:34:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 07:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-28 07:34:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:34:55] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 07:34:55] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 07:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 07:34:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 07:34:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 07:34:55] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:34:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
[2024-05-28 07:34:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-05-28 07:34:55] [INFO ] Added : 20 causal constraints over 5 iterations in 286 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 10, +inf, +inf, 3, 10, 4, +inf, 2]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:34:56] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 289 ms.
[2024-05-28 07:34:56] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 79 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 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, +inf, 1, 10, +inf, +inf, 10, 4, +inf, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 10, +inf, +inf, 10, 4, +inf, 2]
[2024-05-28 07:34:56] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-28 07:34:56] [INFO ] Computed 112 invariants in 174 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 11, 1, 10, 11, 11, 10, 4, 41, 2]
RANDOM walk for 10000 steps (560 resets) in 534 ms. (18 steps per ms)
BEST_FIRST walk for 100010 steps (1046 resets) in 738 ms. (135 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 11, 1, 10, 11, 11, 10, 4, 41, 2]
[2024-05-28 07:34:57] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 07:34:57] [INFO ] Invariant cache hit.
[2024-05-28 07:34:58] [INFO ] [Real]Absence check using 105 positive place invariants in 28 ms returned sat
[2024-05-28 07:34:58] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 47 ms returned sat
[2024-05-28 07:34:59] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2024-05-28 07:34:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:34:59] [INFO ] [Nat]Absence check using 105 positive place invariants in 38 ms returned sat
[2024-05-28 07:34:59] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 07:35:01] [INFO ] [Nat]Absence check using state equation in 1749 ms returned unknown
[2024-05-28 07:35:01] [INFO ] [Real]Absence check using 105 positive place invariants in 79 ms returned sat
[2024-05-28 07:35:01] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 60 ms returned unsat
[2024-05-28 07:35:01] [INFO ] [Real]Absence check using 105 positive place invariants in 31 ms returned sat
[2024-05-28 07:35:01] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 07:35:02] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2024-05-28 07:35:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:35:02] [INFO ] [Nat]Absence check using 105 positive place invariants in 37 ms returned sat
[2024-05-28 07:35:02] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-28 07:35:03] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2024-05-28 07:35:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:35:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 446 ms returned sat
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 371 places in 712 ms of which 7 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Deduced a trap composed of 398 places in 861 ms of which 5 ms to minimize.
[2024-05-28 07:35:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1909 ms
[2024-05-28 07:35:06] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 447 ms.
[2024-05-28 07:35:08] [INFO ] Deduced a trap composed of 19 places in 860 ms of which 5 ms to minimize.
[2024-05-28 07:35:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 07:35:08] [INFO ] [Real]Absence check using 105 positive place invariants in 37 ms returned sat
[2024-05-28 07:35:08] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 07:35:09] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2024-05-28 07:35:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:35:09] [INFO ] [Nat]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-05-28 07:35:09] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 07:35:11] [INFO ] [Nat]Absence check using state equation in 1515 ms returned sat
[2024-05-28 07:35:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:35:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 536 ms returned sat
[2024-05-28 07:35:12] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 241 ms.
[2024-05-28 07:35:14] [INFO ] Deduced a trap composed of 19 places in 710 ms of which 2 ms to minimize.
[2024-05-28 07:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1003 ms
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-28 07:35:14] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2024-05-28 07:35:14] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 07:35:15] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2024-05-28 07:35:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:35:15] [INFO ] [Nat]Absence check using 105 positive place invariants in 28 ms returned sat
[2024-05-28 07:35:15] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 07:35:16] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2024-05-28 07:35:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 457 ms returned sat
[2024-05-28 07:35:16] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 196 ms.
[2024-05-28 07:35:18] [INFO ] Deduced a trap composed of 19 places in 899 ms of which 7 ms to minimize.
[2024-05-28 07:35:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1349 ms
[2024-05-28 07:35:18] [INFO ] Added : 23 causal constraints over 5 iterations in 2225 ms. Result :sat
Minimization took 923 ms.
[2024-05-28 07:35:19] [INFO ] [Real]Absence check using 105 positive place invariants in 29 ms returned sat
[2024-05-28 07:35:19] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 15 ms returned unsat
[2024-05-28 07:35:20] [INFO ] [Real]Absence check using 105 positive place invariants in 62 ms returned sat
[2024-05-28 07:35:20] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 47 ms returned sat
[2024-05-28 07:35:20] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2024-05-28 07:35:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:35:21] [INFO ] [Nat]Absence check using 105 positive place invariants in 50 ms returned sat
[2024-05-28 07:35:21] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 44 ms returned sat
[2024-05-28 07:35:21] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2024-05-28 07:35:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:35:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 651 ms returned sat
[2024-05-28 07:35:22] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 226 ms.
[2024-05-28 07:35:23] [INFO ] Added : 6 causal constraints over 2 iterations in 659 ms. Result :sat
Minimization took 1079 ms.
[2024-05-28 07:35:24] [INFO ] [Real]Absence check using 105 positive place invariants in 43 ms returned sat
[2024-05-28 07:35:24] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 07:35:25] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2024-05-28 07:35:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:35:25] [INFO ] [Nat]Absence check using 105 positive place invariants in 43 ms returned sat
[2024-05-28 07:35:25] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 42 ms returned sat
[2024-05-28 07:35:26] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2024-05-28 07:35:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 220 ms returned sat
[2024-05-28 07:35:27] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 205 ms.
[2024-05-28 07:35:28] [INFO ] Added : 10 causal constraints over 2 iterations in 1353 ms. Result :sat
Minimization took 956 ms.
[2024-05-28 07:35:29] [INFO ] [Real]Absence check using 105 positive place invariants in 47 ms returned sat
[2024-05-28 07:35:29] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 47 ms returned sat
[2024-05-28 07:35:30] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-05-28 07:35:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:35:30] [INFO ] [Nat]Absence check using 105 positive place invariants in 50 ms returned sat
[2024-05-28 07:35:30] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 07:35:31] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2024-05-28 07:35:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 413 ms returned sat
[2024-05-28 07:35:32] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 248 ms.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 19 places in 529 ms of which 2 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 956 ms
[2024-05-28 07:35:34] [INFO ] Added : 22 causal constraints over 5 iterations in 2261 ms. Result :sat
Minimization took 947 ms.
[2024-05-28 07:35:35] [INFO ] [Real]Absence check using 105 positive place invariants in 35 ms returned sat
[2024-05-28 07:35:35] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-28 07:35:36] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2024-05-28 07:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:35:36] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2024-05-28 07:35:36] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 07:35:38] [INFO ] [Nat]Absence check using state equation in 1638 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 10, 11, 1, 10, 4, 41, 2]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 11, 10, 4, 41, 2]
Support contains 497 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 844 transition count 2228
Reduce places removed 2 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 43 rules applied. Total rules applied 55 place count 842 transition count 2187
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 96 place count 801 transition count 2187
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 96 place count 801 transition count 2182
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 106 place count 796 transition count 2182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 795 transition count 2181
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 795 transition count 2180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 794 transition count 2180
Applied a total of 110 rules in 867 ms. Remains 794 /854 variables (removed 60) and now considering 2180/2230 (removed 50) transitions.
Running 2169 sub problems to find dead transitions.
[2024-05-28 07:35:39] [INFO ] Flow matrix only has 2171 transitions (discarded 9 similar events)
// Phase 1: matrix 2171 rows 794 cols
[2024-05-28 07:35:39] [INFO ] Computed 102 invariants in 183 ms
[2024-05-28 07:35:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 4.0)
(s261 4.0)
(s262 4.0)
(s263 4.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 4.0)
(s269 4.0)
(s270 9.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 1.0)
(s721 0.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s746 1.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(timeout
s753 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 2169 unsolved
SMT process timed out in 43540ms, After SMT, problems are : Problem set: 0 solved, 2169 unsolved
Search for dead transitions found 0 dead transitions in 43651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44585 ms. Remains : 794/854 places, 2180/2230 transitions.
[2024-05-28 07:36:22] [INFO ] Flow matrix only has 2171 transitions (discarded 9 similar events)
[2024-05-28 07:36:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 11, 10, 4, 41, 2]
RANDOM walk for 1000000 steps (70586 resets) in 22370 ms. (44 steps per ms)
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (41312 resets) in 17069 ms. (292 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 4, 3, 1] Max Struct:[10, 11, 10, 4, 41]
[2024-05-28 07:37:02] [INFO ] Flow matrix only has 2171 transitions (discarded 9 similar events)
[2024-05-28 07:37:02] [INFO ] Invariant cache hit.
[2024-05-28 07:37:02] [INFO ] [Real]Absence check using 96 positive place invariants in 33 ms returned sat
[2024-05-28 07:37:02] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 23 ms returned sat
[2024-05-28 07:37:03] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-05-28 07:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:37:03] [INFO ] [Nat]Absence check using 96 positive place invariants in 36 ms returned sat
[2024-05-28 07:37:03] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 25 ms returned sat
[2024-05-28 07:37:04] [INFO ] [Nat]Absence check using state equation in 917 ms returned unsat
[2024-05-28 07:37:04] [INFO ] [Real]Absence check using 96 positive place invariants in 64 ms returned sat
[2024-05-28 07:37:04] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 7 ms returned unsat
[2024-05-28 07:37:05] [INFO ] [Real]Absence check using 96 positive place invariants in 32 ms returned sat
[2024-05-28 07:37:05] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 14 ms returned unsat
[2024-05-28 07:37:05] [INFO ] [Real]Absence check using 96 positive place invariants in 31 ms returned sat
[2024-05-28 07:37:05] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 34 ms returned sat
[2024-05-28 07:37:05] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-28 07:37:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:37:06] [INFO ] [Nat]Absence check using 96 positive place invariants in 29 ms returned sat
[2024-05-28 07:37:06] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2024-05-28 07:37:06] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2024-05-28 07:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:37:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 371 ms returned sat
[2024-05-28 07:37:07] [INFO ] Computed and/alt/rep : 1539/4935/1539 causal constraints (skipped 621 transitions) in 232 ms.
[2024-05-28 07:37:07] [INFO ] Added : 6 causal constraints over 2 iterations in 554 ms. Result :sat
Minimization took 2366 ms.
[2024-05-28 07:37:10] [INFO ] [Real]Absence check using 96 positive place invariants in 25 ms returned sat
[2024-05-28 07:37:10] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 4, 3, 1] Max Struct:[4, 1, 4, 4, 1]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 794/794 places, 2180/2180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 794 transition count 2179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 793 transition count 2179
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 2 place count 793 transition count 2138
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 84 place count 752 transition count 2138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 750 transition count 2136
Applied a total of 88 rules in 107 ms. Remains 750 /794 variables (removed 44) and now considering 2136/2180 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 750/794 places, 2136/2180 transitions.
[2024-05-28 07:37:10] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
// Phase 1: matrix 2127 rows 750 cols
[2024-05-28 07:37:10] [INFO ] Computed 102 invariants in 87 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72387 resets) in 15346 ms. (65 steps per ms)
BEST_FIRST walk for 1000001 steps (8483 resets) in 2524 ms. (396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 07:37:28] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:37:28] [INFO ] Invariant cache hit.
[2024-05-28 07:37:28] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-05-28 07:37:28] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 07:37:29] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2024-05-28 07:37:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:37:29] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-28 07:37:29] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 07:37:29] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-05-28 07:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:37:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 225 ms returned sat
[2024-05-28 07:37:30] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 621 transitions) in 199 ms.
[2024-05-28 07:37:31] [INFO ] Added : 9 causal constraints over 3 iterations in 859 ms. Result :sat
Minimization took 4438 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 105 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 76 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-28 07:37:35] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:37:35] [INFO ] Invariant cache hit.
[2024-05-28 07:37:37] [INFO ] Implicit Places using invariants in 1251 ms returned []
[2024-05-28 07:37:37] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:37:37] [INFO ] Invariant cache hit.
[2024-05-28 07:37:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:37:44] [INFO ] Implicit Places using invariants and state equation in 6928 ms returned []
Implicit Place search using SMT with State Equation took 8189 ms to find 0 implicit places.
[2024-05-28 07:37:44] [INFO ] Redundant transitions in 114 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-28 07:37:44] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:37:44] [INFO ] Invariant cache hit.
[2024-05-28 07:37:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
SMT process timed out in 52723ms, After SMT, problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 52761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61165 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 40000 steps (2918 resets) in 2228 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (382 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (304 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 223611 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 223611 steps, saw 37170 distinct states, run finished after 3010 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-28 07:38:41] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:38:41] [INFO ] Invariant cache hit.
[2024-05-28 07:38:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1737 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2136 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3935ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 55 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Running 2125 sub problems to find dead transitions.
[2024-05-28 07:38:45] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:38:45] [INFO ] Invariant cache hit.
[2024-05-28 07:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
SMT process timed out in 44012ms, After SMT, problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 44046ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44115 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 40000 steps (2939 resets) in 1624 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (336 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (313 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 206722 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 206722 steps, saw 34594 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-28 07:39:32] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:39:32] [INFO ] Invariant cache hit.
[2024-05-28 07:39:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2730ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 69 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 55 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-28 07:39:35] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:39:35] [INFO ] Invariant cache hit.
[2024-05-28 07:39:37] [INFO ] Implicit Places using invariants in 1366 ms returned []
[2024-05-28 07:39:37] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:39:37] [INFO ] Invariant cache hit.
[2024-05-28 07:39:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:39:44] [INFO ] Implicit Places using invariants and state equation in 7623 ms returned []
Implicit Place search using SMT with State Equation took 9013 ms to find 0 implicit places.
[2024-05-28 07:39:45] [INFO ] Redundant transitions in 134 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-28 07:39:45] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:39:45] [INFO ] Invariant cache hit.
[2024-05-28 07:39:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 0/0 constraints]
After SMT, in 80858ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 80886ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90112 ms. Remains : 750/750 places, 2136/2136 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 07:41:05] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:41:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (723 resets) in 256 ms. (38 steps per ms)
BEST_FIRST walk for 10001 steps (77 resets) in 36 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 07:41:06] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:41:06] [INFO ] Invariant cache hit.
[2024-05-28 07:41:06] [INFO ] [Real]Absence check using 95 positive place invariants in 29 ms returned sat
[2024-05-28 07:41:06] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-28 07:41:07] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2024-05-28 07:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:41:07] [INFO ] [Nat]Absence check using 95 positive place invariants in 29 ms returned sat
[2024-05-28 07:41:07] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 07:41:08] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2024-05-28 07:41:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:41:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 317 ms returned sat
[2024-05-28 07:41:08] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 621 transitions) in 226 ms.
[2024-05-28 07:41:09] [INFO ] Added : 9 causal constraints over 3 iterations in 982 ms. Result :sat
Minimization took 726 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 88 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Running 2125 sub problems to find dead transitions.
[2024-05-28 07:41:10] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:41:10] [INFO ] Invariant cache hit.
[2024-05-28 07:41:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
SMT process timed out in 44386ms, After SMT, problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 44440ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44535 ms. Remains : 750/750 places, 2136/2136 transitions.
[2024-05-28 07:41:55] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:41:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (72803 resets) in 15632 ms. (63 steps per ms)
BEST_FIRST walk for 1000001 steps (8336 resets) in 2666 ms. (374 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 07:42:13] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:42:13] [INFO ] Invariant cache hit.
[2024-05-28 07:42:13] [INFO ] [Real]Absence check using 95 positive place invariants in 40 ms returned sat
[2024-05-28 07:42:13] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 07:42:14] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2024-05-28 07:42:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:42:14] [INFO ] [Nat]Absence check using 95 positive place invariants in 26 ms returned sat
[2024-05-28 07:42:14] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-28 07:42:15] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2024-05-28 07:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:42:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 207 ms returned sat
[2024-05-28 07:42:16] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 621 transitions) in 249 ms.
[2024-05-28 07:42:16] [INFO ] Added : 9 causal constraints over 3 iterations in 962 ms. Result :sat
Minimization took 4594 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 61 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 83 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-28 07:42:21] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:42:21] [INFO ] Invariant cache hit.
[2024-05-28 07:42:22] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-05-28 07:42:22] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:42:22] [INFO ] Invariant cache hit.
[2024-05-28 07:42:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:42:28] [INFO ] Implicit Places using invariants and state equation in 6364 ms returned []
Implicit Place search using SMT with State Equation took 7313 ms to find 0 implicit places.
[2024-05-28 07:42:29] [INFO ] Redundant transitions in 80 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-28 07:42:29] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:42:29] [INFO ] Invariant cache hit.
[2024-05-28 07:42:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 0/0 constraints]
After SMT, in 82194ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 82242ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89738 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 40000 steps (2876 resets) in 1387 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (380 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (344 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 194724 steps, run timeout after 3008 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 194724 steps, saw 32707 distinct states, run finished after 3008 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-28 07:43:54] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:43:54] [INFO ] Invariant cache hit.
[2024-05-28 07:43:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2785ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 46 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Running 2125 sub problems to find dead transitions.
[2024-05-28 07:43:57] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:43:57] [INFO ] Invariant cache hit.
[2024-05-28 07:43:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 4.0)
(s259 4.0)
(s260 4.0)
(s261 4.0)
(s262 4.0)
(s263 4.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 9.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
SMT process timed out in 42315ms, After SMT, problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 42345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42399 ms. Remains : 750/750 places, 2136/2136 transitions.
RANDOM walk for 40000 steps (2904 resets) in 853 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (336 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (322 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 253739 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 253739 steps, saw 41808 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-28 07:44:43] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:44:43] [INFO ] Invariant cache hit.
[2024-05-28 07:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/146 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 593/739 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/740 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/748 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2877 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2877 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2592ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 81 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 63 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-28 07:44:46] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:44:46] [INFO ] Invariant cache hit.
[2024-05-28 07:44:47] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-28 07:44:47] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:44:47] [INFO ] Invariant cache hit.
[2024-05-28 07:44:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:44:54] [INFO ] Implicit Places using invariants and state equation in 7506 ms returned []
Implicit Place search using SMT with State Equation took 8239 ms to find 0 implicit places.
[2024-05-28 07:44:54] [INFO ] Redundant transitions in 31 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-28 07:44:54] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 07:44:54] [INFO ] Invariant cache hit.
[2024-05-28 07:44:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 (/ 2.0 3.0))
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 (/ 2.0 3.0))
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 (/ 1.0 3.0))
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 (/ 1.0 3.0))
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 4.0)
(s259 4.0)
(s260 4.0)
(s261 4.0)
(s262 4.0)
(s263 4.0)
(s264 4.0)
(s265 4.0)
(s266 4.0)
(s267 4.0)
(s268 9.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 86/95 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 0/0 constraints]
After SMT, in 85085ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 85116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93473 ms. Remains : 750/750 places, 2136/2136 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-12 in 313852 ms.
[2024-05-28 07:46:20] [INFO ] Flatten gal took : 323 ms
[2024-05-28 07:46:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-28 07:46:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 2136 transitions and 14184 arcs took 20 ms.
Total runtime 689969 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S10J40

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 750
TRANSITIONS: 2136
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.090s, Sys 0.015s]

SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.003s]

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

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

Process ID: 947
MODEL NAME: /home/mcc/execution/419/model
750 places, 2136 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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