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.r516-tajo-171654446600229.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 ltsminxred
Input is PolyORBLF-PT-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717252381605

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:33:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 14:33:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:33:03] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-06-01 14:33:03] [INFO ] Transformed 614 places.
[2024-06-01 14:33:03] [INFO ] Transformed 1242 transitions.
[2024-06-01 14:33:03] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 14:33:03] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-06-01 14:33:03] [INFO ] Computed 50 invariants in 90 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[8, 8, 3, 1, 24, +inf, 6, +inf, +inf, +inf, 8, 4, 202, +inf, +inf, 1]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 102 ms. (97 steps per ms)
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140005 steps (30 resets) in 534 ms. (261 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 0, 10, 2, 1] Max Struct:[8, 8, 3, 24, +inf, 6, +inf, +inf, +inf, 8, 4, 202, +inf, +inf]
[2024-06-01 14:33:04] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:33:04] [INFO ] Invariant cache hit.
[2024-06-01 14:33:04] [INFO ] [Real]Absence check using 16 positive place invariants in 33 ms returned unsat
[2024-06-01 14:33:04] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned unsat
[2024-06-01 14:33:05] [INFO ] [Real]Absence check using 16 positive place invariants in 35 ms returned sat
[2024-06-01 14:33:05] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 35 ms returned sat
[2024-06-01 14:33:06] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2024-06-01 14:33:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:33:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 14:33:06] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 40 ms returned sat
[2024-06-01 14:33:08] [INFO ] [Nat]Absence check using state equation in 2003 ms returned sat
[2024-06-01 14:33:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:33:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:33:09] [INFO ] [Nat]Added 96 Read/Feed constraints in 1017 ms returned unknown
[2024-06-01 14:33:09] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 14:33:09] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 18 ms returned sat
[2024-06-01 14:33:10] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2024-06-01 14:33:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:33:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:33:10] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 22 ms returned sat
[2024-06-01 14:33:12] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2024-06-01 14:33:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:33:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 1016 ms returned unknown
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 8 ms returned unsat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 22 ms returned unsat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-06-01 14:33:14] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 21 ms returned sat
[2024-06-01 14:33:15] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2024-06-01 14:33:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:33:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:33:16] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-06-01 14:33:17] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2024-06-01 14:33:17] [INFO ] [Nat]Added 96 Read/Feed constraints in 333 ms returned sat
[2024-06-01 14:33:18] [INFO ] Deduced a trap composed of 19 places in 624 ms of which 52 ms to minimize.
[2024-06-01 14:33:18] [INFO ] Deduced a trap composed of 66 places in 554 ms of which 7 ms to minimize.
[2024-06-01 14:33:19] [INFO ] Deduced a trap composed of 65 places in 560 ms of which 10 ms to minimize.
[2024-06-01 14:33:20] [INFO ] Deduced a trap composed of 65 places in 641 ms of which 33 ms to minimize.
[2024-06-01 14:33:21] [INFO ] Deduced a trap composed of 330 places in 566 ms of which 5 ms to minimize.
[2024-06-01 14:33:21] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3548 ms
[2024-06-01 14:33:21] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:33:21] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 22 ms returned unsat
[2024-06-01 14:33:21] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:33:21] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 23 ms returned sat
[2024-06-01 14:33:22] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2024-06-01 14:33:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:33:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 14:33:22] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 21 ms returned sat
[2024-06-01 14:33:23] [INFO ] [Nat]Absence check using state equation in 1350 ms returned sat
[2024-06-01 14:33:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:33:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 1029 ms returned unknown
[2024-06-01 14:33:25] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2024-06-01 14:33:25] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 0, 10, 2, 1] Max Struct:[1, 1, 3, 24, 1, 2, 1, 1, 1, 1, 4, 10, +inf, 1]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1044
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 542 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 541 transition count 1043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 144 place count 541 transition count 979
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 272 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 400 place count 413 transition count 915
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 416 place count 413 transition count 899
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 432 place count 397 transition count 899
Applied a total of 432 rules in 308 ms. Remains 397 /614 variables (removed 217) and now considering 899/1114 (removed 215) transitions.
Running 897 sub problems to find dead transitions.
[2024-06-01 14:33:25] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
// Phase 1: matrix 883 rows 397 cols
[2024-06-01 14:33:25] [INFO ] Computed 48 invariants in 38 ms
[2024-06-01 14:33:25] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 54 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 65 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 134 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:33:36] [INFO ] Deduced a trap composed of 153 places in 228 ms of which 4 ms to minimize.
[2024-06-01 14:33:37] [INFO ] Deduced a trap composed of 240 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:33:39] [INFO ] Deduced a trap composed of 219 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:33:39] [INFO ] Deduced a trap composed of 206 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 133 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 125 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:33:41] [INFO ] Deduced a trap composed of 169 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:33:42] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-06-01 14:33:43] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/1280 variables, and 67 constraints, problems are : Problem set: 0 solved, 897 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/397 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 897/897 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 897 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-06-01 14:33:58] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:33:59] [INFO ] Deduced a trap composed of 165 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:34:00] [INFO ] Deduced a trap composed of 168 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:34:00] [INFO ] Deduced a trap composed of 249 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:34:01] [INFO ] Deduced a trap composed of 254 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:34:01] [INFO ] Deduced a trap composed of 232 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:34:01] [INFO ] Deduced a trap composed of 236 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:34:01] [INFO ] Deduced a trap composed of 205 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:34:02] [INFO ] Deduced a trap composed of 233 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:34:02] [INFO ] Deduced a trap composed of 242 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:34:02] [INFO ] Deduced a trap composed of 245 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:34:02] [INFO ] Deduced a trap composed of 241 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:34:02] [INFO ] Deduced a trap composed of 227 places in 184 ms of which 2 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 155 places in 204 ms of which 4 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 897 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/1280 variables, and 82 constraints, problems are : Problem set: 0 solved, 897 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/397 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/897 constraints, Known Traps: 36/36 constraints]
After SMT, in 42305ms problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 42341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42685 ms. Remains : 397/614 places, 899/1114 transitions.
[2024-06-01 14:34:07] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 14:46:26] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-06-01 14:46:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
RANDOM walk for 1000000 steps (441 resets) in 4650 ms. (215 steps per ms)
BEST_FIRST walk for 4000001 steps (701 resets) in 8527 ms. (469 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
[2024-06-01 14:46:40] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-06-01 14:46:40] [INFO ] Invariant cache hit.
[2024-06-01 14:46:40] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:46:40] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 18 ms returned sat
[2024-06-01 14:46:40] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2024-06-01 14:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:46:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 14:46:40] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 16 ms returned sat
[2024-06-01 14:46:41] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2024-06-01 14:46:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:46:42] [INFO ] [Nat]Added 96 Read/Feed constraints in 1154 ms returned sat
[2024-06-01 14:46:42] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 106 ms.
[2024-06-01 14:46:43] [INFO ] Added : 20 causal constraints over 4 iterations in 671 ms. Result :sat
Minimization took 4314 ms.
[2024-06-01 14:46:47] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 14:46:47] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 15 ms returned sat
[2024-06-01 14:46:47] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-06-01 14:46:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:46:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-06-01 14:46:48] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 29 ms returned sat
[2024-06-01 14:46:55] [INFO ] [Nat]Absence check using state equation in 7455 ms returned sat
[2024-06-01 14:46:55] [INFO ] [Nat]Added 96 Read/Feed constraints in 173 ms returned sat
[2024-06-01 14:46:55] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:46:55] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:46:55] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:46:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2024-06-01 14:46:56] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 99 ms.
[2024-06-01 14:46:59] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-06-01 14:46:59] [INFO ] Added : 195 causal constraints over 41 iterations in 3941 ms. Result :sat
Minimization took 3834 ms.
[2024-06-01 14:47:03] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:04] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 18 ms returned sat
[2024-06-01 14:47:04] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2024-06-01 14:47:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:05] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 18 ms returned sat
[2024-06-01 14:47:16] [INFO ] [Nat]Absence check using state equation in 10941 ms returned unknown
[2024-06-01 14:47:16] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:16] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 19 ms returned sat
[2024-06-01 14:47:16] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2024-06-01 14:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:17] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 17 ms returned sat
[2024-06-01 14:47:18] [INFO ] [Nat]Absence check using state equation in 1817 ms returned sat
[2024-06-01 14:47:19] [INFO ] [Nat]Added 96 Read/Feed constraints in 290 ms returned sat
[2024-06-01 14:47:19] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 77 ms.
[2024-06-01 14:47:20] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:47:20] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:47:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 469 ms
[2024-06-01 14:47:21] [INFO ] Added : 87 causal constraints over 18 iterations in 2048 ms. Result :sat
Minimization took 4262 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 899/899 transitions.
Applied a total of 0 rules in 26 ms. Remains 397 /397 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 397/397 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 899/899 transitions.
Applied a total of 0 rules in 23 ms. Remains 397 /397 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-06-01 14:47:27] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-06-01 14:47:27] [INFO ] Invariant cache hit.
[2024-06-01 14:47:27] [INFO ] Implicit Places using invariants in 579 ms returned [71, 117, 189, 197, 269, 312, 335, 342]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 583 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 389/397 places, 899/899 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 383 transition count 893
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 383 transition count 893
Applied a total of 12 rules in 32 ms. Remains 383 /389 variables (removed 6) and now considering 893/899 (removed 6) transitions.
[2024-06-01 14:47:27] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
// Phase 1: matrix 877 rows 383 cols
[2024-06-01 14:47:27] [INFO ] Computed 40 invariants in 9 ms
[2024-06-01 14:47:28] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-06-01 14:47:28] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-06-01 14:47:28] [INFO ] Invariant cache hit.
[2024-06-01 14:47:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:47:32] [INFO ] Implicit Places using invariants and state equation in 3624 ms returned []
Implicit Place search using SMT with State Equation took 4126 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 383/397 places, 893/899 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4764 ms. Remains : 383/397 places, 893/899 transitions.
[2024-06-01 14:47:32] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 14:47:43] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-06-01 14:47:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
RANDOM walk for 1000000 steps (448 resets) in 4450 ms. (224 steps per ms)
BEST_FIRST walk for 4000001 steps (721 resets) in 7712 ms. (518 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
[2024-06-01 14:47:55] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-06-01 14:47:55] [INFO ] Invariant cache hit.
[2024-06-01 14:47:55] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 14:47:55] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 21 ms returned sat
[2024-06-01 14:47:56] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-06-01 14:47:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 14:47:56] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 27 ms returned sat
[2024-06-01 14:48:05] [INFO ] [Nat]Absence check using state equation in 9268 ms returned unknown
[2024-06-01 14:48:05] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-06-01 14:48:05] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2024-06-01 14:48:05] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2024-06-01 14:48:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:48:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 14:48:06] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 23 ms returned sat
[2024-06-01 14:48:08] [INFO ] [Nat]Absence check using state equation in 2152 ms returned sat
[2024-06-01 14:48:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:08] [INFO ] [Nat]Added 96 Read/Feed constraints in 430 ms returned sat
[2024-06-01 14:48:08] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 2 ms to minimize.
[2024-06-01 14:48:09] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 2 ms to minimize.
[2024-06-01 14:48:09] [INFO ] Deduced a trap composed of 184 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:48:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 872 ms
[2024-06-01 14:48:09] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 41 ms.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 140 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:48:10] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:48:11] [INFO ] Deduced a trap composed of 133 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:48:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1355 ms
[2024-06-01 14:48:11] [INFO ] Added : 58 causal constraints over 12 iterations in 2153 ms. Result :sat
Minimization took 3440 ms.
[2024-06-01 14:48:15] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:48:15] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 21 ms returned sat
[2024-06-01 14:48:15] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2024-06-01 14:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:48:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-06-01 14:48:16] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 13 ms returned sat
[2024-06-01 14:48:16] [INFO ] [Nat]Absence check using state equation in 829 ms returned sat
[2024-06-01 14:48:17] [INFO ] [Nat]Added 96 Read/Feed constraints in 255 ms returned sat
[2024-06-01 14:48:17] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 70 ms.
[2024-06-01 14:48:19] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:48:19] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:48:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2024-06-01 14:48:19] [INFO ] Added : 72 causal constraints over 15 iterations in 2161 ms. Result :sat
Minimization took 3850 ms.
[2024-06-01 14:48:23] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 14:48:23] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 30 ms returned sat
[2024-06-01 14:48:23] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-06-01 14:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:48:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-06-01 14:48:23] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 16 ms returned sat
[2024-06-01 14:48:25] [INFO ] [Nat]Absence check using state equation in 1666 ms returned sat
[2024-06-01 14:48:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 456 ms returned sat
[2024-06-01 14:48:26] [INFO ] Deduced a trap composed of 155 places in 211 ms of which 7 ms to minimize.
[2024-06-01 14:48:26] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:48:26] [INFO ] Deduced a trap composed of 169 places in 224 ms of which 2 ms to minimize.
[2024-06-01 14:48:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 931 ms
[2024-06-01 14:48:27] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 68 ms.
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 2 ms to minimize.
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:48:28] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:48:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 672 ms
[2024-06-01 14:48:28] [INFO ] Added : 87 causal constraints over 19 iterations in 1962 ms. Result :sat
Minimization took 3426 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 19 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 20 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-06-01 14:48:34] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-06-01 14:48:34] [INFO ] Invariant cache hit.
[2024-06-01 14:48:34] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-06-01 14:48:34] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-06-01 14:48:34] [INFO ] Invariant cache hit.
[2024-06-01 14:48:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:48:38] [INFO ] Implicit Places using invariants and state equation in 3743 ms returned []
Implicit Place search using SMT with State Equation took 4349 ms to find 0 implicit places.
[2024-06-01 14:48:38] [INFO ] Redundant transitions in 70 ms returned []
Running 891 sub problems to find dead transitions.
[2024-06-01 14:48:38] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-06-01 14:48:38] [INFO ] Invariant cache hit.
[2024-06-01 14:48:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:48:44] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:48:45] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:48:45] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 2 ms to minimize.
[2024-06-01 14:48:45] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:48:46] [INFO ] Deduced a trap composed of 134 places in 255 ms of which 2 ms to minimize.
[2024-06-01 14:48:46] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:48:50] [INFO ] Deduced a trap composed of 145 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:48:50] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:48:50] [INFO ] Deduced a trap composed of 139 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 123 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:48:51] [INFO ] Deduced a trap composed of 180 places in 211 ms of which 3 ms to minimize.
[2024-06-01 14:48:52] [INFO ] Deduced a trap composed of 174 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-06-01 14:48:52] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:48:57] [INFO ] Deduced a trap composed of 181 places in 228 ms of which 2 ms to minimize.
[2024-06-01 14:48:57] [INFO ] Deduced a trap composed of 181 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:48:58] [INFO ] Deduced a trap composed of 199 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD892 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/383 variables, 3/64 constraints. Problems are: Problem set: 88 solved, 803 unsolved
[2024-06-01 14:49:09] [INFO ] Deduced a trap composed of 192 places in 279 ms of which 3 ms to minimize.
[2024-06-01 14:49:10] [INFO ] Deduced a trap composed of 130 places in 253 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/1260 variables, and 66 constraints, problems are : Problem set: 88 solved, 803 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 88 solved, 803 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 88 solved, 803 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 88 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 88 solved, 803 unsolved
[2024-06-01 14:49:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:49:15] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:49:15] [INFO ] Deduced a trap composed of 182 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:49:25] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/65 constraints. Problems are: Problem set: 88 solved, 803 unsolved
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 187 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 180 places in 207 ms of which 2 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 219 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:49:35] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 69 constraints, problems are : Problem set: 88 solved, 803 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 32/34 constraints]
After SMT, in 61651ms problems are : Problem set: 88 solved, 803 unsolved
Search for dead transitions found 88 dead transitions in 61665ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/383 places, 805/893 transitions.
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 382 transition count 789
Reduce places removed 7 places and 16 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 8 place count 375 transition count 773
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 8 rules in 40 ms. Remains 375 /383 variables (removed 8) and now considering 773/805 (removed 32) transitions.
[2024-06-01 14:49:40] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
// Phase 1: matrix 757 rows 375 cols
[2024-06-01 14:49:40] [INFO ] Computed 50 invariants in 20 ms
[2024-06-01 14:49:40] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 14:49:40] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
[2024-06-01 14:49:40] [INFO ] Invariant cache hit.
[2024-06-01 14:49:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:49:45] [INFO ] Implicit Places using invariants and state equation in 5008 ms returned []
Implicit Place search using SMT with State Equation took 5373 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 375/383 places, 773/893 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71532 ms. Remains : 375/383 places, 773/893 transitions.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:49:45] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 14:49:53] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
// Phase 1: matrix 757 rows 365 cols
[2024-06-01 14:49:53] [INFO ] Computed 40 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
RANDOM walk for 1000000 steps (454 resets) in 3324 ms. (300 steps per ms)
BEST_FIRST walk for 1000001 steps (193 resets) in 1446 ms. (691 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
[2024-06-01 14:49:57] [INFO ] Flow matrix only has 757 transitions (discarded 16 similar events)
[2024-06-01 14:49:57] [INFO ] Invariant cache hit.
[2024-06-01 14:49:58] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-06-01 14:49:58] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 0, 2] Max Struct:[2, 24, 4, +inf]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2] Max Struct:[24, 4, +inf]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 2] Max Struct:[24, 4, +inf]
All properties solved without resorting to model-checking.
Total runtime 1015001 ms.
ITS solved all properties within timeout

BK_STOP 1717253398136

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T08, 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 r516-tajo-171654446600229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 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 ;