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-171654447300501.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 PolyORBNT-PT-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447300501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 32K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 12 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 904K Apr 12 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 627K Apr 12 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 12 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717261590083

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:06:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 17:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:06:32] [INFO ] Load time of PNML (sax parser for PT used): 822 ms
[2024-06-01 17:06:32] [INFO ] Transformed 854 places.
[2024-06-01 17:06:32] [INFO ] Transformed 12340 transitions.
[2024-06-01 17:06:32] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 1087 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 17:06:33] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-06-01 17:06:33] [INFO ] Computed 112 invariants in 161 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[149, 4, 343, 109, 1, 1, 343, 410, 1, 109, 445, 1, 1, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (559 resets) in 347 ms. (28 steps per ms)
FORMULA PolyORBNT-PT-S10J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (793 resets) in 670 ms. (134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 10, 1, 10, 1, 1, 1, 0] Max Struct:[149, 4, 343, 109, 343, 410, 109, 445, 1]
[2024-06-01 17:06:34] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-06-01 17:06:34] [INFO ] Invariant cache hit.
[2024-06-01 17:06:34] [INFO ] [Real]Absence check using 81 positive place invariants in 25 ms returned sat
[2024-06-01 17:06:34] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 18 ms returned unsat
[2024-06-01 17:06:34] [INFO ] [Real]Absence check using 81 positive place invariants in 45 ms returned sat
[2024-06-01 17:06:34] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 20 ms returned unsat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive place invariants in 43 ms returned sat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 79 ms returned unsat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive place invariants in 34 ms returned sat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 36 ms returned unsat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 31 ms returned unsat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive place invariants in 46 ms returned sat
[2024-06-01 17:06:35] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 34 ms returned sat
[2024-06-01 17:06:37] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2024-06-01 17:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:06:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2024-06-01 17:06:38] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 37 ms returned sat
[2024-06-01 17:06:39] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2024-06-01 17:06:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:06:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 184 ms returned sat
[2024-06-01 17:06:40] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 303 ms.
[2024-06-01 17:06:41] [INFO ] Deduced a trap composed of 110 places in 717 ms of which 23 ms to minimize.
[2024-06-01 17:06:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1194 ms
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 17:06:43] [INFO ] [Real]Absence check using 81 positive place invariants in 28 ms returned sat
[2024-06-01 17:06:43] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 23 ms returned unsat
[2024-06-01 17:06:43] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-06-01 17:06:43] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 32 ms returned sat
[2024-06-01 17:06:44] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2024-06-01 17:06:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:06:44] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2024-06-01 17:06:44] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 26 ms returned sat
[2024-06-01 17:06:45] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2024-06-01 17:06:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 148 ms returned sat
[2024-06-01 17:06:46] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 372 ms.
[2024-06-01 17:06:47] [INFO ] Added : 5 causal constraints over 1 iterations in 1389 ms. Result :sat
Minimization took 761 ms.
[2024-06-01 17:06:47] [INFO ] [Real]Absence check using 81 positive place invariants in 27 ms returned sat
[2024-06-01 17:06:48] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 34 ms returned sat
[2024-06-01 17:06:49] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2024-06-01 17:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:06:49] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2024-06-01 17:06:49] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 32 ms returned sat
[2024-06-01 17:06:50] [INFO ] [Nat]Absence check using state equation in 1383 ms returned sat
[2024-06-01 17:06:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 363 ms returned sat
[2024-06-01 17:06:51] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 205 ms.
[2024-06-01 17:06:53] [INFO ] Deduced a trap composed of 12 places in 743 ms of which 6 ms to minimize.
[2024-06-01 17:06:54] [INFO ] Deduced a trap composed of 19 places in 567 ms of which 5 ms to minimize.
[2024-06-01 17:06:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1709 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 10, 1, 10, 1, 1, 1, 0] Max Struct:[1, 1, 10, 1, 10, 410, 1, 445, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0] Max Struct:[410, 445, 1]
Support contains 412 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 101 place count 799 transition count 2184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 798 transition count 2184
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 102 place count 798 transition count 2140
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 190 place count 754 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 753 transition count 2139
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 753 transition count 2139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 751 transition count 2137
Applied a total of 196 rules in 324 ms. Remains 751 /854 variables (removed 103) and now considering 2137/2230 (removed 93) transitions.
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:06:54] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
// Phase 1: matrix 2128 rows 751 cols
[2024-06-01 17:06:54] [INFO ] Computed 102 invariants in 91 ms
[2024-06-01 17:06:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
SMT process timed out in 38178ms, After SMT, problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 38210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38557 ms. Remains : 751/854 places, 2137/2230 transitions.
[2024-06-01 17:07:32] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:07:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0] Max Struct:[410, 181, 1]
RANDOM walk for 1000000 steps (70386 resets) in 21181 ms. (47 steps per ms)
FORMULA PolyORBNT-PT-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1546575 steps (12853 resets) in 8189 ms. (188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 3] Max Struct:[410, 181]
[2024-06-01 17:08:02] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:08:02] [INFO ] Invariant cache hit.
[2024-06-01 17:08:02] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-06-01 17:08:02] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2024-06-01 17:08:03] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2024-06-01 17:08:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:08:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 34 ms returned sat
[2024-06-01 17:08:03] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2024-06-01 17:08:06] [INFO ] [Nat]Absence check using state equation in 2351 ms returned unsat
[2024-06-01 17:08:06] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2024-06-01 17:08:06] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 26 ms returned sat
[2024-06-01 17:08:07] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2024-06-01 17:08:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:08:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-06-01 17:08:07] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 25 ms returned sat
[2024-06-01 17:08:08] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-06-01 17:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 267 ms returned sat
[2024-06-01 17:08:08] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 237 ms.
[2024-06-01 17:08:09] [INFO ] Added : 6 causal constraints over 2 iterations in 796 ms. Result :sat
Minimization took 4691 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 3] Max Struct:[4, 181]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 65 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 751/751 places, 2137/2137 transitions.
[2024-06-01 17:08:13] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:08:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[181]
RANDOM walk for 1000000 steps (70526 resets) in 14597 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (8149 resets) in 2363 ms. (423 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-06-01 17:08:30] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:08:30] [INFO ] Invariant cache hit.
[2024-06-01 17:08:31] [INFO ] [Real]Absence check using 81 positive place invariants in 16 ms returned sat
[2024-06-01 17:08:31] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 25 ms returned sat
[2024-06-01 17:08:31] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2024-06-01 17:08:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:08:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2024-06-01 17:08:32] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 35 ms returned sat
[2024-06-01 17:08:32] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2024-06-01 17:08:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 376 ms returned sat
[2024-06-01 17:08:33] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 307 ms.
[2024-06-01 17:08:34] [INFO ] Added : 6 causal constraints over 2 iterations in 806 ms. Result :sat
Minimization took 4516 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 62 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 53 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-06-01 17:08:38] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:08:38] [INFO ] Invariant cache hit.
[2024-06-01 17:08:39] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2024-06-01 17:08:40] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:08:40] [INFO ] Invariant cache hit.
[2024-06-01 17:08:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:54] [INFO ] Implicit Places using invariants and state equation in 14786 ms returned []
Implicit Place search using SMT with State Equation took 16111 ms to find 0 implicit places.
[2024-06-01 17:08:54] [INFO ] Redundant transitions in 155 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:08:54] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:08:55] [INFO ] Invariant cache hit.
[2024-06-01 17:08:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-06-01 17:09:46] [INFO ] Deduced a trap composed of 18 places in 393 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 4)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 4)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 9)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 4)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s204 0)
(s205 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 2)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 4)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 4)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 1)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s567 0)
(s568 1)
(s570 0)
(s571 0)
(s572 4)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 4)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 1)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 1)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 1)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 1)
(s679 0)
(s680 4)
(s681 0)
(s682 0)
(s683 1)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 77777ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 77804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94142 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40001 steps (2782 resets) in 1498 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (286 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (329 resets) in 471 ms. (84 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 158871 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 158871 steps, saw 27522 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 17:10:16] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:10:16] [INFO ] Invariant cache hit.
[2024-06-01 17:10:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:10:19] [INFO ] Deduced a trap composed of 339 places in 545 ms of which 5 ms to minimize.
[2024-06-01 17:10:20] [INFO ] Deduced a trap composed of 160 places in 472 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2437 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3827ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 58 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:10:20] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:10:20] [INFO ] Invariant cache hit.
[2024-06-01 17:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-06-01 17:11:02] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 58179ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 58200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58270 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2821 resets) in 925 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (323 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 183780 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 183780 steps, saw 31318 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-06-01 17:11:22] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:11:22] [INFO ] Invariant cache hit.
[2024-06-01 17:11:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 982 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:11:24] [INFO ] Deduced a trap composed of 339 places in 539 ms of which 11 ms to minimize.
[2024-06-01 17:11:25] [INFO ] Deduced a trap composed of 160 places in 501 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2416 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3458ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 108 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 89 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-06-01 17:11:25] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:11:25] [INFO ] Invariant cache hit.
[2024-06-01 17:11:27] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-06-01 17:11:27] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:11:27] [INFO ] Invariant cache hit.
[2024-06-01 17:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:11:40] [INFO ] Implicit Places using invariants and state equation in 13845 ms returned []
Implicit Place search using SMT with State Equation took 15023 ms to find 0 implicit places.
[2024-06-01 17:11:40] [INFO ] Redundant transitions in 125 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:11:41] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:11:41] [INFO ] Invariant cache hit.
[2024-06-01 17:11:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-06-01 17:12:32] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 2 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 Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 77352ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 77372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92635 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[181]
Starting property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[181]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[181]
[2024-06-01 17:12:58] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:12:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[181]
RANDOM walk for 10000 steps (715 resets) in 133 ms. (74 steps per ms)
BEST_FIRST walk for 10001 steps (89 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-06-01 17:12:58] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:12:58] [INFO ] Invariant cache hit.
[2024-06-01 17:12:58] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-06-01 17:12:58] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2024-06-01 17:12:59] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2024-06-01 17:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:12:59] [INFO ] [Nat]Absence check using 81 positive place invariants in 21 ms returned sat
[2024-06-01 17:12:59] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 25 ms returned sat
[2024-06-01 17:13:00] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2024-06-01 17:13:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:13:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 319 ms returned sat
[2024-06-01 17:13:00] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 193 ms.
[2024-06-01 17:13:01] [INFO ] Added : 6 causal constraints over 2 iterations in 723 ms. Result :sat
Minimization took 809 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 68 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:13:02] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:13:02] [INFO ] Invariant cache hit.
[2024-06-01 17:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-06-01 17:13:44] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 58415ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 58434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58509 ms. Remains : 751/751 places, 2137/2137 transitions.
[2024-06-01 17:14:00] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:14:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[181]
RANDOM walk for 1000000 steps (70212 resets) in 13304 ms. (75 steps per ms)
BEST_FIRST walk for 1000001 steps (8160 resets) in 2575 ms. (388 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-06-01 17:14:16] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:14:16] [INFO ] Invariant cache hit.
[2024-06-01 17:14:16] [INFO ] [Real]Absence check using 81 positive place invariants in 16 ms returned sat
[2024-06-01 17:14:16] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 18 ms returned sat
[2024-06-01 17:14:17] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2024-06-01 17:14:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:14:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 32 ms returned sat
[2024-06-01 17:14:17] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 31 ms returned sat
[2024-06-01 17:14:18] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-06-01 17:14:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:14:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 248 ms returned sat
[2024-06-01 17:14:18] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 150 ms.
[2024-06-01 17:14:19] [INFO ] Added : 6 causal constraints over 2 iterations in 621 ms. Result :sat
Minimization took 4509 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 88 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 65 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-06-01 17:14:23] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:14:23] [INFO ] Invariant cache hit.
[2024-06-01 17:14:24] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2024-06-01 17:14:24] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:14:24] [INFO ] Invariant cache hit.
[2024-06-01 17:14:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:14:40] [INFO ] Implicit Places using invariants and state equation in 15538 ms returned []
Implicit Place search using SMT with State Equation took 16583 ms to find 0 implicit places.
[2024-06-01 17:14:40] [INFO ] Redundant transitions in 77 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:14:40] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:14:40] [INFO ] Invariant cache hit.
[2024-06-01 17:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-06-01 17:15:31] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 77953ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 77976ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94714 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2870 resets) in 1104 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (344 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (332 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 131874 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 131874 steps, saw 23305 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 17:16:01] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:16:01] [INFO ] Invariant cache hit.
[2024-06-01 17:16:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 17:16:04] [INFO ] Deduced a trap composed of 339 places in 535 ms of which 4 ms to minimize.
[2024-06-01 17:16:04] [INFO ] Deduced a trap composed of 160 places in 473 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2231 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3250ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 53 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:16:05] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:16:05] [INFO ] Invariant cache hit.
[2024-06-01 17:16:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 18 places in 298 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 57661ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 57680ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57738 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2808 resets) in 915 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (333 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 191891 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 191891 steps, saw 32543 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-06-01 17:17:06] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:17:06] [INFO ] Invariant cache hit.
[2024-06-01 17:17:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:17:08] [INFO ] Deduced a trap composed of 339 places in 508 ms of which 4 ms to minimize.
[2024-06-01 17:17:09] [INFO ] Deduced a trap composed of 160 places in 448 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3077ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 51 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 63 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-06-01 17:17:09] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:17:09] [INFO ] Invariant cache hit.
[2024-06-01 17:17:10] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-06-01 17:17:10] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:17:10] [INFO ] Invariant cache hit.
[2024-06-01 17:17:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:17:23] [INFO ] Implicit Places using invariants and state equation in 13459 ms returned []
Implicit Place search using SMT with State Equation took 14441 ms to find 0 implicit places.
[2024-06-01 17:17:24] [INFO ] Redundant transitions in 76 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-06-01 17:17:24] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-06-01 17:17:24] [INFO ] Invariant cache hit.
[2024-06-01 17:17:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-06-01 17:18:15] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 77695ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 77732ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92335 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[181]
Ending property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12 in 343408 ms.
[2024-06-01 17:18:42] [INFO ] Flatten gal took : 439 ms
[2024-06-01 17:18:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-06-01 17:18:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 751 places, 2137 transitions and 14186 arcs took 51 ms.
Total runtime 730863 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S10J40-UpperBounds-12

BK_STOP 1717262322870

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBNT-PT-S10J40-UpperBounds-12
ub formula formula --maxsum=/tmp/801/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J40"
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 PolyORBNT-PT-S10J40, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447300501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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