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.r298-tajo-171654455200242.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S05J60, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455200242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K 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 booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717104436811

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:27:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:27:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 21:27:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 21:27:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2024-05-30 21:27:18] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 25 ms.
[2024-05-30 21:27:18] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 55 ms.
[2024-05-30 21:27:18] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-30 21:27:18] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-30 21:27:18] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-30 21:27:18] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2793 resets) in 1974 ms. (20 steps per ms) remains 1/36 properties
BEST_FIRST walk for 40004 steps (458 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
[2024-05-30 21:27:19] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-30 21:27:19] [INFO ] Computed 142 invariants in 106 ms
[2024-05-30 21:27:19] [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) 449/450 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/574 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/879 variables, 61/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/895 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/907 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:27:20] [INFO ] Deduced a trap composed of 402 places in 398 ms of which 44 ms to minimize.
[2024-05-30 21:27:21] [INFO ] Deduced a trap composed of 312 places in 413 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/907 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/908 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/908 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1311/2219 variables, 908/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2219 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2219 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/2220 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2220 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2220 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 1054 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 449/450 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 124/574 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 305/879 variables, 61/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/895 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/907 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/907 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/907 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/908 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/908 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1311/2219 variables, 908/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2219 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2219 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/2220 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2220 variables, 1/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2220 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2220 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 1055 constraints, problems are : Problem set: 0 solved, 1 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3037ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 330 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-30 21:27:22] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-30 21:27:23] [INFO ] Computed 137 invariants in 65 ms
[2024-05-30 21:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-30 21:27:58] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 5 ms to minimize.
[2024-05-30 21:28:02] [INFO ] Deduced a trap composed of 285 places in 331 ms of which 5 ms to minimize.
[2024-05-30 21:28:02] [INFO ] Deduced a trap composed of 188 places in 356 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-30 21:28:04] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 3 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 765/1947 variables, and 136 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 4/4 constraints]
After SMT, in 43547ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43930 ms. Remains : 770/909 places, 1181/1315 transitions.
RANDOM walk for 4000000 steps (208410 resets) in 26897 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (13614 resets) in 7492 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2747319 steps, run timeout after 24001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 2747319 steps, saw 859130 distinct states, run finished after 24005 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-30 21:28:39] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-30 21:28:39] [INFO ] Invariant cache hit.
[2024-05-30 21:28:39] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1947 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1688ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 70 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 56 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-30 21:28:41] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-30 21:28:41] [INFO ] Invariant cache hit.
[2024-05-30 21:28:42] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2024-05-30 21:28:42] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-30 21:28:42] [INFO ] Invariant cache hit.
[2024-05-30 21:28:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:28:48] [INFO ] Implicit Places using invariants and state equation in 6153 ms returned []
Implicit Place search using SMT with State Equation took 7196 ms to find 0 implicit places.
[2024-05-30 21:28:48] [INFO ] Redundant transitions in 91 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-30 21:28:48] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-30 21:28:48] [INFO ] Invariant cache hit.
[2024-05-30 21:28:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 2.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1947 variables, and 136 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
[2024-05-30 21:29:23] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 0/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 4 (OVERLAPS) 4/769 variables, 4/137 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1947 variables, and 137 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 62788ms problems are : Problem set: 78 solved, 1097 unsolved
Search for dead transitions found 78 dead transitions in 62803ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1103/1181 transitions.
Applied a total of 0 rules in 58 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-30 21:29:51] [INFO ] Redundant transitions in 54 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70279 ms. Remains : 770/770 places, 1103/1181 transitions.
RANDOM walk for 4000000 steps (208391 resets) in 21524 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (13655 resets) in 6354 ms. (629 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2804731 steps, run timeout after 21001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 2804731 steps, saw 877624 distinct states, run finished after 21001 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-30 21:30:20] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-30 21:30:20] [INFO ] Computed 137 invariants in 40 ms
[2024-05-30 21:30:20] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1915ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 51 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 41 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-30 21:30:22] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:30:22] [INFO ] Invariant cache hit.
[2024-05-30 21:30:23] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-30 21:30:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:30:23] [INFO ] Invariant cache hit.
[2024-05-30 21:30:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:30:29] [INFO ] Implicit Places using invariants and state equation in 6657 ms returned []
Implicit Place search using SMT with State Equation took 7749 ms to find 0 implicit places.
[2024-05-30 21:30:29] [INFO ] Redundant transitions in 33 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-30 21:30:30] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:30:30] [INFO ] Invariant cache hit.
[2024-05-30 21:30:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:30:44] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 6 ms to minimize.
[2024-05-30 21:30:44] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-30 21:30:45] [INFO ] Deduced a trap composed of 233 places in 299 ms of which 4 ms to minimize.
[2024-05-30 21:30:45] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 4 ms to minimize.
[2024-05-30 21:30:45] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 4 ms to minimize.
[2024-05-30 21:30:46] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-30 21:30:46] [INFO ] Deduced a trap composed of 196 places in 369 ms of which 5 ms to minimize.
[2024-05-30 21:30:46] [INFO ] Deduced a trap composed of 245 places in 349 ms of which 5 ms to minimize.
[2024-05-30 21:30:47] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-05-30 21:30:47] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-30 21:30:48] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 6 ms to minimize.
[2024-05-30 21:30:48] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 4 ms to minimize.
[2024-05-30 21:30:48] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-30 21:30:49] [INFO ] Deduced a trap composed of 254 places in 339 ms of which 6 ms to minimize.
[2024-05-30 21:30:49] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 6 ms to minimize.
[2024-05-30 21:30:49] [INFO ] Deduced a trap composed of 196 places in 359 ms of which 9 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 242 places in 310 ms of which 5 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-30 21:30:50] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-30 21:30:51] [INFO ] Deduced a trap composed of 242 places in 235 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:30:51] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 5 ms to minimize.
[2024-05-30 21:30:52] [INFO ] Deduced a trap composed of 245 places in 324 ms of which 6 ms to minimize.
[2024-05-30 21:30:52] [INFO ] Deduced a trap composed of 248 places in 341 ms of which 6 ms to minimize.
[2024-05-30 21:30:53] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:30:53] [INFO ] Deduced a trap composed of 251 places in 287 ms of which 6 ms to minimize.
[2024-05-30 21:30:53] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-05-30 21:30:54] [INFO ] Deduced a trap composed of 233 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:30:54] [INFO ] Deduced a trap composed of 236 places in 338 ms of which 7 ms to minimize.
[2024-05-30 21:30:54] [INFO ] Deduced a trap composed of 196 places in 364 ms of which 6 ms to minimize.
[2024-05-30 21:30:55] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 5 ms to minimize.
[2024-05-30 21:30:55] [INFO ] Deduced a trap composed of 260 places in 310 ms of which 6 ms to minimize.
[2024-05-30 21:30:55] [INFO ] Deduced a trap composed of 236 places in 317 ms of which 4 ms to minimize.
[2024-05-30 21:30:56] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 6 ms to minimize.
[2024-05-30 21:30:56] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-30 21:30:56] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-30 21:30:57] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:30:57] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-05-30 21:30:57] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 4 ms to minimize.
[2024-05-30 21:30:58] [INFO ] Deduced a trap composed of 196 places in 346 ms of which 5 ms to minimize.
[2024-05-30 21:30:58] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:31:07] [INFO ] Deduced a trap composed of 200 places in 367 ms of which 5 ms to minimize.
[2024-05-30 21:31:07] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 7 ms to minimize.
[2024-05-30 21:31:08] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-05-30 21:31:08] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 6 ms to minimize.
[2024-05-30 21:31:08] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-30 21:31:09] [INFO ] Deduced a trap composed of 200 places in 331 ms of which 5 ms to minimize.
[2024-05-30 21:31:09] [INFO ] Deduced a trap composed of 196 places in 367 ms of which 5 ms to minimize.
[2024-05-30 21:31:10] [INFO ] Deduced a trap composed of 200 places in 366 ms of which 6 ms to minimize.
[2024-05-30 21:31:10] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 6 ms to minimize.
[2024-05-30 21:31:10] [INFO ] Deduced a trap composed of 200 places in 355 ms of which 5 ms to minimize.
[2024-05-30 21:31:11] [INFO ] Deduced a trap composed of 196 places in 372 ms of which 5 ms to minimize.
[2024-05-30 21:31:11] [INFO ] Deduced a trap composed of 200 places in 322 ms of which 5 ms to minimize.
[2024-05-30 21:31:11] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 5 ms to minimize.
[2024-05-30 21:31:12] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 4 ms to minimize.
[2024-05-30 21:31:12] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-30 21:31:12] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-30 21:31:12] [INFO ] Deduced a trap composed of 200 places in 297 ms of which 5 ms to minimize.
[2024-05-30 21:31:13] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:31:13] [INFO ] Deduced a trap composed of 200 places in 242 ms of which 4 ms to minimize.
[2024-05-30 21:31:13] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:31:17] [INFO ] Deduced a trap composed of 345 places in 298 ms of which 5 ms to minimize.
[2024-05-30 21:31:17] [INFO ] Deduced a trap composed of 335 places in 299 ms of which 5 ms to minimize.
[2024-05-30 21:31:17] [INFO ] Deduced a trap composed of 246 places in 288 ms of which 5 ms to minimize.
[2024-05-30 21:31:18] [INFO ] Deduced a trap composed of 239 places in 264 ms of which 4 ms to minimize.
[2024-05-30 21:31:18] [INFO ] Deduced a trap composed of 246 places in 271 ms of which 5 ms to minimize.
[2024-05-30 21:31:18] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 5 ms to minimize.
[2024-05-30 21:31:18] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-05-30 21:31:19] [INFO ] Deduced a trap composed of 258 places in 326 ms of which 6 ms to minimize.
[2024-05-30 21:31:19] [INFO ] Deduced a trap composed of 239 places in 246 ms of which 3 ms to minimize.
[2024-05-30 21:31:19] [INFO ] Deduced a trap composed of 242 places in 233 ms of which 4 ms to minimize.
[2024-05-30 21:31:20] [INFO ] Deduced a trap composed of 248 places in 270 ms of which 4 ms to minimize.
[2024-05-30 21:31:20] [INFO ] Deduced a trap composed of 306 places in 373 ms of which 6 ms to minimize.
[2024-05-30 21:31:20] [INFO ] Deduced a trap composed of 236 places in 332 ms of which 5 ms to minimize.
[2024-05-30 21:31:21] [INFO ] Deduced a trap composed of 242 places in 300 ms of which 5 ms to minimize.
[2024-05-30 21:31:21] [INFO ] Deduced a trap composed of 251 places in 240 ms of which 4 ms to minimize.
[2024-05-30 21:31:21] [INFO ] Deduced a trap composed of 248 places in 301 ms of which 5 ms to minimize.
[2024-05-30 21:31:22] [INFO ] Deduced a trap composed of 236 places in 367 ms of which 5 ms to minimize.
[2024-05-30 21:31:22] [INFO ] Deduced a trap composed of 234 places in 417 ms of which 6 ms to minimize.
[2024-05-30 21:31:23] [INFO ] Deduced a trap composed of 242 places in 377 ms of which 6 ms to minimize.
[2024-05-30 21:31:23] [INFO ] Deduced a trap composed of 251 places in 358 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:31:28] [INFO ] Deduced a trap composed of 196 places in 362 ms of which 6 ms to minimize.
[2024-05-30 21:31:29] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 4 ms to minimize.
[2024-05-30 21:31:29] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-30 21:31:29] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-30 21:31:30] [INFO ] Deduced a trap composed of 196 places in 344 ms of which 5 ms to minimize.
[2024-05-30 21:31:30] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-05-30 21:31:31] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 5 ms to minimize.
[2024-05-30 21:31:31] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-05-30 21:31:31] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-05-30 21:31:32] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-05-30 21:31:32] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 6 ms to minimize.
SMT process timed out in 62398ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70262 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 400000 steps (20787 resets) in 3346 ms. (119 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:31:33] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:31:33] [INFO ] Invariant cache hit.
[2024-05-30 21:31:33] [INFO ] [Real]Absence check using 130 positive place invariants in 53 ms returned sat
[2024-05-30 21:31:33] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 39 ms returned sat
[2024-05-30 21:31:33] [INFO ] After 406ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:31:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:31:33] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:31:34] [INFO ] After 72ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:31:34] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:31:34] [INFO ] [Nat]Absence check using 130 positive place invariants in 29 ms returned sat
[2024-05-30 21:31:34] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-30 21:31:34] [INFO ] After 622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:31:34] [INFO ] After 114ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:31:35] [INFO ] Deduced a trap composed of 156 places in 385 ms of which 5 ms to minimize.
[2024-05-30 21:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 545 ms
TRAPS : Iteration 1
[2024-05-30 21:31:35] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:31:35] [INFO ] After 1576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (208144 resets) in 22123 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (13707 resets) in 6668 ms. (599 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2470632 steps, run timeout after 21001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 2470632 steps, saw 770623 distinct states, run finished after 21002 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-30 21:32:04] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:32:04] [INFO ] Invariant cache hit.
[2024-05-30 21:32:04] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1785ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 42 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 35 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-30 21:32:06] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:32:06] [INFO ] Invariant cache hit.
[2024-05-30 21:32:07] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-30 21:32:07] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:32:07] [INFO ] Invariant cache hit.
[2024-05-30 21:32:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:32:14] [INFO ] Implicit Places using invariants and state equation in 7434 ms returned []
Implicit Place search using SMT with State Equation took 8406 ms to find 0 implicit places.
[2024-05-30 21:32:14] [INFO ] Redundant transitions in 23 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-30 21:32:14] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:32:14] [INFO ] Invariant cache hit.
[2024-05-30 21:32:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:32:28] [INFO ] Deduced a trap composed of 245 places in 287 ms of which 5 ms to minimize.
[2024-05-30 21:32:28] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2024-05-30 21:32:29] [INFO ] Deduced a trap composed of 233 places in 422 ms of which 4 ms to minimize.
[2024-05-30 21:32:29] [INFO ] Deduced a trap composed of 196 places in 515 ms of which 5 ms to minimize.
[2024-05-30 21:32:30] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 5 ms to minimize.
[2024-05-30 21:32:30] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 5 ms to minimize.
[2024-05-30 21:32:31] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-30 21:32:31] [INFO ] Deduced a trap composed of 245 places in 303 ms of which 5 ms to minimize.
[2024-05-30 21:32:31] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-05-30 21:32:32] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2024-05-30 21:32:32] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 6 ms to minimize.
[2024-05-30 21:32:32] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-05-30 21:32:33] [INFO ] Deduced a trap composed of 196 places in 361 ms of which 5 ms to minimize.
[2024-05-30 21:32:33] [INFO ] Deduced a trap composed of 254 places in 322 ms of which 5 ms to minimize.
[2024-05-30 21:32:33] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 5 ms to minimize.
[2024-05-30 21:32:34] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 5 ms to minimize.
[2024-05-30 21:32:34] [INFO ] Deduced a trap composed of 242 places in 313 ms of which 6 ms to minimize.
[2024-05-30 21:32:35] [INFO ] Deduced a trap composed of 196 places in 393 ms of which 6 ms to minimize.
[2024-05-30 21:32:35] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 5 ms to minimize.
[2024-05-30 21:32:35] [INFO ] Deduced a trap composed of 242 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:32:36] [INFO ] Deduced a trap composed of 254 places in 319 ms of which 5 ms to minimize.
[2024-05-30 21:32:37] [INFO ] Deduced a trap composed of 245 places in 329 ms of which 5 ms to minimize.
[2024-05-30 21:32:37] [INFO ] Deduced a trap composed of 248 places in 316 ms of which 5 ms to minimize.
[2024-05-30 21:32:38] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-30 21:32:38] [INFO ] Deduced a trap composed of 251 places in 319 ms of which 5 ms to minimize.
[2024-05-30 21:32:38] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 4 ms to minimize.
[2024-05-30 21:32:39] [INFO ] Deduced a trap composed of 233 places in 307 ms of which 5 ms to minimize.
[2024-05-30 21:32:39] [INFO ] Deduced a trap composed of 236 places in 343 ms of which 5 ms to minimize.
[2024-05-30 21:32:39] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-05-30 21:32:40] [INFO ] Deduced a trap composed of 230 places in 328 ms of which 5 ms to minimize.
[2024-05-30 21:32:40] [INFO ] Deduced a trap composed of 260 places in 329 ms of which 5 ms to minimize.
[2024-05-30 21:32:41] [INFO ] Deduced a trap composed of 236 places in 389 ms of which 5 ms to minimize.
[2024-05-30 21:32:41] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-05-30 21:32:41] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-30 21:32:42] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-30 21:32:42] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-05-30 21:32:42] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
[2024-05-30 21:32:42] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-05-30 21:32:43] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-05-30 21:32:43] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:32:51] [INFO ] Deduced a trap composed of 200 places in 358 ms of which 7 ms to minimize.
[2024-05-30 21:32:52] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-30 21:32:52] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 6 ms to minimize.
[2024-05-30 21:32:52] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 8 ms to minimize.
[2024-05-30 21:32:53] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 4 ms to minimize.
[2024-05-30 21:32:53] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 4 ms to minimize.
[2024-05-30 21:32:53] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:32:54] [INFO ] Deduced a trap composed of 200 places in 282 ms of which 5 ms to minimize.
[2024-05-30 21:32:54] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-30 21:32:54] [INFO ] Deduced a trap composed of 200 places in 337 ms of which 5 ms to minimize.
[2024-05-30 21:32:55] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-30 21:32:55] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 4 ms to minimize.
[2024-05-30 21:32:55] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-30 21:32:55] [INFO ] Deduced a trap composed of 200 places in 332 ms of which 4 ms to minimize.
[2024-05-30 21:32:56] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 4 ms to minimize.
[2024-05-30 21:32:56] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-05-30 21:32:56] [INFO ] Deduced a trap composed of 200 places in 326 ms of which 4 ms to minimize.
[2024-05-30 21:32:57] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-30 21:32:57] [INFO ] Deduced a trap composed of 200 places in 280 ms of which 5 ms to minimize.
[2024-05-30 21:32:57] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:33:01] [INFO ] Deduced a trap composed of 345 places in 329 ms of which 5 ms to minimize.
[2024-05-30 21:33:01] [INFO ] Deduced a trap composed of 335 places in 301 ms of which 6 ms to minimize.
[2024-05-30 21:33:01] [INFO ] Deduced a trap composed of 246 places in 309 ms of which 6 ms to minimize.
[2024-05-30 21:33:02] [INFO ] Deduced a trap composed of 239 places in 289 ms of which 5 ms to minimize.
[2024-05-30 21:33:02] [INFO ] Deduced a trap composed of 246 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:33:02] [INFO ] Deduced a trap composed of 245 places in 290 ms of which 5 ms to minimize.
[2024-05-30 21:33:03] [INFO ] Deduced a trap composed of 248 places in 300 ms of which 4 ms to minimize.
[2024-05-30 21:33:03] [INFO ] Deduced a trap composed of 258 places in 313 ms of which 4 ms to minimize.
[2024-05-30 21:33:03] [INFO ] Deduced a trap composed of 239 places in 334 ms of which 4 ms to minimize.
[2024-05-30 21:33:04] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 4 ms to minimize.
[2024-05-30 21:33:04] [INFO ] Deduced a trap composed of 248 places in 294 ms of which 4 ms to minimize.
[2024-05-30 21:33:04] [INFO ] Deduced a trap composed of 306 places in 281 ms of which 5 ms to minimize.
[2024-05-30 21:33:05] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 4 ms to minimize.
[2024-05-30 21:33:05] [INFO ] Deduced a trap composed of 242 places in 269 ms of which 5 ms to minimize.
[2024-05-30 21:33:05] [INFO ] Deduced a trap composed of 251 places in 288 ms of which 4 ms to minimize.
[2024-05-30 21:33:06] [INFO ] Deduced a trap composed of 248 places in 333 ms of which 5 ms to minimize.
[2024-05-30 21:33:06] [INFO ] Deduced a trap composed of 236 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:33:06] [INFO ] Deduced a trap composed of 234 places in 351 ms of which 5 ms to minimize.
[2024-05-30 21:33:07] [INFO ] Deduced a trap composed of 242 places in 377 ms of which 5 ms to minimize.
[2024-05-30 21:33:07] [INFO ] Deduced a trap composed of 251 places in 391 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:33:12] [INFO ] Deduced a trap composed of 196 places in 367 ms of which 5 ms to minimize.
[2024-05-30 21:33:13] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-30 21:33:13] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 5 ms to minimize.
[2024-05-30 21:33:13] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 6 ms to minimize.
[2024-05-30 21:33:14] [INFO ] Deduced a trap composed of 196 places in 352 ms of which 6 ms to minimize.
[2024-05-30 21:33:14] [INFO ] Deduced a trap composed of 196 places in 375 ms of which 5 ms to minimize.
[2024-05-30 21:33:15] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 6 ms to minimize.
[2024-05-30 21:33:15] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-05-30 21:33:15] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-05-30 21:33:16] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-30 21:33:16] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-05-30 21:33:16] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 5 ms to minimize.
[2024-05-30 21:33:17] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
SMT process timed out in 62654ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71147 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 400000 steps (20814 resets) in 2693 ms. (148 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-30 21:33:18] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:33:18] [INFO ] Invariant cache hit.
[2024-05-30 21:33:18] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-05-30 21:33:18] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-30 21:33:18] [INFO ] After 390ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-30 21:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:33:18] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:33:18] [INFO ] After 61ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:33:18] [INFO ] After 653ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:33:18] [INFO ] [Nat]Absence check using 130 positive place invariants in 40 ms returned sat
[2024-05-30 21:33:18] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 42 ms returned sat
[2024-05-30 21:33:19] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 21:33:19] [INFO ] After 130ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:33:20] [INFO ] Deduced a trap composed of 156 places in 399 ms of which 5 ms to minimize.
[2024-05-30 21:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 575 ms
TRAPS : Iteration 1
[2024-05-30 21:33:20] [INFO ] After 807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:33:20] [INFO ] After 1610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (2097 resets) in 488 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (140 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 344035 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 344035 steps, saw 104656 distinct states, run finished after 3002 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-30 21:33:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:33:23] [INFO ] Invariant cache hit.
[2024-05-30 21:33:23] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:33:25] [INFO ] Deduced a trap composed of 242 places in 369 ms of which 5 ms to minimize.
[2024-05-30 21:33:25] [INFO ] Deduced a trap composed of 245 places in 356 ms of which 5 ms to minimize.
[2024-05-30 21:33:26] [INFO ] Deduced a trap composed of 233 places in 362 ms of which 5 ms to minimize.
[2024-05-30 21:33:26] [INFO ] Deduced a trap composed of 245 places in 332 ms of which 5 ms to minimize.
[2024-05-30 21:33:27] [INFO ] Deduced a trap composed of 230 places in 385 ms of which 5 ms to minimize.
[2024-05-30 21:33:27] [INFO ] Deduced a trap composed of 242 places in 360 ms of which 5 ms to minimize.
[2024-05-30 21:33:28] [INFO ] Deduced a trap composed of 251 places in 344 ms of which 6 ms to minimize.
[2024-05-30 21:33:28] [INFO ] Deduced a trap composed of 251 places in 307 ms of which 5 ms to minimize.
[2024-05-30 21:33:28] [INFO ] Deduced a trap composed of 237 places in 332 ms of which 5 ms to minimize.
[2024-05-30 21:33:29] [INFO ] Deduced a trap composed of 239 places in 337 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1868/1869 variables, and 917 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 769/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 5866ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 50 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-30 21:33:29] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:33:29] [INFO ] Invariant cache hit.
[2024-05-30 21:33:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:33:44] [INFO ] Deduced a trap composed of 245 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:33:44] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-30 21:33:44] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 4 ms to minimize.
[2024-05-30 21:33:45] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
[2024-05-30 21:33:45] [INFO ] Deduced a trap composed of 230 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:33:45] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 4 ms to minimize.
[2024-05-30 21:33:46] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-30 21:33:46] [INFO ] Deduced a trap composed of 245 places in 309 ms of which 5 ms to minimize.
[2024-05-30 21:33:47] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-30 21:33:47] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-30 21:33:47] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-30 21:33:48] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 6 ms to minimize.
[2024-05-30 21:33:48] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 5 ms to minimize.
[2024-05-30 21:33:48] [INFO ] Deduced a trap composed of 254 places in 326 ms of which 5 ms to minimize.
[2024-05-30 21:33:49] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-30 21:33:49] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 4 ms to minimize.
[2024-05-30 21:33:49] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 3 ms to minimize.
[2024-05-30 21:33:50] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 4 ms to minimize.
[2024-05-30 21:33:50] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:33:50] [INFO ] Deduced a trap composed of 242 places in 308 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:33:51] [INFO ] Deduced a trap composed of 254 places in 290 ms of which 5 ms to minimize.
[2024-05-30 21:33:52] [INFO ] Deduced a trap composed of 245 places in 310 ms of which 8 ms to minimize.
SMT process timed out in 22650ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22726 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40002 steps (2047 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (140 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 365153 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 365153 steps, saw 111079 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-30 21:33:55] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:33:55] [INFO ] Invariant cache hit.
[2024-05-30 21:33:55] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 242 places in 381 ms of which 5 ms to minimize.
[2024-05-30 21:33:57] [INFO ] Deduced a trap composed of 245 places in 322 ms of which 6 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 233 places in 332 ms of which 6 ms to minimize.
[2024-05-30 21:33:58] [INFO ] Deduced a trap composed of 245 places in 333 ms of which 5 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 230 places in 357 ms of which 5 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:33:59] [INFO ] Deduced a trap composed of 251 places in 359 ms of which 7 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 251 places in 375 ms of which 6 ms to minimize.
[2024-05-30 21:34:00] [INFO ] Deduced a trap composed of 237 places in 353 ms of which 5 ms to minimize.
[2024-05-30 21:34:01] [INFO ] Deduced a trap composed of 239 places in 345 ms of which 5 ms to minimize.
[2024-05-30 21:34:01] [INFO ] Deduced a trap composed of 263 places in 346 ms of which 5 ms to minimize.
[2024-05-30 21:34:01] [INFO ] Deduced a trap composed of 239 places in 312 ms of which 5 ms to minimize.
[2024-05-30 21:34:02] [INFO ] Deduced a trap composed of 233 places in 300 ms of which 5 ms to minimize.
[2024-05-30 21:34:02] [INFO ] Deduced a trap composed of 236 places in 346 ms of which 5 ms to minimize.
[2024-05-30 21:34:03] [INFO ] Deduced a trap composed of 224 places in 343 ms of which 5 ms to minimize.
[2024-05-30 21:34:03] [INFO ] Deduced a trap composed of 248 places in 325 ms of which 6 ms to minimize.
[2024-05-30 21:34:04] [INFO ] Deduced a trap composed of 230 places in 342 ms of which 5 ms to minimize.
[2024-05-30 21:34:04] [INFO ] Deduced a trap composed of 239 places in 359 ms of which 5 ms to minimize.
[2024-05-30 21:34:05] [INFO ] Deduced a trap composed of 239 places in 334 ms of which 5 ms to minimize.
[2024-05-30 21:34:05] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 20/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:06] [INFO ] Deduced a trap composed of 224 places in 330 ms of which 6 ms to minimize.
[2024-05-30 21:34:06] [INFO ] Deduced a trap composed of 239 places in 346 ms of which 5 ms to minimize.
[2024-05-30 21:34:07] [INFO ] Deduced a trap composed of 233 places in 367 ms of which 5 ms to minimize.
[2024-05-30 21:34:08] [INFO ] Deduced a trap composed of 230 places in 378 ms of which 6 ms to minimize.
[2024-05-30 21:34:08] [INFO ] Deduced a trap composed of 254 places in 335 ms of which 5 ms to minimize.
[2024-05-30 21:34:09] [INFO ] Deduced a trap composed of 246 places in 335 ms of which 5 ms to minimize.
[2024-05-30 21:34:09] [INFO ] Deduced a trap composed of 233 places in 311 ms of which 5 ms to minimize.
[2024-05-30 21:34:10] [INFO ] Deduced a trap composed of 264 places in 313 ms of which 5 ms to minimize.
[2024-05-30 21:34:10] [INFO ] Deduced a trap composed of 239 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:34:11] [INFO ] Deduced a trap composed of 233 places in 321 ms of which 5 ms to minimize.
[2024-05-30 21:34:11] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 7 ms to minimize.
[2024-05-30 21:34:12] [INFO ] Deduced a trap composed of 239 places in 328 ms of which 5 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 233 places in 288 ms of which 5 ms to minimize.
[2024-05-30 21:34:14] [INFO ] Deduced a trap composed of 251 places in 316 ms of which 4 ms to minimize.
[2024-05-30 21:34:15] [INFO ] Deduced a trap composed of 233 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 230 places in 357 ms of which 5 ms to minimize.
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 239 places in 361 ms of which 6 ms to minimize.
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 5 ms to minimize.
[2024-05-30 21:34:17] [INFO ] Deduced a trap composed of 245 places in 350 ms of which 6 ms to minimize.
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 246 places in 354 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1868 variables, 20/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 21:34:18] [INFO ] Deduced a trap composed of 239 places in 324 ms of which 5 ms to minimize.
[2024-05-30 21:34:19] [INFO ] Deduced a trap composed of 248 places in 355 ms of which 5 ms to minimize.
[2024-05-30 21:34:20] [INFO ] Deduced a trap composed of 233 places in 374 ms of which 5 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 258 places in 346 ms of which 5 ms to minimize.
[2024-05-30 21:34:21] [INFO ] Deduced a trap composed of 263 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 242 places in 329 ms of which 5 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 239 places in 330 ms of which 5 ms to minimize.
[2024-05-30 21:34:22] [INFO ] Deduced a trap composed of 257 places in 354 ms of which 5 ms to minimize.
[2024-05-30 21:34:23] [INFO ] Deduced a trap composed of 239 places in 347 ms of which 6 ms to minimize.
[2024-05-30 21:34:23] [INFO ] Deduced a trap composed of 239 places in 331 ms of which 6 ms to minimize.
[2024-05-30 21:34:26] [INFO ] Deduced a trap composed of 248 places in 360 ms of which 5 ms to minimize.
[2024-05-30 21:34:27] [INFO ] Deduced a trap composed of 224 places in 360 ms of which 6 ms to minimize.
[2024-05-30 21:34:28] [INFO ] Deduced a trap composed of 254 places in 360 ms of which 5 ms to minimize.
[2024-05-30 21:34:29] [INFO ] Deduced a trap composed of 252 places in 343 ms of which 5 ms to minimize.
[2024-05-30 21:34:29] [INFO ] Deduced a trap composed of 251 places in 293 ms of which 5 ms to minimize.
[2024-05-30 21:34:30] [INFO ] Deduced a trap composed of 236 places in 355 ms of which 5 ms to minimize.
[2024-05-30 21:34:30] [INFO ] Deduced a trap composed of 236 places in 371 ms of which 6 ms to minimize.
[2024-05-30 21:34:31] [INFO ] Deduced a trap composed of 266 places in 376 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1868/1869 variables, and 965 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40638 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 769/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 58/58 constraints]
After SMT, in 41565ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 28 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-30 21:34:36] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:34:36] [INFO ] Invariant cache hit.
[2024-05-30 21:34:37] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-05-30 21:34:37] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:34:37] [INFO ] Invariant cache hit.
[2024-05-30 21:34:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 21:34:44] [INFO ] Implicit Places using invariants and state equation in 6710 ms returned []
Implicit Place search using SMT with State Equation took 7643 ms to find 0 implicit places.
[2024-05-30 21:34:44] [INFO ] Redundant transitions in 8 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-30 21:34:44] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-30 21:34:44] [INFO ] Invariant cache hit.
[2024-05-30 21:34:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:34:58] [INFO ] Deduced a trap composed of 245 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:34:58] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 5 ms to minimize.
[2024-05-30 21:34:59] [INFO ] Deduced a trap composed of 233 places in 346 ms of which 5 ms to minimize.
[2024-05-30 21:34:59] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 5 ms to minimize.
[2024-05-30 21:34:59] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 5 ms to minimize.
[2024-05-30 21:35:00] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-30 21:35:00] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-05-30 21:35:01] [INFO ] Deduced a trap composed of 245 places in 324 ms of which 5 ms to minimize.
[2024-05-30 21:35:01] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-05-30 21:35:01] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-05-30 21:35:02] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 5 ms to minimize.
[2024-05-30 21:35:02] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 6 ms to minimize.
[2024-05-30 21:35:02] [INFO ] Deduced a trap composed of 196 places in 346 ms of which 6 ms to minimize.
[2024-05-30 21:35:03] [INFO ] Deduced a trap composed of 254 places in 323 ms of which 5 ms to minimize.
[2024-05-30 21:35:03] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-05-30 21:35:03] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-30 21:35:04] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:35:04] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 4 ms to minimize.
[2024-05-30 21:35:05] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 5 ms to minimize.
[2024-05-30 21:35:05] [INFO ] Deduced a trap composed of 242 places in 323 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:35:06] [INFO ] Deduced a trap composed of 254 places in 384 ms of which 6 ms to minimize.
[2024-05-30 21:35:06] [INFO ] Deduced a trap composed of 245 places in 288 ms of which 5 ms to minimize.
[2024-05-30 21:35:06] [INFO ] Deduced a trap composed of 248 places in 276 ms of which 4 ms to minimize.
[2024-05-30 21:35:07] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-30 21:35:07] [INFO ] Deduced a trap composed of 251 places in 305 ms of which 5 ms to minimize.
[2024-05-30 21:35:08] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 4 ms to minimize.
[2024-05-30 21:35:08] [INFO ] Deduced a trap composed of 233 places in 366 ms of which 6 ms to minimize.
[2024-05-30 21:35:09] [INFO ] Deduced a trap composed of 236 places in 358 ms of which 6 ms to minimize.
[2024-05-30 21:35:09] [INFO ] Deduced a trap composed of 196 places in 360 ms of which 6 ms to minimize.
[2024-05-30 21:35:09] [INFO ] Deduced a trap composed of 230 places in 303 ms of which 5 ms to minimize.
[2024-05-30 21:35:10] [INFO ] Deduced a trap composed of 260 places in 341 ms of which 5 ms to minimize.
[2024-05-30 21:35:10] [INFO ] Deduced a trap composed of 236 places in 339 ms of which 5 ms to minimize.
[2024-05-30 21:35:10] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-30 21:35:11] [INFO ] Deduced a trap composed of 196 places in 374 ms of which 5 ms to minimize.
[2024-05-30 21:35:11] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-30 21:35:11] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-30 21:35:12] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-30 21:35:12] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-30 21:35:12] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-30 21:35:12] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:35:22] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 4 ms to minimize.
[2024-05-30 21:35:23] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
[2024-05-30 21:35:23] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-05-30 21:35:23] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-30 21:35:24] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-30 21:35:24] [INFO ] Deduced a trap composed of 200 places in 267 ms of which 4 ms to minimize.
[2024-05-30 21:35:24] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 5 ms to minimize.
[2024-05-30 21:35:25] [INFO ] Deduced a trap composed of 200 places in 338 ms of which 5 ms to minimize.
[2024-05-30 21:35:25] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-30 21:35:25] [INFO ] Deduced a trap composed of 200 places in 229 ms of which 4 ms to minimize.
[2024-05-30 21:35:26] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 4 ms to minimize.
[2024-05-30 21:35:26] [INFO ] Deduced a trap composed of 200 places in 289 ms of which 5 ms to minimize.
[2024-05-30 21:35:26] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 5 ms to minimize.
[2024-05-30 21:35:27] [INFO ] Deduced a trap composed of 200 places in 319 ms of which 5 ms to minimize.
[2024-05-30 21:35:27] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-05-30 21:35:27] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 5 ms to minimize.
[2024-05-30 21:35:28] [INFO ] Deduced a trap composed of 200 places in 346 ms of which 5 ms to minimize.
[2024-05-30 21:35:28] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-05-30 21:35:28] [INFO ] Deduced a trap composed of 200 places in 304 ms of which 5 ms to minimize.
[2024-05-30 21:35:29] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:35:32] [INFO ] Deduced a trap composed of 345 places in 316 ms of which 5 ms to minimize.
[2024-05-30 21:35:32] [INFO ] Deduced a trap composed of 335 places in 297 ms of which 5 ms to minimize.
[2024-05-30 21:35:33] [INFO ] Deduced a trap composed of 246 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:35:33] [INFO ] Deduced a trap composed of 239 places in 258 ms of which 5 ms to minimize.
[2024-05-30 21:35:33] [INFO ] Deduced a trap composed of 246 places in 278 ms of which 5 ms to minimize.
[2024-05-30 21:35:34] [INFO ] Deduced a trap composed of 245 places in 288 ms of which 5 ms to minimize.
[2024-05-30 21:35:34] [INFO ] Deduced a trap composed of 248 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:35:34] [INFO ] Deduced a trap composed of 258 places in 321 ms of which 5 ms to minimize.
[2024-05-30 21:35:35] [INFO ] Deduced a trap composed of 239 places in 306 ms of which 5 ms to minimize.
[2024-05-30 21:35:35] [INFO ] Deduced a trap composed of 242 places in 297 ms of which 5 ms to minimize.
[2024-05-30 21:35:35] [INFO ] Deduced a trap composed of 248 places in 321 ms of which 5 ms to minimize.
[2024-05-30 21:35:36] [INFO ] Deduced a trap composed of 306 places in 303 ms of which 5 ms to minimize.
[2024-05-30 21:35:36] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 4 ms to minimize.
[2024-05-30 21:35:36] [INFO ] Deduced a trap composed of 242 places in 234 ms of which 4 ms to minimize.
[2024-05-30 21:35:36] [INFO ] Deduced a trap composed of 251 places in 285 ms of which 4 ms to minimize.
[2024-05-30 21:35:37] [INFO ] Deduced a trap composed of 248 places in 291 ms of which 5 ms to minimize.
[2024-05-30 21:35:37] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 4 ms to minimize.
[2024-05-30 21:35:37] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 4 ms to minimize.
[2024-05-30 21:35:38] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:35:38] [INFO ] Deduced a trap composed of 251 places in 387 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-30 21:35:43] [INFO ] Deduced a trap composed of 196 places in 370 ms of which 6 ms to minimize.
[2024-05-30 21:35:44] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 5 ms to minimize.
[2024-05-30 21:35:44] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-05-30 21:35:44] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:35:45] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-30 21:35:45] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-05-30 21:35:45] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-30 21:35:46] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-30 21:35:46] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-30 21:35:46] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 4 ms to minimize.
[2024-05-30 21:35:47] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 223 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 91/91 constraints]
After SMT, in 62698ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62710ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70400 ms. Remains : 770/770 places, 1103/1103 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1099
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1098
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1098
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1097
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1097
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 768 transition count 1093
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 764 transition count 1093
Applied a total of 16 rules in 184 ms. Remains 764 /770 variables (removed 6) and now considering 1093/1103 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1093 rows 764 cols
[2024-05-30 21:35:47] [INFO ] Computed 137 invariants in 43 ms
[2024-05-30 21:35:47] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2024-05-30 21:35:47] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-30 21:35:47] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 21:35:47] [INFO ] [Nat]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-05-30 21:35:47] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-30 21:35:48] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 21:35:48] [INFO ] Deduced a trap composed of 240 places in 315 ms of which 5 ms to minimize.
[2024-05-30 21:35:49] [INFO ] Deduced a trap composed of 231 places in 323 ms of which 5 ms to minimize.
[2024-05-30 21:35:49] [INFO ] Deduced a trap composed of 222 places in 307 ms of which 5 ms to minimize.
[2024-05-30 21:35:49] [INFO ] Deduced a trap composed of 255 places in 282 ms of which 4 ms to minimize.
[2024-05-30 21:35:50] [INFO ] Deduced a trap composed of 237 places in 309 ms of which 4 ms to minimize.
[2024-05-30 21:35:50] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 4 ms to minimize.
[2024-05-30 21:35:50] [INFO ] Deduced a trap composed of 231 places in 298 ms of which 5 ms to minimize.
[2024-05-30 21:35:51] [INFO ] Deduced a trap composed of 222 places in 297 ms of which 5 ms to minimize.
[2024-05-30 21:35:51] [INFO ] Deduced a trap composed of 231 places in 342 ms of which 5 ms to minimize.
[2024-05-30 21:35:52] [INFO ] Deduced a trap composed of 234 places in 331 ms of which 5 ms to minimize.
[2024-05-30 21:35:52] [INFO ] Deduced a trap composed of 231 places in 362 ms of which 6 ms to minimize.
[2024-05-30 21:35:53] [INFO ] Deduced a trap composed of 240 places in 337 ms of which 5 ms to minimize.
[2024-05-30 21:35:53] [INFO ] Deduced a trap composed of 222 places in 334 ms of which 5 ms to minimize.
[2024-05-30 21:35:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6296 ms
TRAPS : Iteration 1
[2024-05-30 21:35:54] [INFO ] After 6898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 21:35:54] [INFO ] After 7101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 7522 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 516822 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-COL-S05J60

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 48
TRANSITIONS: 38
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 8
COLOR VARS: 26
ARCS: 140
LOADING TIME: 0.226

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 969
TRANSITIONS: 2030
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 12704
UNFOLDING TIME: 0.432

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.089
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.977
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 1929
MODEL NAME: /home/mcc/execution/model
969 places, 2030 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;