About the Execution of LTSMin+red for PolyORBLF-PT-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5017.571 | 3356790.00 | 3725826.00 | 1030.70 | 1 1 1 1 1 ? ? 1 ? ? 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700237.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700237
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717252583898
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:36:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 14:36:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:36:26] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-06-01 14:36:26] [INFO ] Transformed 752 places.
[2024-06-01 14:36:26] [INFO ] Transformed 1572 transitions.
[2024-06-01 14:36:26] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 14:36:26] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-06-01 14:36:26] [INFO ] Computed 54 invariants in 164 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, 10, 3, +inf, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 132 ms. (75 steps per ms)
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90005 steps (20 resets) in 420 ms. (213 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 2, 2, 1, 0, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, 10, 3, +inf]
[2024-06-01 14:36:27] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:36:27] [INFO ] Invariant cache hit.
[2024-06-01 14:36:27] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2024-06-01 14:36:27] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned unsat
[2024-06-01 14:36:27] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-01 14:36:27] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 36 ms returned unsat
[2024-06-01 14:36:27] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-01 14:36:27] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 37 ms returned unsat
[2024-06-01 14:36:28] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 14:36:28] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 40 ms returned unsat
[2024-06-01 14:36:28] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-01 14:36:28] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 27 ms returned sat
[2024-06-01 14:36:29] [INFO ] [Real]Absence check using state equation in 1007 ms returned sat
[2024-06-01 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:36:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 14:36:29] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 20 ms returned sat
[2024-06-01 14:36:30] [INFO ] [Nat]Absence check using state equation in 1155 ms returned sat
[2024-06-01 14:36:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:36:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:36:31] [INFO ] [Nat]Added 120 Read/Feed constraints in 894 ms returned sat
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 418 places in 678 ms of which 70 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1388 ms
[2024-06-01 14:36:33] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 157 ms.
[2024-06-01 14:36:34] [INFO ] Added : 45 causal constraints over 9 iterations in 1449 ms. Result :unknown
[2024-06-01 14:36:34] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2024-06-01 14:36:34] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 171 ms returned sat
[2024-06-01 14:36:36] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2024-06-01 14:36:36] [INFO ] [Real]Added 120 Read/Feed constraints in 296 ms returned sat
[2024-06-01 14:36:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:36:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 14:36:36] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 19 ms returned sat
[2024-06-01 14:36:37] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2024-06-01 14:36:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 392 ms returned sat
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 46 places in 607 ms of which 16 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 363 places in 600 ms of which 6 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1806 ms
[2024-06-01 14:36:39] [INFO ] Computed and/alt/rep : 720/1388/710 causal constraints (skipped 680 transitions) in 123 ms.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 383 places in 395 ms of which 5 ms to minimize.
[2024-06-01 14:36:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 14:36:42] [INFO ] [Real]Absence check using 15 positive place invariants in 55 ms returned unsat
[2024-06-01 14:36:42] [INFO ] [Real]Absence check using 15 positive place invariants in 33 ms returned sat
[2024-06-01 14:36:42] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 48 ms returned sat
[2024-06-01 14:36:43] [INFO ] [Real]Absence check using state equation in 1404 ms returned sat
[2024-06-01 14:36:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:36:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 14:36:44] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2024-06-01 14:36:45] [INFO ] [Nat]Absence check using state equation in 1487 ms returned unknown
[2024-06-01 14:36:45] [INFO ] [Real]Absence check using 15 positive place invariants in 46 ms returned sat
[2024-06-01 14:36:45] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 27 ms returned sat
[2024-06-01 14:36:46] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2024-06-01 14:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:36:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2024-06-01 14:36:47] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 39 ms returned sat
[2024-06-01 14:36:48] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2024-06-01 14:36:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:36:49] [INFO ] [Nat]Added 120 Read/Feed constraints in 1032 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 2, 2, 1, 0, 2] Max Struct:[1, 1, 1, 1, +inf, +inf, 1, 3, +inf]
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
Support contains 21 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 15 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 20 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 462 place count 520 transition count 1182
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 472 place count 520 transition count 1172
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 482 place count 510 transition count 1172
Applied a total of 482 rules in 463 ms. Remains 510 /752 variables (removed 242) and now considering 1172/1412 (removed 240) transitions.
Running 1170 sub problems to find dead transitions.
[2024-06-01 14:36:50] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 510 cols
[2024-06-01 14:36:50] [INFO ] Computed 52 invariants in 104 ms
[2024-06-01 14:36:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 41 places in 691 ms of which 1 ms to minimize.
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 166 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 4 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 103 places in 303 ms of which 3 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 99 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:37:11] [INFO ] Deduced a trap composed of 73 places in 283 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/1662 variables, and 66 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20090 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
[2024-06-01 14:37:22] [INFO ] Deduced a trap composed of 211 places in 375 ms of which 3 ms to minimize.
[2024-06-01 14:37:22] [INFO ] Deduced a trap composed of 215 places in 432 ms of which 31 ms to minimize.
[2024-06-01 14:37:22] [INFO ] Deduced a trap composed of 195 places in 368 ms of which 3 ms to minimize.
[2024-06-01 14:37:23] [INFO ] Deduced a trap composed of 217 places in 443 ms of which 5 ms to minimize.
[2024-06-01 14:37:23] [INFO ] Deduced a trap composed of 179 places in 442 ms of which 31 ms to minimize.
[2024-06-01 14:37:25] [INFO ] Deduced a trap composed of 63 places in 244 ms of which 4 ms to minimize.
[2024-06-01 14:37:25] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 5 ms to minimize.
[2024-06-01 14:37:26] [INFO ] Deduced a trap composed of 109 places in 285 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/1662 variables, and 74 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/510 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 24/24 constraints]
After SMT, in 43631ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 43690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44226 ms. Remains : 510/752 places, 1172/1412 transitions.
[2024-06-01 14:37:34] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 14:38:36] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-06-01 14:38:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
RANDOM walk for 1000000 steps (309 resets) in 6251 ms. (159 steps per ms)
BEST_FIRST walk for 4000001 steps (491 resets) in 10652 ms. (375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
[2024-06-01 14:38:53] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-06-01 14:38:53] [INFO ] Invariant cache hit.
[2024-06-01 14:38:53] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:38:53] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 21 ms returned sat
[2024-06-01 14:38:54] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-06-01 14:38:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:38:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:38:54] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 25 ms returned sat
[2024-06-01 14:38:55] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2024-06-01 14:38:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:38:55] [INFO ] [Nat]Added 120 Read/Feed constraints in 325 ms returned sat
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 44 places in 589 ms of which 32 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 193 places in 573 ms of which 33 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1425 ms
[2024-06-01 14:38:57] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 105 ms.
[2024-06-01 14:38:58] [INFO ] Added : 42 causal constraints over 9 iterations in 1564 ms. Result :sat
Minimization took 3718 ms.
[2024-06-01 14:39:02] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-06-01 14:39:02] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 31 ms returned sat
[2024-06-01 14:39:03] [INFO ] [Real]Absence check using state equation in 1005 ms returned sat
[2024-06-01 14:39:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:39:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2024-06-01 14:39:04] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 42 ms returned sat
[2024-06-01 14:39:05] [INFO ] [Nat]Absence check using state equation in 1303 ms returned sat
[2024-06-01 14:39:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 198 ms returned sat
[2024-06-01 14:39:05] [INFO ] Deduced a trap composed of 60 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:39:06] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:39:07] [INFO ] Deduced a trap composed of 201 places in 397 ms of which 6 ms to minimize.
[2024-06-01 14:39:08] [INFO ] Deduced a trap composed of 248 places in 586 ms of which 22 ms to minimize.
[2024-06-01 14:39:08] [INFO ] Deduced a trap composed of 194 places in 379 ms of which 3 ms to minimize.
[2024-06-01 14:39:09] [INFO ] Deduced a trap composed of 194 places in 421 ms of which 6 ms to minimize.
[2024-06-01 14:39:09] [INFO ] Deduced a trap composed of 218 places in 346 ms of which 4 ms to minimize.
[2024-06-01 14:39:10] [INFO ] Deduced a trap composed of 187 places in 397 ms of which 4 ms to minimize.
[2024-06-01 14:39:10] [INFO ] Deduced a trap composed of 201 places in 396 ms of which 4 ms to minimize.
[2024-06-01 14:39:11] [INFO ] Deduced a trap composed of 165 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:39:12] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 3 ms to minimize.
[2024-06-01 14:39:13] [INFO ] Deduced a trap composed of 213 places in 482 ms of which 18 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Deduced a trap composed of 204 places in 483 ms of which 6 ms to minimize.
[2024-06-01 14:39:14] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8947 ms
[2024-06-01 14:39:14] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 144 ms.
[2024-06-01 14:39:16] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:39:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2024-06-01 14:39:16] [INFO ] Added : 90 causal constraints over 18 iterations in 2317 ms. Result :sat
Minimization took 4505 ms.
[2024-06-01 14:39:21] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2024-06-01 14:39:21] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 48 ms returned sat
[2024-06-01 14:39:22] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2024-06-01 14:39:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:39:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-06-01 14:39:22] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 17 ms returned sat
[2024-06-01 14:39:31] [INFO ] [Nat]Absence check using state equation in 8185 ms returned sat
[2024-06-01 14:39:31] [INFO ] [Nat]Added 120 Read/Feed constraints in 716 ms returned sat
[2024-06-01 14:39:32] [INFO ] Deduced a trap composed of 220 places in 365 ms of which 4 ms to minimize.
[2024-06-01 14:39:32] [INFO ] Deduced a trap composed of 170 places in 395 ms of which 3 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 41 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:39:33] [INFO ] Deduced a trap composed of 62 places in 371 ms of which 3 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 6 ms to minimize.
[2024-06-01 14:39:36] [INFO ] Deduced a trap composed of 225 places in 366 ms of which 5 ms to minimize.
[2024-06-01 14:39:37] [INFO ] Deduced a trap composed of 231 places in 324 ms of which 4 ms to minimize.
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 200 places in 393 ms of which 19 ms to minimize.
[2024-06-01 14:39:38] [INFO ] Deduced a trap composed of 192 places in 371 ms of which 3 ms to minimize.
[2024-06-01 14:39:39] [INFO ] Deduced a trap composed of 42 places in 369 ms of which 4 ms to minimize.
[2024-06-01 14:39:44] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 12351 ms
[2024-06-01 14:39:44] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2024-06-01 14:39:44] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 25 ms returned sat
[2024-06-01 14:39:45] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2024-06-01 14:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:39:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-06-01 14:39:45] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 26 ms returned sat
[2024-06-01 14:39:46] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2024-06-01 14:39:46] [INFO ] [Nat]Added 120 Read/Feed constraints in 312 ms returned sat
[2024-06-01 14:39:46] [INFO ] Deduced a trap composed of 40 places in 399 ms of which 5 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 15 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 955 ms
[2024-06-01 14:39:47] [INFO ] Computed and/alt/rep : 480/1048/470 causal constraints (skipped 680 transitions) in 93 ms.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 183 places in 389 ms of which 4 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 236 places in 453 ms of which 4 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 182 places in 473 ms of which 7 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1827 ms
[2024-06-01 14:39:50] [INFO ] Added : 43 causal constraints over 10 iterations in 3329 ms. Result :sat
Minimization took 4501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
Support contains 21 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 70 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 510/510 places, 1172/1172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 1172/1172 transitions.
Applied a total of 0 rules in 51 ms. Remains 510 /510 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
[2024-06-01 14:39:56] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2024-06-01 14:39:56] [INFO ] Invariant cache hit.
[2024-06-01 14:39:57] [INFO ] Implicit Places using invariants in 1062 ms returned [3, 61, 125, 178, 260, 290, 351, 385, 393, 455]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1081 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/510 places, 1172/1172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 491 transition count 1163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 491 transition count 1163
Applied a total of 18 rules in 49 ms. Remains 491 /500 variables (removed 9) and now considering 1163/1172 (removed 9) transitions.
[2024-06-01 14:39:57] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 491 cols
[2024-06-01 14:39:57] [INFO ] Computed 42 invariants in 15 ms
[2024-06-01 14:39:57] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-06-01 14:39:57] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:39:57] [INFO ] Invariant cache hit.
[2024-06-01 14:39:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:40:09] [INFO ] Implicit Places using invariants and state equation in 11771 ms returned []
Implicit Place search using SMT with State Equation took 12345 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 491/510 places, 1163/1172 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13533 ms. Remains : 491/510 places, 1163/1172 transitions.
[2024-06-01 14:40:09] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 14:41:07] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:41:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
RANDOM walk for 1000000 steps (309 resets) in 5521 ms. (181 steps per ms)
BEST_FIRST walk for 4000002 steps (479 resets) in 10742 ms. (372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
[2024-06-01 14:41:23] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:41:23] [INFO ] Invariant cache hit.
[2024-06-01 14:41:24] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-06-01 14:41:24] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 74 ms returned sat
[2024-06-01 14:41:25] [INFO ] [Real]Absence check using state equation in 1505 ms returned sat
[2024-06-01 14:41:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:41:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 14:41:25] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 25 ms returned sat
[2024-06-01 14:41:26] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2024-06-01 14:41:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:41:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 414 ms returned sat
[2024-06-01 14:41:27] [INFO ] Deduced a trap composed of 23 places in 595 ms of which 31 ms to minimize.
[2024-06-01 14:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 777 ms
[2024-06-01 14:41:28] [INFO ] Computed and/alt/rep : 471/1030/461 causal constraints (skipped 680 transitions) in 163 ms.
[2024-06-01 14:41:29] [INFO ] Added : 38 causal constraints over 8 iterations in 1239 ms. Result :sat
Minimization took 4501 ms.
[2024-06-01 14:41:33] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 14:41:33] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 32 ms returned sat
[2024-06-01 14:41:34] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2024-06-01 14:41:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:41:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:41:34] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 49 ms returned sat
[2024-06-01 14:41:36] [INFO ] [Nat]Absence check using state equation in 1392 ms returned sat
[2024-06-01 14:41:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 272 ms returned sat
[2024-06-01 14:41:36] [INFO ] Computed and/alt/rep : 471/1030/461 causal constraints (skipped 680 transitions) in 98 ms.
[2024-06-01 14:41:37] [INFO ] Added : 20 causal constraints over 5 iterations in 465 ms. Result :sat
Minimization took 4501 ms.
[2024-06-01 14:41:41] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 14:41:41] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 32 ms returned sat
[2024-06-01 14:41:42] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2024-06-01 14:41:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:41:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 14:41:42] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 46 ms returned sat
[2024-06-01 14:41:45] [INFO ] [Nat]Absence check using state equation in 2486 ms returned sat
[2024-06-01 14:41:45] [INFO ] [Nat]Added 120 Read/Feed constraints in 453 ms returned sat
[2024-06-01 14:41:46] [INFO ] Computed and/alt/rep : 471/1030/461 causal constraints (skipped 680 transitions) in 94 ms.
[2024-06-01 14:41:46] [INFO ] Added : 32 causal constraints over 7 iterations in 702 ms. Result :sat
Minimization took 4501 ms.
[2024-06-01 14:41:51] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2024-06-01 14:41:51] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 79 ms returned sat
[2024-06-01 14:41:52] [INFO ] [Real]Absence check using state equation in 970 ms returned sat
[2024-06-01 14:41:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:41:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 14:41:52] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 29 ms returned sat
[2024-06-01 14:41:53] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2024-06-01 14:41:54] [INFO ] [Nat]Added 120 Read/Feed constraints in 725 ms returned sat
[2024-06-01 14:41:54] [INFO ] Deduced a trap composed of 60 places in 560 ms of which 32 ms to minimize.
[2024-06-01 14:41:55] [INFO ] Deduced a trap composed of 212 places in 590 ms of which 32 ms to minimize.
[2024-06-01 14:41:55] [INFO ] Deduced a trap composed of 202 places in 459 ms of which 6 ms to minimize.
[2024-06-01 14:41:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1866 ms
[2024-06-01 14:41:56] [INFO ] Computed and/alt/rep : 471/1030/461 causal constraints (skipped 680 transitions) in 79 ms.
[2024-06-01 14:41:56] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-06-01 14:41:57] [INFO ] Added : 45 causal constraints over 10 iterations in 1095 ms. Result :sat
Minimization took 4510 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
Support contains 21 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Applied a total of 0 rules in 36 ms. Remains 491 /491 variables (removed 0) and now considering 1163/1163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 491/491 places, 1163/1163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Applied a total of 0 rules in 32 ms. Remains 491 /491 variables (removed 0) and now considering 1163/1163 (removed 0) transitions.
[2024-06-01 14:42:01] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:42:01] [INFO ] Invariant cache hit.
[2024-06-01 14:42:06] [INFO ] Implicit Places using invariants in 4858 ms returned []
[2024-06-01 14:42:06] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:42:06] [INFO ] Invariant cache hit.
[2024-06-01 14:42:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:42:16] [INFO ] Implicit Places using invariants and state equation in 10252 ms returned []
Implicit Place search using SMT with State Equation took 15115 ms to find 0 implicit places.
[2024-06-01 14:42:16] [INFO ] Redundant transitions in 75 ms returned []
Running 1161 sub problems to find dead transitions.
[2024-06-01 14:42:16] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:42:16] [INFO ] Invariant cache hit.
[2024-06-01 14:42:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:42:27] [INFO ] Deduced a trap composed of 187 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 199 places in 329 ms of which 5 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 166 places in 340 ms of which 5 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:42:28] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:42:29] [INFO ] Deduced a trap composed of 130 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:42:29] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:42:30] [INFO ] Deduced a trap composed of 101 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:42:34] [INFO ] Deduced a trap composed of 209 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:42:36] [INFO ] Deduced a trap composed of 325 places in 403 ms of which 7 ms to minimize.
[2024-06-01 14:42:40] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:42:41] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:42:42] [INFO ] Deduced a trap composed of 207 places in 408 ms of which 6 ms to minimize.
[2024-06-01 14:42:43] [INFO ] Deduced a trap composed of 185 places in 349 ms of which 7 ms to minimize.
[2024-06-01 14:42:47] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/1634 variables, and 62 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/491 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1161/1161 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:43:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 303 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:43:12] [INFO ] Deduced a trap composed of 330 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:43:13] [INFO ] Deduced a trap composed of 331 places in 290 ms of which 2 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 321 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:43:16] [INFO ] Deduced a trap composed of 331 places in 295 ms of which 3 ms to minimize.
[2024-06-01 14:43:19] [INFO ] Deduced a trap composed of 301 places in 313 ms of which 4 ms to minimize.
SMT process timed out in 62479ms, After SMT, problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 62494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77740 ms. Remains : 491/491 places, 1163/1163 transitions.
[2024-06-01 14:43:19] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (12 resets) in 2475 ms. (16 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 387 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 368 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 268 ms. (148 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 60212 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 5
Probabilistic random walk after 60212 steps, saw 39335 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
[2024-06-01 14:44:20] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:44:20] [INFO ] Invariant cache hit.
[2024-06-01 14:44:20] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 440/461 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:44:21] [INFO ] Deduced a trap composed of 220 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:44:21] [INFO ] Deduced a trap composed of 239 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:44:21] [INFO ] Deduced a trap composed of 242 places in 282 ms of which 3 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 2 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:44:22] [INFO ] Deduced a trap composed of 235 places in 300 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/472 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 17/489 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 4 ms to minimize.
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2024-06-01 14:44:23] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:44:24] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:44:24] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:44:24] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1143/1632 variables, 489/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 5050ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Applied a total of 0 rules in 24 ms. Remains 491 /491 variables (removed 0) and now considering 1163/1163 (removed 0) transitions.
Running 1161 sub problems to find dead transitions.
[2024-06-01 14:44:25] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:44:25] [INFO ] Invariant cache hit.
[2024-06-01 14:44:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 3 ms to minimize.
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:44:36] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:44:37] [INFO ] Deduced a trap composed of 187 places in 310 ms of which 3 ms to minimize.
[2024-06-01 14:44:37] [INFO ] Deduced a trap composed of 199 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:44:37] [INFO ] Deduced a trap composed of 166 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:44:37] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:44:38] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:44:38] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:44:38] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 2 ms to minimize.
[2024-06-01 14:44:38] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:44:39] [INFO ] Deduced a trap composed of 101 places in 521 ms of which 20 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 209 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:44:45] [INFO ] Deduced a trap composed of 325 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:44:47] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/1634 variables, and 59 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/491 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1161/1161 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/1634 variables, and 59 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/491 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1161 constraints, Known Traps: 20/20 constraints]
After SMT, in 42590ms problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 42621ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42662 ms. Remains : 491/491 places, 1163/1163 transitions.
RANDOM walk for 40001 steps (15 resets) in 721 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 356 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (9 resets) in 424 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (9 resets) in 243 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 104147 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 5
Probabilistic random walk after 104147 steps, saw 66839 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-01 14:45:12] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:45:12] [INFO ] Invariant cache hit.
[2024-06-01 14:45:12] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 440/461 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:45:12] [INFO ] Deduced a trap composed of 220 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:45:12] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 2 ms to minimize.
[2024-06-01 14:45:13] [INFO ] Deduced a trap composed of 242 places in 289 ms of which 3 ms to minimize.
[2024-06-01 14:45:13] [INFO ] Deduced a trap composed of 236 places in 323 ms of which 3 ms to minimize.
[2024-06-01 14:45:13] [INFO ] Deduced a trap composed of 242 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:45:14] [INFO ] Deduced a trap composed of 235 places in 289 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/472 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 17/489 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:45:14] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:45:14] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:45:14] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:45:14] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:45:15] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:45:15] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:45:15] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 3 ms to minimize.
[2024-06-01 14:45:15] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:45:15] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1143/1632 variables, 489/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1632 variables, 120/665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1632 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/1634 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1634 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1634 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1634 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 668 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6525 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 491/491 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 440/461 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 232 places in 364 ms of which 8 ms to minimize.
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 244 places in 351 ms of which 5 ms to minimize.
[2024-06-01 14:45:19] [INFO ] Deduced a trap composed of 231 places in 319 ms of which 8 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 250 places in 297 ms of which 3 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 234 places in 346 ms of which 5 ms to minimize.
[2024-06-01 14:45:20] [INFO ] Deduced a trap composed of 240 places in 330 ms of which 6 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 238 places in 347 ms of which 6 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 238 places in 330 ms of which 5 ms to minimize.
[2024-06-01 14:45:21] [INFO ] Deduced a trap composed of 227 places in 326 ms of which 7 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 6 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 242 places in 334 ms of which 6 ms to minimize.
[2024-06-01 14:45:22] [INFO ] Deduced a trap composed of 228 places in 328 ms of which 5 ms to minimize.
[2024-06-01 14:45:23] [INFO ] Deduced a trap composed of 248 places in 328 ms of which 5 ms to minimize.
[2024-06-01 14:45:23] [INFO ] Deduced a trap composed of 237 places in 317 ms of which 6 ms to minimize.
[2024-06-01 14:45:23] [INFO ] Deduced a trap composed of 222 places in 313 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/472 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 17/489 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:45:24] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1143/1632 variables, 489/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1632 variables, 120/681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1632 variables, 5/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1632 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/1634 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1634 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1634 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1634/1634 variables, and 689 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 491/491 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 31/31 constraints]
After SMT, in 51582ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Applied a total of 0 rules in 23 ms. Remains 491 /491 variables (removed 0) and now considering 1163/1163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 491/491 places, 1163/1163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Applied a total of 0 rules in 42 ms. Remains 491 /491 variables (removed 0) and now considering 1163/1163 (removed 0) transitions.
[2024-06-01 14:46:03] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:46:03] [INFO ] Invariant cache hit.
[2024-06-01 14:46:04] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-06-01 14:46:04] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:46:04] [INFO ] Invariant cache hit.
[2024-06-01 14:46:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:46:14] [INFO ] Implicit Places using invariants and state equation in 10406 ms returned []
Implicit Place search using SMT with State Equation took 11208 ms to find 0 implicit places.
[2024-06-01 14:46:14] [INFO ] Redundant transitions in 30 ms returned []
Running 1161 sub problems to find dead transitions.
[2024-06-01 14:46:14] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:46:14] [INFO ] Invariant cache hit.
[2024-06-01 14:46:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:46:25] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:46:25] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:46:26] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:46:26] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:46:26] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:46:26] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:46:26] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:46:26] [INFO ] Deduced a trap composed of 187 places in 390 ms of which 6 ms to minimize.
[2024-06-01 14:46:27] [INFO ] Deduced a trap composed of 199 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:46:27] [INFO ] Deduced a trap composed of 166 places in 291 ms of which 3 ms to minimize.
[2024-06-01 14:46:27] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2024-06-01 14:46:27] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:46:27] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 130 places in 211 ms of which 2 ms to minimize.
[2024-06-01 14:46:28] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:46:29] [INFO ] Deduced a trap composed of 101 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:46:33] [INFO ] Deduced a trap composed of 209 places in 347 ms of which 4 ms to minimize.
[2024-06-01 14:46:35] [INFO ] Deduced a trap composed of 325 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:46:36] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:46:37] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
[2024-06-01 14:46:38] [INFO ] Deduced a trap composed of 207 places in 407 ms of which 7 ms to minimize.
[2024-06-01 14:46:38] [INFO ] Deduced a trap composed of 185 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:46:43] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:46:46] [INFO ] Deduced a trap composed of 301 places in 313 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/1634 variables, and 63 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/491 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1161/1161 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 24/63 constraints. Problems are: Problem set: 0 solved, 1161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/1634 variables, and 63 constraints, problems are : Problem set: 0 solved, 1161 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/491 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1161 constraints, Known Traps: 24/24 constraints]
After SMT, in 62955ms problems are : Problem set: 0 solved, 1161 unsolved
Search for dead transitions found 0 dead transitions in 62971ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74265 ms. Remains : 491/491 places, 1163/1163 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 2, 0, 2] Max Struct:[+inf, +inf, 3, +inf]
Starting property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 14:47:17] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:47:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (3 resets) in 93 ms. (106 steps per ms)
BEST_FIRST walk for 10001 steps (7 resets) in 32 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 14:47:18] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 14:47:18] [INFO ] Invariant cache hit.
[2024-06-01 14:47:18] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:18] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 29 ms returned sat
[2024-06-01 14:47:19] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2024-06-01 14:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:47:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 14:47:19] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 29 ms returned sat
[2024-06-01 14:47:20] [INFO ] [Nat]Absence check using state equation in 1073 ms returned sat
[2024-06-01 14:47:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:47:21] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 14:47:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 779 ms returned sat
[2024-06-01 14:47:21] [INFO ] Deduced a trap composed of 43 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Deduced a trap composed of 231 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 976 ms
[2024-06-01 14:47:22] [INFO ] Computed and/alt/rep : 471/1030/461 causal constraints (skipped 680 transitions) in 105 ms.
[2024-06-01 14:47:23] [INFO ] Added : 38 causal constraints over 8 iterations in 1015 ms. Result :sat
Minimization took 561 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 481 transition count 1153
Applied a total of 20 rules in 50 ms. Remains 481 /491 variables (removed 10) and now considering 1153/1163 (removed 10) transitions.
Running 1151 sub problems to find dead transitions.
[2024-06-01 14:47:24] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
// Phase 1: matrix 1133 rows 481 cols
[2024-06-01 14:47:24] [INFO ] Computed 42 invariants in 35 ms
[2024-06-01 14:47:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 14:47:39] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:47:39] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:47:39] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:47:39] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:47:39] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:47:39] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:47:39] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:47:40] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:47:40] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:47:40] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:47:40] [INFO ] Deduced a trap composed of 183 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:47:40] [INFO ] Deduced a trap composed of 178 places in 307 ms of which 4 ms to minimize.
[2024-06-01 14:47:41] [INFO ] Deduced a trap composed of 198 places in 267 ms of which 3 ms to minimize.
[2024-06-01 14:47:41] [INFO ] Deduced a trap composed of 177 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:47:41] [INFO ] Deduced a trap composed of 183 places in 279 ms of which 3 ms to minimize.
[2024-06-01 14:47:42] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:47:43] [INFO ] Deduced a trap composed of 223 places in 298 ms of which 6 ms to minimize.
[2024-06-01 14:47:47] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
SMT process timed out in 23021ms, After SMT, problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 23045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23097 ms. Remains : 481/491 places, 1153/1163 transitions.
[2024-06-01 14:47:47] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 14:56:45] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 14:56:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (311 resets) in 5435 ms. (183 steps per ms)
BEST_FIRST walk for 1000000 steps (110 resets) in 2325 ms. (429 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 14:56:53] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 14:56:53] [INFO ] Invariant cache hit.
[2024-06-01 14:56:53] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 14:56:53] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 28 ms returned sat
[2024-06-01 14:56:54] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2024-06-01 14:56:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:56:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-01 14:56:55] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 52 ms returned sat
[2024-06-01 14:56:56] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2024-06-01 14:56:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:56:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 249 ms returned sat
[2024-06-01 14:56:57] [INFO ] Deduced a trap composed of 60 places in 414 ms of which 6 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 230 places in 528 ms of which 33 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 238 places in 352 ms of which 3 ms to minimize.
[2024-06-01 14:56:58] [INFO ] Deduced a trap composed of 200 places in 370 ms of which 4 ms to minimize.
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 184 places in 360 ms of which 3 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3294 ms
[2024-06-01 14:57:00] [INFO ] Computed and/alt/rep : 371/820/361 causal constraints (skipped 770 transitions) in 83 ms.
[2024-06-01 14:57:00] [INFO ] Added : 26 causal constraints over 6 iterations in 532 ms. Result :sat
Minimization took 5101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 17 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 481/481 places, 1153/1153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 16 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
[2024-06-01 14:57:05] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 14:57:05] [INFO ] Invariant cache hit.
[2024-06-01 14:57:06] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-06-01 14:57:06] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 14:57:06] [INFO ] Invariant cache hit.
[2024-06-01 14:57:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:57:17] [INFO ] Implicit Places using invariants and state equation in 10816 ms returned []
Implicit Place search using SMT with State Equation took 11630 ms to find 0 implicit places.
[2024-06-01 14:57:17] [INFO ] Redundant transitions in 20 ms returned []
Running 1151 sub problems to find dead transitions.
[2024-06-01 14:57:17] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 14:57:17] [INFO ] Invariant cache hit.
[2024-06-01 14:57:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:57:29] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:57:30] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 78 places in 326 ms of which 3 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 110 places in 343 ms of which 3 ms to minimize.
[2024-06-01 14:57:31] [INFO ] Deduced a trap composed of 229 places in 278 ms of which 3 ms to minimize.
[2024-06-01 14:57:32] [INFO ] Deduced a trap composed of 318 places in 358 ms of which 3 ms to minimize.
[2024-06-01 14:57:32] [INFO ] Deduced a trap composed of 317 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:57:33] [INFO ] Deduced a trap composed of 183 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 291 places in 344 ms of which 5 ms to minimize.
[2024-06-01 14:57:35] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 5 ms to minimize.
[2024-06-01 14:57:36] [INFO ] Deduced a trap composed of 166 places in 350 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 14:57:37] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 229 places in 295 ms of which 5 ms to minimize.
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 200 places in 351 ms of which 4 ms to minimize.
[2024-06-01 14:57:38] [INFO ] Deduced a trap composed of 227 places in 280 ms of which 2 ms to minimize.
[2024-06-01 14:57:39] [INFO ] Deduced a trap composed of 195 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:57:47] [INFO ] Deduced a trap composed of 193 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 174 places in 284 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 164 places in 286 ms of which 4 ms to minimize.
[2024-06-01 14:57:49] [INFO ] Deduced a trap composed of 155 places in 286 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 69 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 14:58:04] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 71 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 31/31 constraints]
After SMT, in 62585ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 62598ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74290 ms. Remains : 481/481 places, 1153/1153 transitions.
[2024-06-01 14:58:20] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (20 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 175424 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 175424 steps, saw 110778 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 15:06:57] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:06:57] [INFO ] Invariant cache hit.
[2024-06-01 15:06:57] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 355/365 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/383 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/387 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/474 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/478 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1612/1614 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 479/481 constraints, ReadFeed: 0/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 355/365 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/383 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/387 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/474 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:06:59] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 1 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:07:00] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/478 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/479 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1612/1614 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3221 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 479/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4101ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 547 ms.
Support contains 10 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 49 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
Running 1151 sub problems to find dead transitions.
[2024-06-01 15:07:02] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:07:02] [INFO ] Invariant cache hit.
[2024-06-01 15:07:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 3 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 3 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:07:14] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 78 places in 368 ms of which 5 ms to minimize.
[2024-06-01 15:07:16] [INFO ] Deduced a trap composed of 110 places in 333 ms of which 6 ms to minimize.
[2024-06-01 15:07:17] [INFO ] Deduced a trap composed of 229 places in 348 ms of which 3 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 318 places in 316 ms of which 3 ms to minimize.
[2024-06-01 15:07:18] [INFO ] Deduced a trap composed of 317 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:07:19] [INFO ] Deduced a trap composed of 183 places in 347 ms of which 5 ms to minimize.
[2024-06-01 15:07:20] [INFO ] Deduced a trap composed of 291 places in 346 ms of which 6 ms to minimize.
[2024-06-01 15:07:21] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-01 15:07:22] [INFO ] Deduced a trap composed of 166 places in 218 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:07:22] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 229 places in 297 ms of which 4 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 200 places in 351 ms of which 2 ms to minimize.
[2024-06-01 15:07:23] [INFO ] Deduced a trap composed of 227 places in 375 ms of which 7 ms to minimize.
[2024-06-01 15:07:24] [INFO ] Deduced a trap composed of 195 places in 364 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 65 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:07:38] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 66 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 26/26 constraints]
After SMT, in 42384ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 42408ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42460 ms. Remains : 481/481 places, 1153/1153 transitions.
RANDOM walk for 40000 steps (16 resets) in 520 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (10 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 203482 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 203482 steps, saw 127725 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-01 15:07:48] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:07:48] [INFO ] Invariant cache hit.
[2024-06-01 15:07:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 355/365 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/383 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/387 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/474 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/478 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1133/1612 variables, 479/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1612 variables, 120/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1612 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1614 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1614 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1614/1614 variables, and 643 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 355/365 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/383 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/387 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/474 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 80 places in 230 ms of which 4 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 80 places in 163 ms of which 4 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 5 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 40 places in 351 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/478 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/479 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1133/1612 variables, 479/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1612 variables, 120/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1612 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1614 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1614 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 41 places in 2126 ms of which 28 ms to minimize.
[2024-06-01 15:07:56] [INFO ] Deduced a trap composed of 190 places in 437 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1614 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1614 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1614 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1614/1614 variables, and 656 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7119 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 8647ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 10 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 23 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 481/481 places, 1153/1153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 20 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
[2024-06-01 15:07:56] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:07:56] [INFO ] Invariant cache hit.
[2024-06-01 15:07:57] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-06-01 15:07:57] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:07:57] [INFO ] Invariant cache hit.
[2024-06-01 15:07:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:08:09] [INFO ] Implicit Places using invariants and state equation in 12081 ms returned []
Implicit Place search using SMT with State Equation took 12877 ms to find 0 implicit places.
[2024-06-01 15:08:09] [INFO ] Redundant transitions in 37 ms returned []
Running 1151 sub problems to find dead transitions.
[2024-06-01 15:08:09] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:08:09] [INFO ] Invariant cache hit.
[2024-06-01 15:08:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:08:20] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:08:21] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:08:21] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:08:22] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 78 places in 294 ms of which 5 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 110 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:08:24] [INFO ] Deduced a trap composed of 229 places in 326 ms of which 4 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 318 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:08:25] [INFO ] Deduced a trap composed of 317 places in 310 ms of which 4 ms to minimize.
[2024-06-01 15:08:27] [INFO ] Deduced a trap composed of 183 places in 320 ms of which 3 ms to minimize.
[2024-06-01 15:08:31] [INFO ] Deduced a trap composed of 291 places in 311 ms of which 3 ms to minimize.
[2024-06-01 15:08:34] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
[2024-06-01 15:08:36] [INFO ] Deduced a trap composed of 166 places in 290 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 60 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 107 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 173 places in 286 ms of which 4 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 217 places in 323 ms of which 4 ms to minimize.
[2024-06-01 15:09:09] [INFO ] Deduced a trap composed of 207 places in 290 ms of which 4 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 221 places in 302 ms of which 4 ms to minimize.
[2024-06-01 15:09:10] [INFO ] Deduced a trap composed of 160 places in 298 ms of which 4 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:09:12] [INFO ] Deduced a trap composed of 172 places in 290 ms of which 3 ms to minimize.
SMT process timed out in 62690ms, After SMT, problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 62734ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75687 ms. Remains : 481/481 places, 1153/1153 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-05 in 1314673 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 15:09:12] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 491 cols
[2024-06-01 15:09:12] [INFO ] Computed 42 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (4 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 15:09:12] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 15:09:12] [INFO ] Invariant cache hit.
[2024-06-01 15:09:12] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 15:09:12] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 20 ms returned sat
[2024-06-01 15:09:13] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2024-06-01 15:09:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:09:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 15:09:13] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 18 ms returned sat
[2024-06-01 15:09:14] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2024-06-01 15:09:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:09:15] [INFO ] [Nat]Added 120 Read/Feed constraints in 415 ms returned sat
[2024-06-01 15:09:15] [INFO ] Computed and/alt/rep : 471/1030/461 causal constraints (skipped 680 transitions) in 108 ms.
[2024-06-01 15:09:15] [INFO ] Added : 20 causal constraints over 5 iterations in 690 ms. Result :sat
Minimization took 557 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 491 transition count 1153
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 481 transition count 1153
Applied a total of 20 rules in 62 ms. Remains 481 /491 variables (removed 10) and now considering 1153/1163 (removed 10) transitions.
Running 1151 sub problems to find dead transitions.
[2024-06-01 15:09:16] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
// Phase 1: matrix 1133 rows 481 cols
[2024-06-01 15:09:16] [INFO ] Computed 42 invariants in 14 ms
[2024-06-01 15:09:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 190 places in 331 ms of which 4 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 214 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:09:27] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 2 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 190 places in 252 ms of which 3 ms to minimize.
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 3 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 40 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 191 places in 314 ms of which 3 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 203 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 188 places in 264 ms of which 4 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:09:31] [INFO ] Deduced a trap composed of 93 places in 296 ms of which 2 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 178 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 191 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 186 places in 231 ms of which 4 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 186 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 206 places in 227 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 65 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 65 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 25/25 constraints]
After SMT, in 42674ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 42693ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42759 ms. Remains : 481/491 places, 1153/1163 transitions.
[2024-06-01 15:09:59] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 15:12:47] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:12:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (305 resets) in 5066 ms. (197 steps per ms)
BEST_FIRST walk for 1000000 steps (133 resets) in 2300 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 15:12:54] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:12:54] [INFO ] Invariant cache hit.
[2024-06-01 15:12:55] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 15:12:55] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 23 ms returned sat
[2024-06-01 15:12:56] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2024-06-01 15:12:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:12:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 15:12:56] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 17 ms returned sat
[2024-06-01 15:12:56] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2024-06-01 15:12:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:12:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 690 ms returned sat
[2024-06-01 15:12:58] [INFO ] Deduced a trap composed of 42 places in 342 ms of which 4 ms to minimize.
[2024-06-01 15:12:58] [INFO ] Deduced a trap composed of 192 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:12:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 915 ms
[2024-06-01 15:12:58] [INFO ] Computed and/alt/rep : 461/1020/451 causal constraints (skipped 680 transitions) in 90 ms.
[2024-06-01 15:12:59] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2024-06-01 15:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-06-01 15:13:00] [INFO ] Added : 45 causal constraints over 10 iterations in 1519 ms. Result :sat
Minimization took 4579 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 10 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 38 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 481/481 places, 1153/1153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 30 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
[2024-06-01 15:13:04] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:13:04] [INFO ] Invariant cache hit.
[2024-06-01 15:13:05] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-06-01 15:13:05] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:13:05] [INFO ] Invariant cache hit.
[2024-06-01 15:13:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:13:18] [INFO ] Implicit Places using invariants and state equation in 13387 ms returned []
Implicit Place search using SMT with State Equation took 14053 ms to find 0 implicit places.
[2024-06-01 15:13:18] [INFO ] Redundant transitions in 15 ms returned []
Running 1151 sub problems to find dead transitions.
[2024-06-01 15:13:18] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:13:18] [INFO ] Invariant cache hit.
[2024-06-01 15:13:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:13:28] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 173 places in 303 ms of which 3 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 3 ms to minimize.
[2024-06-01 15:13:29] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 40 places in 285 ms of which 2 ms to minimize.
[2024-06-01 15:13:30] [INFO ] Deduced a trap composed of 190 places in 262 ms of which 3 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 158 places in 311 ms of which 5 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 178 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:13:31] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:13:32] [INFO ] Deduced a trap composed of 92 places in 253 ms of which 4 ms to minimize.
[2024-06-01 15:13:36] [INFO ] Deduced a trap composed of 306 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:13:38] [INFO ] Deduced a trap composed of 183 places in 335 ms of which 3 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 283 places in 232 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:13:41] [INFO ] Deduced a trap composed of 187 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:13:45] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:13:49] [INFO ] Deduced a trap composed of 175 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:13:51] [INFO ] Deduced a trap composed of 227 places in 337 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 64 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:14:18] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 65 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 25/25 constraints]
After SMT, in 62630ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 62639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76748 ms. Remains : 481/481 places, 1153/1153 transitions.
[2024-06-01 15:14:21] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (18 resets) in 409 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 165967 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 1
Probabilistic random walk after 165967 steps, saw 104426 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 15:17:16] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:17:16] [INFO ] Invariant cache hit.
[2024-06-01 15:17:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/433 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/450 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/478 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1133/1612 variables, 479/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 120/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1614 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1614 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1614/1614 variables, and 643 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/433 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/450 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/478 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/479 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1612/1614 variables, and 527 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2136 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 479/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3395ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 10 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 33 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
Running 1151 sub problems to find dead transitions.
[2024-06-01 15:17:20] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:17:20] [INFO ] Invariant cache hit.
[2024-06-01 15:17:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:17:31] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 173 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 3 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 7 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 5 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 190 places in 330 ms of which 2 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 3 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 158 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 178 places in 283 ms of which 4 ms to minimize.
[2024-06-01 15:17:35] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 26 ms to minimize.
[2024-06-01 15:17:35] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:17:35] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2024-06-01 15:17:36] [INFO ] Deduced a trap composed of 92 places in 309 ms of which 4 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 306 places in 393 ms of which 5 ms to minimize.
[2024-06-01 15:17:42] [INFO ] Deduced a trap composed of 183 places in 343 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 59 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 4 ms to minimize.
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 194 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 198 places in 300 ms of which 4 ms to minimize.
[2024-06-01 15:17:51] [INFO ] Deduced a trap composed of 209 places in 348 ms of which 5 ms to minimize.
[2024-06-01 15:17:51] [INFO ] Deduced a trap composed of 199 places in 347 ms of which 5 ms to minimize.
[2024-06-01 15:17:52] [INFO ] Deduced a trap composed of 233 places in 363 ms of which 5 ms to minimize.
[2024-06-01 15:17:52] [INFO ] Deduced a trap composed of 193 places in 346 ms of which 5 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 4 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 228 places in 453 ms of which 7 ms to minimize.
[2024-06-01 15:17:56] [INFO ] Deduced a trap composed of 68 places in 469 ms of which 7 ms to minimize.
[2024-06-01 15:17:56] [INFO ] Deduced a trap composed of 184 places in 376 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 70 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 30/30 constraints]
After SMT, in 43053ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 43071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43109 ms. Remains : 481/481 places, 1153/1153 transitions.
RANDOM walk for 40000 steps (13 resets) in 491 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 180193 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 180193 steps, saw 113098 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
[2024-06-01 15:18:06] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:18:06] [INFO ] Invariant cache hit.
[2024-06-01 15:18:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/433 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/450 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/478 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1133/1612 variables, 479/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 120/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1614 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1614 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1614 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1614/1614 variables, and 643 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 423/433 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/450 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/478 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:18:08] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 3 ms to minimize.
[2024-06-01 15:18:08] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:18:08] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:18:08] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2024-06-01 15:18:08] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
[2024-06-01 15:18:08] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:18:08] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/479 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1133/1612 variables, 479/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 120/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1612 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1612 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1614 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1614 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:18:11] [INFO ] Deduced a trap composed of 23 places in 476 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1614 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1614 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1614 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1614/1614 variables, and 652 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3522 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 481/481 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 4873ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 10 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 53 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 481/481 places, 1153/1153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 1153/1153 transitions.
Applied a total of 0 rules in 32 ms. Remains 481 /481 variables (removed 0) and now considering 1153/1153 (removed 0) transitions.
[2024-06-01 15:18:11] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:18:11] [INFO ] Invariant cache hit.
[2024-06-01 15:18:12] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-06-01 15:18:12] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:18:12] [INFO ] Invariant cache hit.
[2024-06-01 15:18:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:18:24] [INFO ] Implicit Places using invariants and state equation in 12171 ms returned []
Implicit Place search using SMT with State Equation took 12940 ms to find 0 implicit places.
[2024-06-01 15:18:24] [INFO ] Redundant transitions in 38 ms returned []
Running 1151 sub problems to find dead transitions.
[2024-06-01 15:18:24] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
[2024-06-01 15:18:24] [INFO ] Invariant cache hit.
[2024-06-01 15:18:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:18:35] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 2 ms to minimize.
[2024-06-01 15:18:35] [INFO ] Deduced a trap composed of 173 places in 314 ms of which 3 ms to minimize.
[2024-06-01 15:18:35] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 3 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:18:36] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 5 ms to minimize.
[2024-06-01 15:18:37] [INFO ] Deduced a trap composed of 190 places in 343 ms of which 5 ms to minimize.
[2024-06-01 15:18:37] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 2 ms to minimize.
[2024-06-01 15:18:38] [INFO ] Deduced a trap composed of 158 places in 350 ms of which 5 ms to minimize.
[2024-06-01 15:18:38] [INFO ] Deduced a trap composed of 178 places in 339 ms of which 5 ms to minimize.
[2024-06-01 15:18:38] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:18:38] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:18:38] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:18:39] [INFO ] Deduced a trap composed of 92 places in 396 ms of which 6 ms to minimize.
[2024-06-01 15:18:44] [INFO ] Deduced a trap composed of 306 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:18:46] [INFO ] Deduced a trap composed of 183 places in 287 ms of which 4 ms to minimize.
[2024-06-01 15:18:48] [INFO ] Deduced a trap composed of 283 places in 282 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:18:50] [INFO ] Deduced a trap composed of 187 places in 289 ms of which 4 ms to minimize.
[2024-06-01 15:18:57] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 62 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 15:19:20] [INFO ] Deduced a trap composed of 184 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:19:21] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:19:26] [INFO ] Deduced a trap composed of 194 places in 235 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 65 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 25/25 constraints]
After SMT, in 62612ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 62630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75654 ms. Remains : 481/481 places, 1153/1153 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-06 in 614482 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3]
[2024-06-01 15:19:27] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 491 cols
[2024-06-01 15:19:27] [INFO ] Computed 42 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 10000 steps (3 resets) in 54 ms. (181 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-06-01 15:19:27] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 15:19:27] [INFO ] Invariant cache hit.
[2024-06-01 15:19:27] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 15:19:27] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 23 ms returned sat
[2024-06-01 15:19:27] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2024-06-01 15:19:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:19:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 15:19:28] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 28 ms returned sat
[2024-06-01 15:19:30] [INFO ] [Nat]Absence check using state equation in 2280 ms returned sat
[2024-06-01 15:19:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:19:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:19:31] [INFO ] [Nat]Added 120 Read/Feed constraints in 1023 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 491 transition count 1153
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 481 transition count 1153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 471 transition count 1143
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 471 transition count 1133
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 60 place count 461 transition count 1133
Applied a total of 60 rules in 73 ms. Remains 461 /491 variables (removed 30) and now considering 1133/1163 (removed 30) transitions.
Running 1131 sub problems to find dead transitions.
[2024-06-01 15:19:31] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
// Phase 1: matrix 1113 rows 461 cols
[2024-06-01 15:19:31] [INFO ] Computed 42 invariants in 17 ms
[2024-06-01 15:19:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 0 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:19:44] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:19:44] [INFO ] Deduced a trap composed of 95 places in 344 ms of which 6 ms to minimize.
[2024-06-01 15:19:46] [INFO ] Deduced a trap composed of 167 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:19:47] [INFO ] Deduced a trap composed of 287 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:19:47] [INFO ] Deduced a trap composed of 274 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:19:47] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:19:51] [INFO ] Deduced a trap composed of 204 places in 346 ms of which 5 ms to minimize.
[2024-06-01 15:19:52] [INFO ] Deduced a trap composed of 194 places in 452 ms of which 24 ms to minimize.
[2024-06-01 15:19:52] [INFO ] Deduced a trap composed of 261 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:19:53] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:19:53] [INFO ] Deduced a trap composed of 185 places in 283 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1574 variables, and 60 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:20:03] [INFO ] Deduced a trap composed of 187 places in 287 ms of which 6 ms to minimize.
[2024-06-01 15:20:03] [INFO ] Deduced a trap composed of 190 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:20:04] [INFO ] Deduced a trap composed of 180 places in 282 ms of which 2 ms to minimize.
[2024-06-01 15:20:04] [INFO ] Deduced a trap composed of 167 places in 263 ms of which 3 ms to minimize.
[2024-06-01 15:20:06] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:20:07] [INFO ] Deduced a trap composed of 214 places in 324 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1574 variables, and 66 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1131 constraints, Known Traps: 26/26 constraints]
After SMT, in 42500ms problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 42512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42588 ms. Remains : 461/491 places, 1133/1163 transitions.
[2024-06-01 15:20:14] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:20:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3]
RANDOM walk for 1000000 steps (330 resets) in 5600 ms. (178 steps per ms)
BEST_FIRST walk for 1000000 steps (138 resets) in 2407 ms. (415 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3]
[2024-06-01 15:20:22] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:20:22] [INFO ] Invariant cache hit.
[2024-06-01 15:20:22] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 15:20:22] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 17 ms returned sat
[2024-06-01 15:20:22] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2024-06-01 15:20:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:20:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 15:20:22] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 18 ms returned sat
[2024-06-01 15:20:25] [INFO ] [Nat]Absence check using state equation in 2982 ms returned sat
[2024-06-01 15:20:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:20:26] [INFO ] [Nat]Added 120 Read/Feed constraints in 1049 ms returned sat
[2024-06-01 15:20:27] [INFO ] Computed and/alt/rep : 361/810/351 causal constraints (skipped 760 transitions) in 95 ms.
[2024-06-01 15:20:27] [INFO ] Added : 20 causal constraints over 4 iterations in 475 ms. Result :sat
Minimization took 4928 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 29 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 461/461 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 18 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2024-06-01 15:20:32] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:20:32] [INFO ] Invariant cache hit.
[2024-06-01 15:20:32] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-06-01 15:20:32] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:20:32] [INFO ] Invariant cache hit.
[2024-06-01 15:20:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:20:45] [INFO ] Implicit Places using invariants and state equation in 12674 ms returned []
Implicit Place search using SMT with State Equation took 13296 ms to find 0 implicit places.
[2024-06-01 15:20:45] [INFO ] Redundant transitions in 13 ms returned []
Running 1131 sub problems to find dead transitions.
[2024-06-01 15:20:45] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:20:45] [INFO ] Invariant cache hit.
[2024-06-01 15:20:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 0 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:20:57] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:20:57] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:20:57] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 79 places in 336 ms of which 3 ms to minimize.
[2024-06-01 15:21:02] [INFO ] Deduced a trap composed of 174 places in 330 ms of which 6 ms to minimize.
[2024-06-01 15:21:03] [INFO ] Deduced a trap composed of 186 places in 336 ms of which 6 ms to minimize.
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 270 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:21:07] [INFO ] Deduced a trap composed of 169 places in 350 ms of which 6 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 167 places in 338 ms of which 6 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 176 places in 332 ms of which 5 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 167 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:21:09] [INFO ] Deduced a trap composed of 174 places in 312 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:21:16] [INFO ] Deduced a trap composed of 222 places in 323 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1574 variables, and 61 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:21:24] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:21:24] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:21:26] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 2 ms to minimize.
[2024-06-01 15:21:35] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-06-01 15:21:37] [INFO ] Deduced a trap composed of 153 places in 288 ms of which 4 ms to minimize.
[2024-06-01 15:21:38] [INFO ] Deduced a trap composed of 233 places in 269 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1574 variables, and 67 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1131 constraints, Known Traps: 27/27 constraints]
After SMT, in 62799ms problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 62813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76159 ms. Remains : 461/461 places, 1133/1133 transitions.
RANDOM walk for 40000 steps (12 resets) in 524 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 165681 steps, run timeout after 3033 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 165681 steps, saw 104631 distinct states, run finished after 3033 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 15:21:51] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:21:51] [INFO ] Invariant cache hit.
[2024-06-01 15:21:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:21:52] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:21:52] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:21:52] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:21:52] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-06-01 15:21:52] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2024-06-01 15:21:53] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:21:53] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:21:53] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/459 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1113/1572 variables, 459/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 120/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1572 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1574 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1574 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1574 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3053 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 223 places in 263 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/418 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 40/458 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:21:55] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 4 ms to minimize.
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 230 places in 318 ms of which 2 ms to minimize.
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 174 places in 367 ms of which 6 ms to minimize.
[2024-06-01 15:21:56] [INFO ] Deduced a trap composed of 236 places in 307 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/459 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1113/1572 variables, 459/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1572/1574 variables, and 633 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4138 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 459/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 7207ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 235 ms.
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 24 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Running 1131 sub problems to find dead transitions.
[2024-06-01 15:21:59] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:21:59] [INFO ] Invariant cache hit.
[2024-06-01 15:21:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 3 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 35 ms to minimize.
[2024-06-01 15:22:10] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:22:11] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:22:11] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:22:11] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:22:11] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:22:12] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 5 ms to minimize.
[2024-06-01 15:22:12] [INFO ] Deduced a trap composed of 79 places in 343 ms of which 10 ms to minimize.
[2024-06-01 15:22:14] [INFO ] Deduced a trap composed of 174 places in 281 ms of which 4 ms to minimize.
[2024-06-01 15:22:16] [INFO ] Deduced a trap composed of 186 places in 279 ms of which 4 ms to minimize.
[2024-06-01 15:22:17] [INFO ] Deduced a trap composed of 270 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:22:19] [INFO ] Deduced a trap composed of 169 places in 317 ms of which 2 ms to minimize.
[2024-06-01 15:22:20] [INFO ] Deduced a trap composed of 167 places in 262 ms of which 3 ms to minimize.
[2024-06-01 15:22:20] [INFO ] Deduced a trap composed of 176 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:22:20] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 4 ms to minimize.
[2024-06-01 15:22:21] [INFO ] Deduced a trap composed of 174 places in 277 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 3.0 4.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 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 (/ 19.0 4.0))
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.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 (/ 3.0 4.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 (/ 3.0 4.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 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 (/ 31.0 4.0))
(s82 0.0)
(s83 1.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 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 (/ 1.0 4.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 1.0)
(s120 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1574 variables, and 60 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:22:26] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:22:27] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:22:27] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:22:27] [INFO ] Deduced a trap composed of 174 places in 331 ms of which 4 ms to minimize.
[2024-06-01 15:22:28] [INFO ] Deduced a trap composed of 273 places in 513 ms of which 6 ms to minimize.
[2024-06-01 15:22:28] [INFO ] Deduced a trap composed of 222 places in 416 ms of which 7 ms to minimize.
[2024-06-01 15:22:29] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:22:33] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:22:33] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:22:33] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 2 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 157 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1574 variables, and 71 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1131 constraints, Known Traps: 31/31 constraints]
After SMT, in 43132ms problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 43148ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43175 ms. Remains : 461/461 places, 1133/1133 transitions.
RANDOM walk for 40000 steps (18 resets) in 594 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 380 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (10 resets) in 416 ms. (95 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 118403 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 2
Probabilistic random walk after 118403 steps, saw 76036 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 15:22:45] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:22:45] [INFO ] Invariant cache hit.
[2024-06-01 15:22:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/418 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/458 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 5 ms to minimize.
[2024-06-01 15:22:46] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/459 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1113/1572 variables, 459/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 120/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1572 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1574 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1574 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1574 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1574 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1574/1574 variables, and 631 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3092 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 327/408 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 223 places in 267 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/418 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 40/458 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 4 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 174 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/459 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1113/1572 variables, 459/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1572 variables, 120/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1572 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1572 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1574 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1574 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1574 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1574 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1574/1574 variables, and 638 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 461/461 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 7161ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1070 ms.
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 32 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 461/461 places, 1133/1133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1133/1133 transitions.
Applied a total of 0 rules in 23 ms. Remains 461 /461 variables (removed 0) and now considering 1133/1133 (removed 0) transitions.
[2024-06-01 15:22:54] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:22:54] [INFO ] Invariant cache hit.
[2024-06-01 15:22:55] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-06-01 15:22:55] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:22:55] [INFO ] Invariant cache hit.
[2024-06-01 15:22:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:23:08] [INFO ] Implicit Places using invariants and state equation in 13826 ms returned []
Implicit Place search using SMT with State Equation took 14704 ms to find 0 implicit places.
[2024-06-01 15:23:08] [INFO ] Redundant transitions in 19 ms returned []
Running 1131 sub problems to find dead transitions.
[2024-06-01 15:23:09] [INFO ] Flow matrix only has 1113 transitions (discarded 20 similar events)
[2024-06-01 15:23:09] [INFO ] Invariant cache hit.
[2024-06-01 15:23:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:23:19] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:23:20] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 1 ms to minimize.
[2024-06-01 15:23:20] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:23:20] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-06-01 15:23:20] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2024-06-01 15:23:20] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:23:21] [INFO ] Deduced a trap composed of 79 places in 376 ms of which 3 ms to minimize.
[2024-06-01 15:23:23] [INFO ] Deduced a trap composed of 174 places in 280 ms of which 4 ms to minimize.
[2024-06-01 15:23:24] [INFO ] Deduced a trap composed of 186 places in 280 ms of which 2 ms to minimize.
[2024-06-01 15:23:26] [INFO ] Deduced a trap composed of 270 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 169 places in 312 ms of which 4 ms to minimize.
[2024-06-01 15:23:28] [INFO ] Deduced a trap composed of 167 places in 343 ms of which 3 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 176 places in 313 ms of which 2 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 167 places in 340 ms of which 5 ms to minimize.
[2024-06-01 15:23:29] [INFO ] Deduced a trap composed of 174 places in 344 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:23:37] [INFO ] Deduced a trap composed of 222 places in 343 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/1574 variables, and 61 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1131/1131 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
[2024-06-01 15:23:47] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:23:48] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:23:50] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 66 places in 339 ms of which 4 ms to minimize.
[2024-06-01 15:24:00] [INFO ] Deduced a trap composed of 153 places in 299 ms of which 3 ms to minimize.
[2024-06-01 15:24:01] [INFO ] Deduced a trap composed of 233 places in 270 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/1574 variables, and 67 constraints, problems are : Problem set: 0 solved, 1131 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/461 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1131 constraints, Known Traps: 27/27 constraints]
After SMT, in 63134ms problems are : Problem set: 0 solved, 1131 unsolved
Search for dead transitions found 0 dead transitions in 63150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77926 ms. Remains : 461/461 places, 1133/1133 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3]
Ending property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-08 in 285073 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 15:24:12] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
// Phase 1: matrix 1143 rows 491 cols
[2024-06-01 15:24:12] [INFO ] Computed 42 invariants in 32 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (5 resets) in 91 ms. (108 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 39 ms. (250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 15:24:12] [INFO ] Flow matrix only has 1143 transitions (discarded 20 similar events)
[2024-06-01 15:24:12] [INFO ] Invariant cache hit.
[2024-06-01 15:24:12] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 15:24:12] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 30 ms returned sat
[2024-06-01 15:24:14] [INFO ] [Real]Absence check using state equation in 1563 ms returned sat
[2024-06-01 15:24:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:24:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 15:24:14] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 29 ms returned sat
[2024-06-01 15:24:15] [INFO ] [Nat]Absence check using state equation in 1042 ms returned sat
[2024-06-01 15:24:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:24:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:24:16] [INFO ] [Nat]Added 120 Read/Feed constraints in 1017 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 1163/1163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 491 transition count 1154
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 482 transition count 1153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 481 transition count 1153
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 472 transition count 1144
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 47 place count 472 transition count 1135
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 56 place count 463 transition count 1135
Applied a total of 56 rules in 67 ms. Remains 463 /491 variables (removed 28) and now considering 1135/1163 (removed 28) transitions.
Running 1133 sub problems to find dead transitions.
[2024-06-01 15:24:16] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
// Phase 1: matrix 1115 rows 463 cols
[2024-06-01 15:24:16] [INFO ] Computed 42 invariants in 34 ms
[2024-06-01 15:24:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 168 places in 248 ms of which 5 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:24:27] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:24:28] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:24:28] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:24:29] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:24:29] [INFO ] Deduced a trap composed of 98 places in 218 ms of which 3 ms to minimize.
[2024-06-01 15:24:31] [INFO ] Deduced a trap composed of 273 places in 245 ms of which 2 ms to minimize.
[2024-06-01 15:24:32] [INFO ] Deduced a trap composed of 175 places in 281 ms of which 3 ms to minimize.
[2024-06-01 15:24:33] [INFO ] Deduced a trap composed of 173 places in 282 ms of which 3 ms to minimize.
[2024-06-01 15:24:33] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:24:33] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/1578 variables, and 60 constraints, problems are : Problem set: 0 solved, 1133 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1133/1133 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 179 places in 341 ms of which 4 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 185 places in 315 ms of which 4 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 244 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:24:59] [INFO ] Deduced a trap composed of 195 places in 310 ms of which 3 ms to minimize.
SMT process timed out in 43269ms, After SMT, problems are : Problem set: 0 solved, 1133 unsolved
Search for dead transitions found 0 dead transitions in 43284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43355 ms. Remains : 463/491 places, 1135/1163 transitions.
[2024-06-01 15:24:59] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 15:28:29] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:28:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[28]
RANDOM walk for 1000000 steps (342 resets) in 6658 ms. (150 steps per ms)
BEST_FIRST walk for 1000000 steps (111 resets) in 2529 ms. (395 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[28]
[2024-06-01 15:28:38] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:28:38] [INFO ] Invariant cache hit.
[2024-06-01 15:28:39] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-06-01 15:28:39] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 18 ms returned sat
[2024-06-01 15:28:40] [INFO ] [Real]Absence check using state equation in 1009 ms returned sat
[2024-06-01 15:28:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:28:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-06-01 15:28:40] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 15:28:43] [INFO ] [Nat]Absence check using state equation in 3581 ms returned sat
[2024-06-01 15:28:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:28:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 446 ms returned sat
[2024-06-01 15:28:44] [INFO ] Computed and/alt/rep : 371/831/361 causal constraints (skipped 752 transitions) in 95 ms.
[2024-06-01 15:28:44] [INFO ] Added : 20 causal constraints over 4 iterations in 496 ms. Result :sat
Minimization took 4539 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[28]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[28]
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1135/1135 transitions.
Applied a total of 0 rules in 39 ms. Remains 463 /463 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 463/463 places, 1135/1135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1135/1135 transitions.
Applied a total of 0 rules in 32 ms. Remains 463 /463 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2024-06-01 15:28:49] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:28:49] [INFO ] Invariant cache hit.
[2024-06-01 15:28:50] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-06-01 15:28:50] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:28:50] [INFO ] Invariant cache hit.
[2024-06-01 15:28:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:29:02] [INFO ] Implicit Places using invariants and state equation in 11835 ms returned []
Implicit Place search using SMT with State Equation took 12574 ms to find 0 implicit places.
[2024-06-01 15:29:02] [INFO ] Redundant transitions in 29 ms returned []
Running 1133 sub problems to find dead transitions.
[2024-06-01 15:29:02] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:29:02] [INFO ] Invariant cache hit.
[2024-06-01 15:29:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 6 ms to minimize.
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 71 places in 238 ms of which 2 ms to minimize.
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:29:15] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 182 places in 280 ms of which 3 ms to minimize.
[2024-06-01 15:29:16] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:29:17] [INFO ] Deduced a trap composed of 265 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:29:17] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:29:18] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 6 ms to minimize.
[2024-06-01 15:29:18] [INFO ] Deduced a trap composed of 80 places in 382 ms of which 5 ms to minimize.
[2024-06-01 15:29:20] [INFO ] Deduced a trap composed of 276 places in 344 ms of which 3 ms to minimize.
[2024-06-01 15:29:20] [INFO ] Deduced a trap composed of 289 places in 360 ms of which 3 ms to minimize.
[2024-06-01 15:29:23] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:29:26] [INFO ] Deduced a trap composed of 190 places in 311 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:29:32] [INFO ] Deduced a trap composed of 182 places in 255 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/1578 variables, and 61 constraints, problems are : Problem set: 0 solved, 1133 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1133/1133 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:29:42] [INFO ] Deduced a trap composed of 179 places in 335 ms of which 3 ms to minimize.
[2024-06-01 15:29:42] [INFO ] Deduced a trap composed of 167 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:29:44] [INFO ] Deduced a trap composed of 175 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:29:45] [INFO ] Deduced a trap composed of 176 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 212 places in 271 ms of which 3 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 199 places in 305 ms of which 3 ms to minimize.
[2024-06-01 15:29:57] [INFO ] Deduced a trap composed of 185 places in 313 ms of which 3 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 171 places in 307 ms of which 3 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 156 places in 314 ms of which 4 ms to minimize.
[2024-06-01 15:29:58] [INFO ] Deduced a trap composed of 160 places in 294 ms of which 4 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 166 places in 296 ms of which 2 ms to minimize.
[2024-06-01 15:29:59] [INFO ] Deduced a trap composed of 157 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:30:00] [INFO ] Deduced a trap composed of 66 places in 316 ms of which 4 ms to minimize.
[2024-06-01 15:30:00] [INFO ] Deduced a trap composed of 153 places in 293 ms of which 4 ms to minimize.
[2024-06-01 15:30:01] [INFO ] Deduced a trap composed of 64 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:30:02] [INFO ] Deduced a trap composed of 249 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:30:02] [INFO ] Deduced a trap composed of 191 places in 297 ms of which 4 ms to minimize.
[2024-06-01 15:30:02] [INFO ] Deduced a trap composed of 238 places in 295 ms of which 3 ms to minimize.
[2024-06-01 15:30:02] [INFO ] Deduced a trap composed of 195 places in 297 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/1578 variables, and 81 constraints, problems are : Problem set: 0 solved, 1133 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1133 constraints, Known Traps: 41/41 constraints]
After SMT, in 63358ms problems are : Problem set: 0 solved, 1133 unsolved
Search for dead transitions found 0 dead transitions in 63376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76026 ms. Remains : 463/463 places, 1135/1135 transitions.
RANDOM walk for 40000 steps (15 resets) in 424 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161188 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161188 steps, saw 101802 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 15:30:08] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:30:08] [INFO ] Invariant cache hit.
[2024-06-01 15:30:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 184/188 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 98/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/293 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 9 (OVERLAPS) 162/455 variables, 22/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:30:09] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 8/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/460 variables, 5/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/461 variables, 1/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1576/1578 variables, and 510 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 461/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 184/188 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/286 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/293 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 162/455 variables, 22/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 8/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:30:10] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 1/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/460 variables, 5/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/461 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1576/1578 variables, and 511 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1921 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 461/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3783ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1135/1135 transitions.
Applied a total of 0 rules in 40 ms. Remains 463 /463 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Running 1133 sub problems to find dead transitions.
[2024-06-01 15:30:12] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:30:12] [INFO ] Invariant cache hit.
[2024-06-01 15:30:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:30:25] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2024-06-01 15:30:25] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 2 ms to minimize.
[2024-06-01 15:30:25] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:30:25] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:30:25] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:30:26] [INFO ] Deduced a trap composed of 182 places in 302 ms of which 2 ms to minimize.
[2024-06-01 15:30:27] [INFO ] Deduced a trap composed of 38 places in 443 ms of which 4 ms to minimize.
[2024-06-01 15:30:27] [INFO ] Deduced a trap composed of 265 places in 367 ms of which 3 ms to minimize.
[2024-06-01 15:30:27] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:30:28] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 6 ms to minimize.
[2024-06-01 15:30:28] [INFO ] Deduced a trap composed of 80 places in 292 ms of which 4 ms to minimize.
[2024-06-01 15:30:29] [INFO ] Deduced a trap composed of 276 places in 280 ms of which 4 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 289 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2024-06-01 15:30:34] [INFO ] Deduced a trap composed of 190 places in 270 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/1578 variables, and 60 constraints, problems are : Problem set: 0 solved, 1133 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1133/1133 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:30:44] [INFO ] Deduced a trap composed of 168 places in 334 ms of which 4 ms to minimize.
[2024-06-01 15:30:45] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:30:52] [INFO ] Deduced a trap composed of 200 places in 382 ms of which 6 ms to minimize.
[2024-06-01 15:30:52] [INFO ] Deduced a trap composed of 203 places in 415 ms of which 8 ms to minimize.
[2024-06-01 15:30:53] [INFO ] Deduced a trap composed of 206 places in 323 ms of which 4 ms to minimize.
[2024-06-01 15:30:53] [INFO ] Deduced a trap composed of 205 places in 287 ms of which 2 ms to minimize.
[2024-06-01 15:30:53] [INFO ] Deduced a trap composed of 194 places in 265 ms of which 3 ms to minimize.
[2024-06-01 15:30:54] [INFO ] Deduced a trap composed of 218 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:30:54] [INFO ] Deduced a trap composed of 205 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:30:55] [INFO ] Deduced a trap composed of 173 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:30:55] [INFO ] Deduced a trap composed of 178 places in 280 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/1578 variables, and 71 constraints, problems are : Problem set: 0 solved, 1133 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1133 constraints, Known Traps: 31/31 constraints]
After SMT, in 43239ms problems are : Problem set: 0 solved, 1133 unsolved
Search for dead transitions found 0 dead transitions in 43269ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43315 ms. Remains : 463/463 places, 1135/1135 transitions.
RANDOM walk for 40000 steps (12 resets) in 338 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199220 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199220 steps, saw 124431 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
[2024-06-01 15:30:59] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:30:59] [INFO ] Invariant cache hit.
[2024-06-01 15:30:59] [INFO ] State equation strengthened by 120 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 184/188 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/293 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 162/455 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/460 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/461 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1115/1576 variables, 461/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1576 variables, 120/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1576 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1578 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1578 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1578 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1578 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1578/1578 variables, and 625 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 463/463 constraints, ReadFeed: 120/120 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 184/188 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/293 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 162/455 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:31:00] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:31:00] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:31:00] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:31:01] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/460 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/461 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1115/1576 variables, 461/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1576 variables, 120/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1576 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1576 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/1578 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1578 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1578 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1578 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1578/1578 variables, and 634 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3636 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 463/463 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 4839ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1135/1135 transitions.
Applied a total of 0 rules in 24 ms. Remains 463 /463 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 463/463 places, 1135/1135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 1135/1135 transitions.
Applied a total of 0 rules in 19 ms. Remains 463 /463 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
[2024-06-01 15:31:03] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:31:03] [INFO ] Invariant cache hit.
[2024-06-01 15:31:04] [INFO ] Implicit Places using invariants in 733 ms returned []
[2024-06-01 15:31:04] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:31:04] [INFO ] Invariant cache hit.
[2024-06-01 15:31:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:31:16] [INFO ] Implicit Places using invariants and state equation in 11477 ms returned []
Implicit Place search using SMT with State Equation took 12214 ms to find 0 implicit places.
[2024-06-01 15:31:16] [INFO ] Redundant transitions in 38 ms returned []
Running 1133 sub problems to find dead transitions.
[2024-06-01 15:31:16] [INFO ] Flow matrix only has 1115 transitions (discarded 20 similar events)
[2024-06-01 15:31:16] [INFO ] Invariant cache hit.
[2024-06-01 15:31:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:31:28] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:31:28] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:31:28] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 182 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:31:30] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 3 ms to minimize.
[2024-06-01 15:31:30] [INFO ] Deduced a trap composed of 265 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:31:30] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:31:31] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:31:31] [INFO ] Deduced a trap composed of 80 places in 398 ms of which 7 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 276 places in 376 ms of which 6 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 289 places in 373 ms of which 5 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 1 ms to minimize.
[2024-06-01 15:31:38] [INFO ] Deduced a trap composed of 190 places in 260 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:31:43] [INFO ] Deduced a trap composed of 182 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:31:46] [INFO ] Deduced a trap composed of 180 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:31:47] [INFO ] Deduced a trap composed of 176 places in 228 ms of which 2 ms to minimize.
[2024-06-01 15:31:47] [INFO ] Deduced a trap composed of 173 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:31:47] [INFO ] Deduced a trap composed of 163 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:31:48] [INFO ] Deduced a trap composed of 167 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:31:48] [INFO ] Deduced a trap composed of 182 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:31:48] [INFO ] Deduced a trap composed of 210 places in 278 ms of which 3 ms to minimize.
[2024-06-01 15:31:49] [INFO ] Deduced a trap composed of 197 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/1578 variables, and 69 constraints, problems are : Problem set: 0 solved, 1133 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1133/1133 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:31:57] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:32:04] [INFO ] Deduced a trap composed of 175 places in 394 ms of which 6 ms to minimize.
[2024-06-01 15:32:04] [INFO ] Deduced a trap composed of 201 places in 375 ms of which 6 ms to minimize.
[2024-06-01 15:32:04] [INFO ] Deduced a trap composed of 177 places in 332 ms of which 4 ms to minimize.
[2024-06-01 15:32:09] [INFO ] Deduced a trap composed of 193 places in 244 ms of which 3 ms to minimize.
[2024-06-01 15:32:09] [INFO ] Deduced a trap composed of 195 places in 249 ms of which 2 ms to minimize.
[2024-06-01 15:32:09] [INFO ] Deduced a trap composed of 220 places in 222 ms of which 2 ms to minimize.
[2024-06-01 15:32:10] [INFO ] Deduced a trap composed of 157 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:32:11] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 5 ms to minimize.
[2024-06-01 15:32:11] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/1578 variables, and 80 constraints, problems are : Problem set: 0 solved, 1133 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/463 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1133 constraints, Known Traps: 40/40 constraints]
After SMT, in 63292ms problems are : Problem set: 0 solved, 1133 unsolved
Search for dead transitions found 0 dead transitions in 63310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75606 ms. Remains : 463/463 places, 1135/1135 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[28]
Ending property specific reduction for PolyORBLF-PT-S02J04T10-UpperBounds-09 in 487382 ms.
[2024-06-01 15:32:20] [INFO ] Flatten gal took : 231 ms
[2024-06-01 15:32:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 7 ms.
[2024-06-01 15:32:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 491 places, 1163 transitions and 5803 arcs took 19 ms.
Total runtime 3354383 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-UpperBounds-05
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-UpperBounds-06
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-UpperBounds-08
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-UpperBounds-09
BK_STOP 1717255940688
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name PolyORBLF-PT-S02J04T10-UpperBounds-05
ub formula formula --maxsum=/tmp/3354/ub_0_
ub formula name PolyORBLF-PT-S02J04T10-UpperBounds-06
ub formula formula --maxsum=/tmp/3354/ub_1_
ub formula name PolyORBLF-PT-S02J04T10-UpperBounds-08
ub formula formula --maxsum=/tmp/3354/ub_2_
ub formula name PolyORBLF-PT-S02J04T10-UpperBounds-09
ub formula formula --maxsum=/tmp/3354/ub_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J04T10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;