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-171654445400221.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 PolyORBLF-PT-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K 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 862K 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-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716859171402

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:19:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 01:19:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:19:33] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2024-05-28 01:19:33] [INFO ] Transformed 476 places.
[2024-05-28 01:19:33] [INFO ] Transformed 920 transitions.
[2024-05-28 01:19:33] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 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:[5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 01:19:33] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-28 01:19:33] [INFO ] Computed 46 invariants in 71 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1] Max Struct:[36, 510, 6, 249, 510, 1, +inf, 49, +inf, 1, 1, 1, +inf, +inf, 6, +inf]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (4 resets) in 151 ms. (65 steps per ms)
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120006 steps (28 resets) in 771 ms. (155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1] Max Struct:[36, 510, 6, 249, 510, +inf, 49, +inf, +inf, +inf, 6, +inf]
[2024-05-28 01:19:34] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2024-05-28 01:19:34] [INFO ] Invariant cache hit.
[2024-05-28 01:19:35] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-28 01:19:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 27 ms returned sat
[2024-05-28 01:19:36] [INFO ] [Real]Absence check using state equation in 1497 ms returned sat
[2024-05-28 01:19:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:19:37] [INFO ] [Real]Added 72 Read/Feed constraints in 215 ms returned sat
[2024-05-28 01:19:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:19:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-28 01:19:37] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 34 ms returned sat
[2024-05-28 01:19:39] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2024-05-28 01:19:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 171 ms returned sat
[2024-05-28 01:19:39] [INFO ] Deduced a trap composed of 137 places in 359 ms of which 48 ms to minimize.
[2024-05-28 01:19:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 474 ms
[2024-05-28 01:19:39] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-28 01:19:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 7 ms returned unsat
[2024-05-28 01:19:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 01:19:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 2 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 22 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 32 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 20 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 10 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 01:19:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 31 ms returned sat
[2024-05-28 01:19:41] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2024-05-28 01:19:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:19:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 01:19:42] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 41 ms returned sat
[2024-05-28 01:19:43] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2024-05-28 01:19:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 01:19:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 743 ms returned sat
[2024-05-28 01:19:43] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-28 01:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2024-05-28 01:19:44] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 79 ms.
Maximisation of solution failed !
Minimization took 14 ms.
[2024-05-28 01:19:47] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 01:19:47] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1] Max Struct:[5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 6, 1]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 7 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 5 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 300 place count 325 transition count 675
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 312 place count 325 transition count 663
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 324 place count 313 transition count 663
Applied a total of 324 rules in 305 ms. Remains 313 /476 variables (removed 163) and now considering 663/824 (removed 161) transitions.
Running 661 sub problems to find dead transitions.
[2024-05-28 01:19:47] [INFO ] Flow matrix only has 651 transitions (discarded 12 similar events)
// Phase 1: matrix 651 rows 313 cols
[2024-05-28 01:19:47] [INFO ] Computed 44 invariants in 13 ms
[2024-05-28 01:19:47] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-28 01:19:53] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 2 ms to minimize.
[2024-05-28 01:19:53] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-05-28 01:19:53] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-28 01:19:53] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-28 01:19:53] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:19:54] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-28 01:19:54] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:19:54] [INFO ] Deduced a trap composed of 103 places in 191 ms of which 2 ms to minimize.
[2024-05-28 01:20:02] [INFO ] Deduced a trap composed of 50 places in 7207 ms of which 28 ms to minimize.
[2024-05-28 01:20:03] [INFO ] Deduced a trap composed of 109 places in 198 ms of which 2 ms to minimize.
[2024-05-28 01:20:05] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 2 ms to minimize.
[2024-05-28 01:20:05] [INFO ] Deduced a trap composed of 100 places in 175 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 9.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.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 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.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 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.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 1.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 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 2.0)
(s126 0.0)
(s127 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 311/964 variables, and 48 constraints, problems are : Problem set: 0 solved, 661 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/313 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-28 01:20:18] [INFO ] Deduced a trap composed of 171 places in 235 ms of which 3 ms to minimize.
[2024-05-28 01:20:18] [INFO ] Deduced a trap composed of 175 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:20:19] [INFO ] Deduced a trap composed of 172 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-05-28 01:20:24] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 3 ms to minimize.
[2024-05-28 01:20:24] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 3 ms to minimize.
[2024-05-28 01:20:24] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-05-28 01:20:25] [INFO ] Deduced a trap composed of 131 places in 251 ms of which 5 ms to minimize.
[2024-05-28 01:20:25] [INFO ] Deduced a trap composed of 123 places in 246 ms of which 6 ms to minimize.
[2024-05-28 01:20:26] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:20:27] [INFO ] Deduced a trap composed of 126 places in 238 ms of which 5 ms to minimize.
[2024-05-28 01:20:27] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/964 variables, and 59 constraints, problems are : Problem set: 0 solved, 661 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/313 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 23/23 constraints]
After SMT, in 41463ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 41511ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41844 ms. Remains : 313/476 places, 663/824 transitions.
[2024-05-28 01:20:29] [INFO ] Flow matrix only has 651 transitions (discarded 12 similar events)
[2024-05-28 01:20:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (566 resets) in 3669 ms. (272 steps per ms)
BEST_FIRST walk for 1000001 steps (266 resets) in 1830 ms. (546 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-28 01:20:34] [INFO ] Flow matrix only has 651 transitions (discarded 12 similar events)
[2024-05-28 01:20:34] [INFO ] Invariant cache hit.
[2024-05-28 01:20:34] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 01:20:34] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 21 ms returned sat
[2024-05-28 01:20:35] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2024-05-28 01:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:20:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 01:20:35] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 11 ms returned sat
[2024-05-28 01:20:36] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2024-05-28 01:20:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:20:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 162 ms returned sat
[2024-05-28 01:20:43] [INFO ] Deduced a trap composed of 38 places in 7251 ms of which 28 ms to minimize.
[2024-05-28 01:20:43] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:20:44] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 2 ms to minimize.
[2024-05-28 01:20:44] [INFO ] Deduced a trap composed of 116 places in 253 ms of which 5 ms to minimize.
[2024-05-28 01:20:44] [INFO ] Deduced a trap composed of 148 places in 279 ms of which 3 ms to minimize.
[2024-05-28 01:20:44] [INFO ] Deduced a trap composed of 131 places in 247 ms of which 25 ms to minimize.
[2024-05-28 01:20:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 8848 ms
[2024-05-28 01:20:45] [INFO ] Computed and/alt/rep : 355/1559/349 causal constraints (skipped 300 transitions) in 104 ms.
[2024-05-28 01:20:48] [INFO ] Added : 116 causal constraints over 24 iterations in 3154 ms. Result :sat
Minimization took 3723 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 663/663 transitions.
Applied a total of 0 rules in 30 ms. Remains 313 /313 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 313/313 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 663/663 transitions.
Applied a total of 0 rules in 43 ms. Remains 313 /313 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2024-05-28 01:20:52] [INFO ] Flow matrix only has 651 transitions (discarded 12 similar events)
[2024-05-28 01:20:52] [INFO ] Invariant cache hit.
[2024-05-28 01:21:05] [INFO ] Implicit Places using invariants in 12667 ms returned [79, 158, 179, 181, 276, 287]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 12684 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 307/313 places, 663/663 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 303 transition count 659
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 303 transition count 659
Applied a total of 8 rules in 38 ms. Remains 303 /307 variables (removed 4) and now considering 659/663 (removed 4) transitions.
[2024-05-28 01:21:05] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
// Phase 1: matrix 647 rows 303 cols
[2024-05-28 01:21:05] [INFO ] Computed 38 invariants in 9 ms
[2024-05-28 01:21:11] [INFO ] Implicit Places using invariants in 5928 ms returned []
[2024-05-28 01:21:11] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:21:11] [INFO ] Invariant cache hit.
[2024-05-28 01:21:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:21:17] [INFO ] Implicit Places using invariants and state equation in 6030 ms returned []
Implicit Place search using SMT with State Equation took 11984 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 303/313 places, 659/663 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24749 ms. Remains : 303/313 places, 659/663 transitions.
[2024-05-28 01:21:17] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:21:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (595 resets) in 3409 ms. (293 steps per ms)
BEST_FIRST walk for 1000001 steps (259 resets) in 1616 ms. (618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-28 01:21:22] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:21:22] [INFO ] Invariant cache hit.
[2024-05-28 01:21:22] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 01:21:22] [INFO ] [Real]Absence check using 13 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-28 01:21:23] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2024-05-28 01:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:21:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 01:21:23] [INFO ] [Nat]Absence check using 13 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-28 01:21:24] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2024-05-28 01:21:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:21:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 385 ms returned sat
[2024-05-28 01:21:24] [INFO ] Deduced a trap composed of 39 places in 344 ms of which 5 ms to minimize.
[2024-05-28 01:21:25] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2024-05-28 01:21:25] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 6 ms to minimize.
[2024-05-28 01:21:26] [INFO ] Deduced a trap composed of 109 places in 312 ms of which 24 ms to minimize.
[2024-05-28 01:21:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1613 ms
[2024-05-28 01:21:26] [INFO ] Computed and/alt/rep : 351/1554/345 causal constraints (skipped 300 transitions) in 67 ms.
[2024-05-28 01:21:27] [INFO ] Added : 47 causal constraints over 10 iterations in 971 ms. Result :sat
Minimization took 2958 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 659/659 transitions.
Applied a total of 0 rules in 46 ms. Remains 303 /303 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 303/303 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 659/659 transitions.
Applied a total of 0 rules in 30 ms. Remains 303 /303 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2024-05-28 01:21:30] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:21:30] [INFO ] Invariant cache hit.
[2024-05-28 01:21:31] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-28 01:21:31] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:21:31] [INFO ] Invariant cache hit.
[2024-05-28 01:21:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:21:39] [INFO ] Implicit Places using invariants and state equation in 8613 ms returned []
Implicit Place search using SMT with State Equation took 9057 ms to find 0 implicit places.
[2024-05-28 01:21:40] [INFO ] Redundant transitions in 63 ms returned []
Running 657 sub problems to find dead transitions.
[2024-05-28 01:21:40] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:21:40] [INFO ] Invariant cache hit.
[2024-05-28 01:21:40] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-05-28 01:21:48] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:21:48] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 3 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 103 places in 208 ms of which 7 ms to minimize.
[2024-05-28 01:21:49] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:21:51] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 2 ms to minimize.
[2024-05-28 01:21:51] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 4 ms to minimize.
[2024-05-28 01:21:59] [INFO ] Deduced a trap composed of 99 places in 6935 ms of which 29 ms to minimize.
[2024-05-28 01:21:59] [INFO ] Deduced a trap composed of 98 places in 216 ms of which 3 ms to minimize.
[2024-05-28 01:22:00] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-28 01:22:01] [INFO ] Deduced a trap composed of 129 places in 221 ms of which 2 ms to minimize.
[2024-05-28 01:22:01] [INFO ] Deduced a trap composed of 111 places in 188 ms of which 3 ms to minimize.
[2024-05-28 01:22:02] [INFO ] Deduced a trap composed of 127 places in 237 ms of which 2 ms to minimize.
[2024-05-28 01:22:03] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-28 01:22:03] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-05-28 01:22:08] [INFO ] Deduced a trap composed of 111 places in 223 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/950 variables, and 56 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 657/657 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 657 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-05-28 01:22:17] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 14 ms to minimize.
[2024-05-28 01:22:20] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:22:24] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:22:25] [INFO ] Deduced a trap composed of 120 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/950 variables, and 60 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/657 constraints, Known Traps: 25/25 constraints]
After SMT, in 60996ms problems are : Problem set: 0 solved, 657 unsolved
Search for dead transitions found 0 dead transitions in 61008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70183 ms. Remains : 303/303 places, 659/659 transitions.
RANDOM walk for 40000 steps (24 resets) in 1301 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (13 resets) in 398 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 376 ms. (106 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 200512 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 200512 steps, saw 108531 distinct states, run finished after 3005 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-28 01:22:44] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:22:44] [INFO ] Invariant cache hit.
[2024-05-28 01:22:44] [INFO ] State equation strengthened by 72 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 255/263 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 01:22:47] [INFO ] Deduced a trap composed of 65 places in 2340 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 11/274 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 27/301 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 647/948 variables, 301/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/948 variables, 72/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/948 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/950 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/950 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/950 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 950/950 variables, and 414 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3709 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 303/303 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 255/263 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/274 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 27/301 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 01:22:48] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-28 01:22:49] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 1 ms to minimize.
[2024-05-28 01:22:49] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-28 01:22:49] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-05-28 01:22:49] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 5/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/950 variables, and 344 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2465 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6195ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 659/659 transitions.
Applied a total of 0 rules in 19 ms. Remains 303 /303 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Running 657 sub problems to find dead transitions.
[2024-05-28 01:22:51] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:22:51] [INFO ] Invariant cache hit.
[2024-05-28 01:22:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-05-28 01:22:56] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-05-28 01:22:56] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 3 ms to minimize.
[2024-05-28 01:22:56] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2024-05-28 01:22:56] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2024-05-28 01:22:56] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-28 01:22:56] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:22:56] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-28 01:22:57] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:22:57] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 3 ms to minimize.
[2024-05-28 01:22:57] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:22:58] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:22:59] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-05-28 01:23:00] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:23:00] [INFO ] Deduced a trap composed of 98 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:23:01] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2024-05-28 01:23:01] [INFO ] Deduced a trap composed of 129 places in 182 ms of which 2 ms to minimize.
[2024-05-28 01:23:02] [INFO ] Deduced a trap composed of 111 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:23:02] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 2 ms to minimize.
[2024-05-28 01:23:04] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:23:04] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-05-28 01:23:07] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/950 variables, and 56 constraints, problems are : Problem set: 0 solved, 657 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 657/657 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 657 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-05-28 01:23:19] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-28 01:23:25] [INFO ] Deduced a trap composed of 167 places in 198 ms of which 5 ms to minimize.
[2024-05-28 01:23:30] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 3 ms to minimize.
[2024-05-28 01:23:30] [INFO ] Deduced a trap composed of 120 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/950 variables, and 60 constraints, problems are : Problem set: 0 solved, 657 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 22/25 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/657 constraints, Known Traps: 25/25 constraints]
After SMT, in 41130ms problems are : Problem set: 0 solved, 657 unsolved
Search for dead transitions found 0 dead transitions in 41141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41164 ms. Remains : 303/303 places, 659/659 transitions.
RANDOM walk for 40000 steps (27 resets) in 545 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (13 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217073 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217073 steps, saw 116771 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-28 01:23:35] [INFO ] Flow matrix only has 647 transitions (discarded 12 similar events)
[2024-05-28 01:23:35] [INFO ] Invariant cache hit.
[2024-05-28 01:23:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 255/263 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/274 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/301 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 647/948 variables, 301/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/948 variables, 72/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/948 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/950 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/950 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/950 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/950 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 950/950 variables, and 413 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1681 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 303/303 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 255/263 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:23:37] [INFO ] Deduced a trap composed of 86 places in 257 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/274 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/301 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:23:37] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 5 ms to minimize.
[2024-05-28 01:23:38] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 3 ms to minimize.
[2024-05-28 01:23:38] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 7 ms to minimize.
[2024-05-28 01:23:38] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:23:38] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:23:38] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 647/948 variables, 301/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/948 variables, 72/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 948/950 variables, and 418 constraints, problems are : Problem set: 1 solved, 0 unsolved in 3165 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/303 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 4874ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 247253 ms.
ITS solved all properties within timeout

BK_STOP 1716859420422

--------------------
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-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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-171654445400221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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