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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q3m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716295643892

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:47:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 12:47:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:47:26] [INFO ] Load time of PNML (sax parser for PT used): 1026 ms
[2024-05-21 12:47:26] [INFO ] Transformed 754 places.
[2024-05-21 12:47:26] [INFO ] Transformed 27370 transitions.
[2024-05-21 12:47:26] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1375 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Deduced a syphon composed of 514 places in 158 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 12:47:27] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-05-21 12:47:27] [INFO ] Computed 10 invariants in 67 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
RANDOM walk for 10001 steps (3 resets) in 100 ms. (99 steps per ms)
BEST_FIRST walk for 80008 steps (16 resets) in 246 ms. (323 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 32, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
[2024-05-21 12:47:27] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 12:47:27] [INFO ] Invariant cache hit.
[2024-05-21 12:47:27] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 12:47:28] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2024-05-21 12:47:28] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 12:47:28] [INFO ] [Real]Added 255 Read/Feed constraints in 73 ms returned sat
[2024-05-21 12:47:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 12:47:29] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2024-05-21 12:47:29] [INFO ] [Nat]Added 255 Read/Feed constraints in 123 ms returned sat
[2024-05-21 12:47:29] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 14 ms to minimize.
[2024-05-21 12:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2024-05-21 12:47:30] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 299 ms.
[2024-05-21 12:47:30] [INFO ] Added : 10 causal constraints over 2 iterations in 853 ms. Result :sat
Minimization took 670 ms.
[2024-05-21 12:47:31] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 12:47:31] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-05-21 12:47:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 12:47:32] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-05-21 12:47:32] [INFO ] [Nat]Added 255 Read/Feed constraints in 112 ms returned sat
[2024-05-21 12:47:32] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 2 ms to minimize.
[2024-05-21 12:47:32] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2024-05-21 12:47:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 520 ms
[2024-05-21 12:47:33] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 158 ms.
[2024-05-21 12:47:34] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 1 ms to minimize.
[2024-05-21 12:47:34] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-21 12:47:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 542 ms
[2024-05-21 12:47:34] [INFO ] Added : 15 causal constraints over 3 iterations in 1640 ms. Result :sat
Minimization took 677 ms.
[2024-05-21 12:47:35] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:47:35] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2024-05-21 12:47:35] [INFO ] [Real]Added 255 Read/Feed constraints in 42 ms returned sat
[2024-05-21 12:47:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 12:47:36] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-05-21 12:47:36] [INFO ] [Nat]Added 255 Read/Feed constraints in 110 ms returned sat
[2024-05-21 12:47:36] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 2 ms to minimize.
[2024-05-21 12:47:37] [INFO ] Deduced a trap composed of 62 places in 359 ms of which 1 ms to minimize.
[2024-05-21 12:47:37] [INFO ] Deduced a trap composed of 74 places in 386 ms of which 2 ms to minimize.
[2024-05-21 12:47:38] [INFO ] Deduced a trap composed of 9 places in 350 ms of which 2 ms to minimize.
[2024-05-21 12:47:38] [INFO ] Deduced a trap composed of 52 places in 299 ms of which 2 ms to minimize.
[2024-05-21 12:47:38] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 2 ms to minimize.
[2024-05-21 12:47:39] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 5 ms to minimize.
[2024-05-21 12:47:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2849 ms
[2024-05-21 12:47:39] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 183 ms.
[2024-05-21 12:47:39] [INFO ] Added : 8 causal constraints over 2 iterations in 576 ms. Result :sat
Minimization took 659 ms.
[2024-05-21 12:47:40] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:47:41] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2024-05-21 12:47:41] [INFO ] [Real]Added 255 Read/Feed constraints in 56 ms returned sat
[2024-05-21 12:47:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 12:47:41] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2024-05-21 12:47:42] [INFO ] [Nat]Added 255 Read/Feed constraints in 171 ms returned sat
[2024-05-21 12:47:42] [INFO ] Deduced a trap composed of 8 places in 431 ms of which 4 ms to minimize.
[2024-05-21 12:47:43] [INFO ] Deduced a trap composed of 89 places in 497 ms of which 2 ms to minimize.
[2024-05-21 12:47:43] [INFO ] Deduced a trap composed of 41 places in 501 ms of which 2 ms to minimize.
[2024-05-21 12:47:44] [INFO ] Deduced a trap composed of 18 places in 567 ms of which 2 ms to minimize.
[2024-05-21 12:47:44] [INFO ] Deduced a trap composed of 64 places in 442 ms of which 2 ms to minimize.
[2024-05-21 12:47:45] [INFO ] Deduced a trap composed of 119 places in 394 ms of which 2 ms to minimize.
[2024-05-21 12:47:46] [INFO ] Deduced a trap composed of 87 places in 1148 ms of which 3 ms to minimize.
[2024-05-21 12:47:46] [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 3
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.verifyPossible(DeadlockTester.java:868)
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-05-21 12:47:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:47:47] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2024-05-21 12:47:47] [INFO ] [Real]Added 255 Read/Feed constraints in 95 ms returned sat
[2024-05-21 12:47:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:47:48] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-21 12:47:48] [INFO ] [Nat]Added 255 Read/Feed constraints in 53 ms returned sat
[2024-05-21 12:47:48] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 236 ms.
[2024-05-21 12:47:48] [INFO ] Added : 2 causal constraints over 1 iterations in 507 ms. Result :sat
Minimization took 791 ms.
[2024-05-21 12:47:49] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 12:47:49] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-21 12:47:50] [INFO ] [Real]Added 255 Read/Feed constraints in 52 ms returned sat
[2024-05-21 12:47:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 12:47:50] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2024-05-21 12:47:50] [INFO ] [Nat]Added 255 Read/Feed constraints in 56 ms returned sat
[2024-05-21 12:47:50] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 196 ms.
[2024-05-21 12:47:51] [INFO ] Added : 3 causal constraints over 1 iterations in 480 ms. Result :sat
Minimization took 696 ms.
[2024-05-21 12:47:51] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 12:47:52] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-05-21 12:47:52] [INFO ] [Real]Added 255 Read/Feed constraints in 41 ms returned sat
[2024-05-21 12:47:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 12:47:52] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2024-05-21 12:47:53] [INFO ] [Nat]Added 255 Read/Feed constraints in 143 ms returned sat
[2024-05-21 12:47:53] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 2 ms to minimize.
[2024-05-21 12:47:53] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 2 ms to minimize.
[2024-05-21 12:47:54] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 2 ms to minimize.
[2024-05-21 12:47:54] [INFO ] Deduced a trap composed of 73 places in 229 ms of which 2 ms to minimize.
[2024-05-21 12:47:54] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 1 ms to minimize.
[2024-05-21 12:47:55] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 1 ms to minimize.
[2024-05-21 12:47:55] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 2 ms to minimize.
[2024-05-21 12:47:56] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2024-05-21 12:47:56] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 2 ms to minimize.
[2024-05-21 12:47:56] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 1 ms to minimize.
[2024-05-21 12:47:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3921 ms
[2024-05-21 12:47:57] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 210 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-21 12:47:57] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:47:57] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-05-21 12:47:58] [INFO ] [Real]Added 255 Read/Feed constraints in 68 ms returned sat
[2024-05-21 12:47:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:47:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:47:58] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2024-05-21 12:47:58] [INFO ] [Nat]Added 255 Read/Feed constraints in 54 ms returned sat
[2024-05-21 12:47:59] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 2 ms to minimize.
[2024-05-21 12:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2024-05-21 12:47:59] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 225 ms.
[2024-05-21 12:47:59] [INFO ] Added : 2 causal constraints over 1 iterations in 586 ms. Result :sat
Minimization took 632 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 32, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 32, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 237 transition count 2772
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 237 transition count 2765
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 17 place count 230 transition count 2765
Applied a total of 17 rules in 279 ms. Remains 230 /240 variables (removed 10) and now considering 2765/2769 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 230/240 places, 2765/2769 transitions.
[2024-05-21 12:48:00] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
Found an invariant !
This invariant on transitions {3=1, 1721=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 1721=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 8) seen :[0, 0, 0, 0, 1, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2, +inf, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
[2024-05-21 12:48:01] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-21 12:48:01] [INFO ] Computed 8 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, +inf, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, +inf, 1]
RANDOM walk for 1000042 steps (2 resets) in 835 ms. (1196 steps per ms)
FORMULA BugTracking-PT-q3m128-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 7000007 steps (14 resets) in 15412 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:48:17] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-21 12:48:17] [INFO ] Invariant cache hit.
[2024-05-21 12:48:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:48:18] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-05-21 12:48:18] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 12:48:18] [INFO ] [Real]Added 255 Read/Feed constraints in 72 ms returned sat
[2024-05-21 12:48:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:48:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:48:19] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2024-05-21 12:48:19] [INFO ] [Nat]Added 255 Read/Feed constraints in 153 ms returned sat
[2024-05-21 12:48:19] [INFO ] Deduced a trap composed of 60 places in 333 ms of which 2 ms to minimize.
[2024-05-21 12:48:19] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 2 ms to minimize.
[2024-05-21 12:48:20] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2024-05-21 12:48:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1207 ms
[2024-05-21 12:48:20] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 202 ms.
[2024-05-21 12:48:21] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 2 ms to minimize.
[2024-05-21 12:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2024-05-21 12:48:21] [INFO ] Added : 11 causal constraints over 4 iterations in 1375 ms. Result :sat
Minimization took 1901 ms.
[2024-05-21 12:48:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:48:24] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-21 12:48:24] [INFO ] [Real]Added 255 Read/Feed constraints in 48 ms returned sat
[2024-05-21 12:48:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:48:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:48:24] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-05-21 12:48:24] [INFO ] [Nat]Added 255 Read/Feed constraints in 70 ms returned sat
[2024-05-21 12:48:25] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 4 ms to minimize.
[2024-05-21 12:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2024-05-21 12:48:25] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 210 ms.
[2024-05-21 12:48:26] [INFO ] Deduced a trap composed of 10 places in 390 ms of which 2 ms to minimize.
[2024-05-21 12:48:26] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 2 ms to minimize.
[2024-05-21 12:48:27] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2024-05-21 12:48:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1262 ms
[2024-05-21 12:48:27] [INFO ] Added : 11 causal constraints over 3 iterations in 2145 ms. Result :sat
Minimization took 1878 ms.
[2024-05-21 12:48:29] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:48:29] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-05-21 12:48:30] [INFO ] [Real]Added 255 Read/Feed constraints in 36 ms returned sat
[2024-05-21 12:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:48:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:48:30] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2024-05-21 12:48:30] [INFO ] [Nat]Added 255 Read/Feed constraints in 140 ms returned sat
[2024-05-21 12:48:30] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2024-05-21 12:48:31] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2024-05-21 12:48:31] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2024-05-21 12:48:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 690 ms
[2024-05-21 12:48:31] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 203 ms.
[2024-05-21 12:48:31] [INFO ] Added : 9 causal constraints over 2 iterations in 678 ms. Result :sat
Minimization took 1930 ms.
[2024-05-21 12:48:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:48:34] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2024-05-21 12:48:34] [INFO ] [Real]Added 255 Read/Feed constraints in 45 ms returned sat
[2024-05-21 12:48:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:48:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:48:35] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-05-21 12:48:35] [INFO ] [Nat]Added 255 Read/Feed constraints in 136 ms returned sat
[2024-05-21 12:48:35] [INFO ] Deduced a trap composed of 32 places in 317 ms of which 2 ms to minimize.
[2024-05-21 12:48:35] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2024-05-21 12:48:36] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 2 ms to minimize.
[2024-05-21 12:48:36] [INFO ] Deduced a trap composed of 77 places in 312 ms of which 2 ms to minimize.
[2024-05-21 12:48:36] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 1 ms to minimize.
[2024-05-21 12:48:37] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 2 ms to minimize.
[2024-05-21 12:48:37] [INFO ] Deduced a trap composed of 76 places in 292 ms of which 1 ms to minimize.
[2024-05-21 12:48:37] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 2 ms to minimize.
[2024-05-21 12:48:38] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 2 ms to minimize.
[2024-05-21 12:48:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3107 ms
[2024-05-21 12:48:38] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 179 ms.
[2024-05-21 12:48:39] [INFO ] Added : 11 causal constraints over 4 iterations in 836 ms. Result :sat
Minimization took 1990 ms.
[2024-05-21 12:48:41] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:48:41] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-05-21 12:48:41] [INFO ] [Real]Added 255 Read/Feed constraints in 47 ms returned sat
[2024-05-21 12:48:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:48:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:48:42] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-05-21 12:48:42] [INFO ] [Nat]Added 255 Read/Feed constraints in 50 ms returned sat
[2024-05-21 12:48:42] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2024-05-21 12:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2024-05-21 12:48:42] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 198 ms.
[2024-05-21 12:48:43] [INFO ] Added : 2 causal constraints over 1 iterations in 519 ms. Result :sat
Minimization took 1948 ms.
[2024-05-21 12:48:45] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:48:45] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-05-21 12:48:45] [INFO ] [Real]Added 255 Read/Feed constraints in 37 ms returned sat
[2024-05-21 12:48:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:48:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:48:46] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2024-05-21 12:48:46] [INFO ] [Nat]Added 255 Read/Feed constraints in 107 ms returned sat
[2024-05-21 12:48:46] [INFO ] Deduced a trap composed of 10 places in 276 ms of which 1 ms to minimize.
[2024-05-21 12:48:47] [INFO ] Deduced a trap composed of 16 places in 308 ms of which 2 ms to minimize.
[2024-05-21 12:48:47] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 2 ms to minimize.
[2024-05-21 12:48:47] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 1 ms to minimize.
[2024-05-21 12:48:48] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 1 ms to minimize.
[2024-05-21 12:48:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1696 ms
[2024-05-21 12:48:48] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 157 ms.
[2024-05-21 12:48:48] [INFO ] Added : 2 causal constraints over 1 iterations in 434 ms. Result :sat
Minimization took 1838 ms.
[2024-05-21 12:48:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:48:51] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-05-21 12:48:51] [INFO ] [Real]Added 255 Read/Feed constraints in 35 ms returned sat
[2024-05-21 12:48:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:48:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:48:51] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-21 12:48:51] [INFO ] [Nat]Added 255 Read/Feed constraints in 43 ms returned sat
[2024-05-21 12:48:52] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 214 ms.
[2024-05-21 12:48:52] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 6 ms to minimize.
[2024-05-21 12:48:53] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-05-21 12:48:53] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2024-05-21 12:48:53] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2024-05-21 12:48:53] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2024-05-21 12:48:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1355 ms
[2024-05-21 12:48:53] [INFO ] Added : 5 causal constraints over 2 iterations in 2123 ms. Result :sat
Minimization took 1822 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 7 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 41 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 230/230 places, 2765/2765 transitions.
[2024-05-21 12:48:56] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
Found an invariant !
This invariant on transitions {3=1, 1721=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {8=1, 1721=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:48:57] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-21 12:48:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000023 steps (2 resets) in 834 ms. (1197 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 13941 ms. (502 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:49:12] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-21 12:49:12] [INFO ] Invariant cache hit.
[2024-05-21 12:49:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:49:12] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2024-05-21 12:49:12] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 12:49:12] [INFO ] [Real]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-05-21 12:49:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:49:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:49:13] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-21 12:49:13] [INFO ] [Nat]Added 255 Read/Feed constraints in 111 ms returned sat
[2024-05-21 12:49:13] [INFO ] Deduced a trap composed of 60 places in 276 ms of which 1 ms to minimize.
[2024-05-21 12:49:14] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 2 ms to minimize.
[2024-05-21 12:49:14] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 2 ms to minimize.
[2024-05-21 12:49:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 893 ms
[2024-05-21 12:49:14] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 153 ms.
[2024-05-21 12:49:15] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2024-05-21 12:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-05-21 12:49:15] [INFO ] Added : 11 causal constraints over 4 iterations in 1230 ms. Result :sat
Minimization took 1864 ms.
[2024-05-21 12:49:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:49:18] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2024-05-21 12:49:18] [INFO ] [Real]Added 255 Read/Feed constraints in 50 ms returned sat
[2024-05-21 12:49:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:49:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:49:18] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2024-05-21 12:49:18] [INFO ] [Nat]Added 255 Read/Feed constraints in 94 ms returned sat
[2024-05-21 12:49:19] [INFO ] Deduced a trap composed of 22 places in 317 ms of which 2 ms to minimize.
[2024-05-21 12:49:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2024-05-21 12:49:19] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 179 ms.
[2024-05-21 12:49:20] [INFO ] Deduced a trap composed of 10 places in 364 ms of which 1 ms to minimize.
[2024-05-21 12:49:20] [INFO ] Deduced a trap composed of 15 places in 328 ms of which 1 ms to minimize.
[2024-05-21 12:49:21] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2024-05-21 12:49:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1235 ms
[2024-05-21 12:49:21] [INFO ] Added : 11 causal constraints over 3 iterations in 2042 ms. Result :sat
Minimization took 1944 ms.
[2024-05-21 12:49:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:49:23] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2024-05-21 12:49:23] [INFO ] [Real]Added 255 Read/Feed constraints in 35 ms returned sat
[2024-05-21 12:49:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:49:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:49:24] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-05-21 12:49:24] [INFO ] [Nat]Added 255 Read/Feed constraints in 139 ms returned sat
[2024-05-21 12:49:24] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2024-05-21 12:49:24] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2024-05-21 12:49:25] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2024-05-21 12:49:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 677 ms
[2024-05-21 12:49:25] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 155 ms.
[2024-05-21 12:49:25] [INFO ] Added : 9 causal constraints over 2 iterations in 625 ms. Result :sat
Minimization took 1875 ms.
[2024-05-21 12:49:27] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:49:28] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2024-05-21 12:49:28] [INFO ] [Real]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-05-21 12:49:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:49:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:49:29] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-05-21 12:49:29] [INFO ] [Nat]Added 255 Read/Feed constraints in 136 ms returned sat
[2024-05-21 12:49:29] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 1 ms to minimize.
[2024-05-21 12:49:29] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 2 ms to minimize.
[2024-05-21 12:49:30] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 1 ms to minimize.
[2024-05-21 12:49:30] [INFO ] Deduced a trap composed of 77 places in 301 ms of which 1 ms to minimize.
[2024-05-21 12:49:30] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 1 ms to minimize.
[2024-05-21 12:49:31] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 2 ms to minimize.
[2024-05-21 12:49:31] [INFO ] Deduced a trap composed of 76 places in 298 ms of which 2 ms to minimize.
[2024-05-21 12:49:31] [INFO ] Deduced a trap composed of 67 places in 293 ms of which 2 ms to minimize.
[2024-05-21 12:49:32] [INFO ] Deduced a trap composed of 68 places in 305 ms of which 1 ms to minimize.
[2024-05-21 12:49:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3261 ms
[2024-05-21 12:49:32] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 225 ms.
[2024-05-21 12:49:33] [INFO ] Added : 11 causal constraints over 4 iterations in 939 ms. Result :sat
Minimization took 2001 ms.
[2024-05-21 12:49:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:49:35] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-05-21 12:49:35] [INFO ] [Real]Added 255 Read/Feed constraints in 40 ms returned sat
[2024-05-21 12:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:49:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:49:36] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2024-05-21 12:49:36] [INFO ] [Nat]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-05-21 12:49:36] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 2 ms to minimize.
[2024-05-21 12:49:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-05-21 12:49:36] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 190 ms.
[2024-05-21 12:49:37] [INFO ] Added : 2 causal constraints over 1 iterations in 466 ms. Result :sat
Minimization took 1962 ms.
[2024-05-21 12:49:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:49:39] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-05-21 12:49:39] [INFO ] [Real]Added 255 Read/Feed constraints in 52 ms returned sat
[2024-05-21 12:49:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:49:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:49:40] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-05-21 12:49:40] [INFO ] [Nat]Added 255 Read/Feed constraints in 88 ms returned sat
[2024-05-21 12:49:40] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 2 ms to minimize.
[2024-05-21 12:49:41] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2024-05-21 12:49:41] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2024-05-21 12:49:41] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 2 ms to minimize.
[2024-05-21 12:49:41] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2024-05-21 12:49:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1455 ms
[2024-05-21 12:49:42] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 155 ms.
[2024-05-21 12:49:42] [INFO ] Added : 2 causal constraints over 1 iterations in 479 ms. Result :sat
Minimization took 1955 ms.
[2024-05-21 12:49:44] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:49:44] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-21 12:49:44] [INFO ] [Real]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-05-21 12:49:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:49:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:49:45] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2024-05-21 12:49:45] [INFO ] [Nat]Added 255 Read/Feed constraints in 41 ms returned sat
[2024-05-21 12:49:45] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 204 ms.
[2024-05-21 12:49:46] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 1 ms to minimize.
[2024-05-21 12:49:46] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2024-05-21 12:49:46] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2024-05-21 12:49:47] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2024-05-21 12:49:47] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2024-05-21 12:49:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1401 ms
[2024-05-21 12:49:47] [INFO ] Added : 5 causal constraints over 2 iterations in 2128 ms. Result :sat
Minimization took 1996 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 7 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 52 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 230/230 places, 2765/2765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 46 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
[2024-05-21 12:49:50] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-21 12:49:50] [INFO ] Invariant cache hit.
[2024-05-21 12:49:51] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-21 12:49:51] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-21 12:49:51] [INFO ] Invariant cache hit.
[2024-05-21 12:49:51] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 12:49:53] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2024-05-21 12:49:53] [INFO ] Redundant transitions in 286 ms returned []
Running 2764 sub problems to find dead transitions.
[2024-05-21 12:49:53] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-21 12:49:53] [INFO ] Invariant cache hit.
[2024-05-21 12:49:53] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2764 unsolved
[2024-05-21 12:50:36] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-05-21 12:50:36] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-21 12:50:36] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2024-05-21 12:50:43] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-21 12:50:46] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2864 variables, and 13 constraints, problems are : Problem set: 42 solved, 2722 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 2764/2764 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 42 solved, 2722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 42 solved, 2722 unsolved
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2764 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 5/13 constraints. Problems are: Problem set: 84 solved, 2680 unsolved
[2024-05-21 12:51:03] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2024-05-21 12:51:03] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
[2024-05-21 12:51:05] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-05-21 12:51:12] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-21 12:51:12] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-21 12:51:12] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/19 constraints. Problems are: Problem set: 372 solved, 2392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2864 variables, and 19 constraints, problems are : Problem set: 372 solved, 2392 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 0/2764 constraints, Known Traps: 11/11 constraints]
After SMT, in 89966ms problems are : Problem set: 372 solved, 2392 unsolved
Search for dead transitions found 372 dead transitions in 90052ms
Found 372 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 372 transitions
Dead transitions reduction (with SMT) removed 372 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2393/2765 transitions.
Reduce places removed 22 places and 565 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 208 transition count 1828
Reduce places removed 17 places and 232 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 39 place count 191 transition count 1596
Reduce places removed 15 places and 268 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 54 place count 176 transition count 1328
Reduce places removed 11 places and 192 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 65 place count 165 transition count 1136
Reduce places removed 3 places and 49 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 162 transition count 1087
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 79 place count 151 transition count 1031
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 15 places and 231 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 105 place count 136 transition count 800
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 113 place count 128 transition count 728
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 121 place count 128 transition count 728
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 121 rules in 40 ms. Remains 128 /230 variables (removed 102) and now considering 728/2393 (removed 1665) transitions.
[2024-05-21 12:51:23] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
// Phase 1: matrix 662 rows 128 cols
[2024-05-21 12:51:23] [INFO ] Computed 14 invariants in 3 ms
[2024-05-21 12:51:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 12:51:23] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
[2024-05-21 12:51:23] [INFO ] Invariant cache hit.
[2024-05-21 12:51:23] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-21 12:51:24] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 128/230 places, 728/2765 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 93291 ms. Remains : 128/230 places, 728/2765 transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 12:51:24] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
Found an invariant !
This invariant on transitions {2=1, 363=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 363=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:51:24] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
// Phase 1: matrix 662 rows 122 cols
[2024-05-21 12:51:24] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000001 steps (2 resets) in 451 ms. (2212 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 990 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:51:25] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
[2024-05-21 12:51:25] [INFO ] Invariant cache hit.
[2024-05-21 12:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-21 12:51:25] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-21 12:51:25] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-21 12:51:25] [INFO ] [Real]Added 88 Read/Feed constraints in 12 ms returned sat
[2024-05-21 12:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:51:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-21 12:51:26] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-21 12:51:26] [INFO ] [Nat]Added 88 Read/Feed constraints in 22 ms returned sat
[2024-05-21 12:51:26] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-21 12:51:26] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-21 12:51:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2024-05-21 12:51:26] [INFO ] Computed and/alt/rep : 179/570/178 causal constraints (skipped 483 transitions) in 37 ms.
[2024-05-21 12:51:26] [INFO ] Added : 6 causal constraints over 2 iterations in 114 ms. Result :sat
Minimization took 221 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 728/728 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 122/122 places, 728/728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 728/728 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 728/728 (removed 0) transitions.
[2024-05-21 12:51:26] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
[2024-05-21 12:51:26] [INFO ] Invariant cache hit.
[2024-05-21 12:51:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 12:51:26] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
[2024-05-21 12:51:26] [INFO ] Invariant cache hit.
[2024-05-21 12:51:27] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-21 12:51:27] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-21 12:51:27] [INFO ] Redundant transitions in 16 ms returned []
Running 727 sub problems to find dead transitions.
[2024-05-21 12:51:27] [INFO ] Flow matrix only has 662 transitions (discarded 66 similar events)
[2024-05-21 12:51:27] [INFO ] Invariant cache hit.
[2024-05-21 12:51:27] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 727 unsolved
[2024-05-21 12:51:30] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 12:51:30] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-21 12:51:31] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD391 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 3/11 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 3 (OVERLAPS) 662/784 variables, 122/133 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/784 variables, 88/221 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 0/221 constraints. Problems are: Problem set: 13 solved, 714 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/784 variables, 0/221 constraints. Problems are: Problem set: 13 solved, 714 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 221 constraints, problems are : Problem set: 13 solved, 714 unsolved in 28396 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 13 solved, 714 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/10 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 3 (OVERLAPS) 1/122 variables, 1/11 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 5 (OVERLAPS) 662/784 variables, 122/133 constraints. Problems are: Problem set: 13 solved, 714 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 88/221 constraints. Problems are: Problem set: 13 solved, 714 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD720 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 714/935 constraints. Problems are: Problem set: 88 solved, 639 unsolved
[2024-05-21 12:52:11] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 1/936 constraints. Problems are: Problem set: 133 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 936 constraints, problems are : Problem set: 133 solved, 594 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 714/727 constraints, Known Traps: 4/4 constraints]
After SMT, in 60095ms problems are : Problem set: 133 solved, 594 unsolved
Search for dead transitions found 133 dead transitions in 60103ms
Found 133 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 133 transitions
Dead transitions reduction (with SMT) removed 133 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 595/728 transitions.
Graph (complete) has 868 edges and 122 vertex of which 118 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 180 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 104 transition count 415
Reduce places removed 8 places and 73 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 23 place count 96 transition count 342
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 92 transition count 313
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 90 transition count 297
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 89 transition count 288
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 36 place count 83 transition count 242
Iterating global reduction 5 with 6 rules applied. Total rules applied 42 place count 83 transition count 242
Applied a total of 42 rules in 22 ms. Remains 83 /122 variables (removed 39) and now considering 242/595 (removed 353) transitions.
[2024-05-21 12:52:27] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 83 cols
[2024-05-21 12:52:27] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 12:52:27] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 12:52:27] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 12:52:27] [INFO ] Invariant cache hit.
[2024-05-21 12:52:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 12:52:27] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/122 places, 242/728 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60985 ms. Remains : 83/122 places, 242/728 transitions.
[2024-05-21 12:52:27] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {0=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 154=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:52:27] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 12:52:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000032 steps (2 resets) in 495 ms. (2016 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 639 ms. (1562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:52:28] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 12:52:28] [INFO ] Invariant cache hit.
[2024-05-21 12:52:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 12:52:29] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:52:29] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 12:52:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 12:52:29] [INFO ] [Real]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-21 12:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:52:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:52:29] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:52:29] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 12:52:29] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:52:29] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 12:52:29] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 12:52:29] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-21 12:52:29] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-21 12:52:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 219 ms
[2024-05-21 12:52:29] [INFO ] Computed and/alt/rep : 187/1011/187 causal constraints (skipped 37 transitions) in 11 ms.
[2024-05-21 12:52:29] [INFO ] Added : 22 causal constraints over 5 iterations in 77 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-21 12:52:29] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 12:52:29] [INFO ] Invariant cache hit.
[2024-05-21 12:52:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 12:52:29] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 12:52:29] [INFO ] Invariant cache hit.
[2024-05-21 12:52:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 12:52:29] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-21 12:52:29] [INFO ] Redundant transitions in 1 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-21 12:52:29] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 12:52:29] [INFO ] Invariant cache hit.
[2024-05-21 12:52:29] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 3 (OVERLAPS) 225/308 variables, 83/91 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 48/139 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-05-21 12:52:32] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 140 constraints, problems are : Problem set: 2 solved, 239 unsolved in 6102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 225/308 variables, 83/92 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 48/140 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 239/379 constraints. Problems are: Problem set: 4 solved, 237 unsolved
[2024-05-21 12:52:38] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/380 constraints. Problems are: Problem set: 4 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 380 constraints, problems are : Problem set: 4 solved, 237 unsolved in 9363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 239/241 constraints, Known Traps: 2/2 constraints]
After SMT, in 15629ms problems are : Problem set: 4 solved, 237 unsolved
Search for dead transitions found 4 dead transitions in 15632ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/83 places, 238/242 transitions.
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 231
Applied a total of 1 rules in 9 ms. Remains 82 /83 variables (removed 1) and now considering 231/238 (removed 7) transitions.
[2024-05-21 12:52:45] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 82 cols
[2024-05-21 12:52:45] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 12:52:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 12:52:45] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 12:52:45] [INFO ] Invariant cache hit.
[2024-05-21 12:52:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 12:52:45] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/83 places, 231/242 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16095 ms. Remains : 82/83 places, 231/242 transitions.
[2024-05-21 12:52:45] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:52:45] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 12:52:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000045 steps (2 resets) in 516 ms. (1934 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 630 ms. (1584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:52:46] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 12:52:46] [INFO ] Invariant cache hit.
[2024-05-21 12:52:47] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 12:52:47] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:52:47] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 12:52:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 12:52:47] [INFO ] [Real]Added 47 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:52:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:52:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 12:52:47] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:52:47] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 12:52:47] [INFO ] [Nat]Added 47 Read/Feed constraints in 10 ms returned sat
[2024-05-21 12:52:47] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 12:52:47] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 12:52:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 12:52:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 12:52:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2024-05-21 12:52:47] [INFO ] Computed and/alt/rep : 178/955/178 causal constraints (skipped 36 transitions) in 14 ms.
[2024-05-21 12:52:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 12:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-21 12:52:47] [INFO ] Added : 41 causal constraints over 10 iterations in 228 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-21 12:52:47] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 12:52:47] [INFO ] Invariant cache hit.
[2024-05-21 12:52:47] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 12:52:47] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 12:52:47] [INFO ] Invariant cache hit.
[2024-05-21 12:52:47] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 12:52:47] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-21 12:52:47] [INFO ] Redundant transitions in 0 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-21 12:52:47] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 12:52:47] [INFO ] Invariant cache hit.
[2024-05-21 12:52:47] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 3 (OVERLAPS) 215/297 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 47/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 12:52:50] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 12:52:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 139 constraints, problems are : Problem set: 12 solved, 218 unsolved in 5882 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 215/297 variables, 82/92 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 47/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 218/357 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 12:52:55] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-21 12:52:55] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-21 12:52:55] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 3/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 360 constraints, problems are : Problem set: 12 solved, 218 unsolved in 6996 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 218/230 constraints, Known Traps: 5/5 constraints]
After SMT, in 13030ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 13033ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 219/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:53:01] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13316 ms. Remains : 82/82 places, 219/231 transitions.
[2024-05-21 12:53:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 41=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:53:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-05-21 12:53:01] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000006 steps (2 resets) in 514 ms. (1941 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 617 ms. (1618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:53:02] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:02] [INFO ] Invariant cache hit.
[2024-05-21 12:53:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 12:53:02] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:53:02] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 12:53:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:53:02] [INFO ] [Real]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:53:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:53:02] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:53:02] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 12:53:02] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-05-21 12:53:02] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-21 12:53:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-21 12:53:02] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-05-21 12:53:02] [INFO ] Added : 59 causal constraints over 12 iterations in 187 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:53:02] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:02] [INFO ] Invariant cache hit.
[2024-05-21 12:53:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 12:53:02] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:02] [INFO ] Invariant cache hit.
[2024-05-21 12:53:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:53:03] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-21 12:53:03] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 12:53:03] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:03] [INFO ] Invariant cache hit.
[2024-05-21 12:53:03] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4548 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 12:53:09] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-21 12:53:10] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7768 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 12475ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 12479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12755 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 12:53:15] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 41=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 40391 steps (8 resets) in 102 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1397915 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1397915 steps, saw 787956 distinct states, run finished after 3004 ms. (steps per millisecond=465 ) properties seen :0
[2024-05-21 12:53:18] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:18] [INFO ] Invariant cache hit.
[2024-05-21 12:53:18] [INFO ] State equation strengthened by 45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 63/156 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/241 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/241 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/243 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/243 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/283 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/283 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/285 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/156 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/241 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/243 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/243 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/283 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:53:19] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/283 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/283 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/285 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:53:19] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 12:53:19] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
RANDOM walk for 40259 steps (8 resets) in 24 ms. (1610 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1391036 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1391036 steps, saw 786192 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
[2024-05-21 12:53:22] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:22] [INFO ] Invariant cache hit.
[2024-05-21 12:53:22] [INFO ] State equation strengthened by 45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 63/156 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/241 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/241 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/243 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/243 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/283 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/283 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/285 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 63/156 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/156 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/241 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/241 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/241 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/241 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/243 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/243 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/283 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/283 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/283 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:53:22] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/283 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/283 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/285 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:53:22] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 12:53:22] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:53:22] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:22] [INFO ] Invariant cache hit.
[2024-05-21 12:53:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 12:53:23] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:23] [INFO ] Invariant cache hit.
[2024-05-21 12:53:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:53:23] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-21 12:53:23] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 12:53:23] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:23] [INFO ] Invariant cache hit.
[2024-05-21 12:53:23] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4430 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 12:53:29] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-21 12:53:29] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 11966ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 11970ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12195 ms. Remains : 82/82 places, 219/219 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 331 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 201
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 31 place count 68 transition count 157
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 68 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 68 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 67 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 63 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 61 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 57 transition count 147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 54 transition count 150
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 74 place count 54 transition count 145
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 79 place count 49 transition count 145
Applied a total of 79 rules in 50 ms. Remains 49 /82 variables (removed 33) and now considering 145/219 (removed 74) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 49 cols
[2024-05-21 12:53:35] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 12:53:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 12:53:35] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 12:53:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 12:53:35] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 12:53:35] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 12:53:35] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 199 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, +inf, 1]
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 12:53:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-05-21 12:53:35] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 5 ms. (1667 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 12:53:35] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:35] [INFO ] Invariant cache hit.
[2024-05-21 12:53:35] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:53:35] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:53:35] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 12:53:35] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:53:35] [INFO ] [Real]Added 45 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:53:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:53:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:53:35] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:53:35] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 12:53:35] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:53:35] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-05-21 12:53:35] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 12:53:35] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-21 12:53:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2024-05-21 12:53:35] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-21 12:53:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-21 12:53:35] [INFO ] Added : 71 causal constraints over 17 iterations in 415 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 12:53:36] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 41=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 12:53:36] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000093 steps (2 resets) in 538 ms. (1855 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 618 ms. (1615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 12:53:37] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:37] [INFO ] Invariant cache hit.
[2024-05-21 12:53:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:53:37] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:53:37] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 12:53:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:53:37] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:53:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:53:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:53:37] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:53:37] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-21 12:53:37] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:53:37] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-05-21 12:53:37] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-21 12:53:37] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-21 12:53:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-05-21 12:53:37] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-21 12:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-21 12:53:37] [INFO ] Added : 71 causal constraints over 17 iterations in 375 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:53:38] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:38] [INFO ] Invariant cache hit.
[2024-05-21 12:53:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 12:53:38] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:38] [INFO ] Invariant cache hit.
[2024-05-21 12:53:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:53:38] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-21 12:53:38] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 12:53:38] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:53:38] [INFO ] Invariant cache hit.
[2024-05-21 12:53:38] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4380 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 12:53:44] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-21 12:53:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8085 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 12623ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 12627ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12899 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 12:53:51] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {4=1, 41=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 33313 steps (6 resets) in 39 ms. (832 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-12 in 15862 ms.
[2024-05-21 12:53:51] [INFO ] Flatten gal took : 49 ms
[2024-05-21 12:53:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 12:53:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 219 transitions and 1042 arcs took 4 ms.
Total runtime 386200 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q3m128

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 82
TRANSITIONS: 219
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.003s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 1393
MODEL NAME: /home/mcc/execution/416/model
82 places, 219 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716296033507

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BugTracking-PT-q3m128, 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 r047-tajo-171620398100373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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