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-171620398100397.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-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 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:24 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-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716296953653

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-q8m004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:09:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 13:09:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:09:16] [INFO ] Load time of PNML (sax parser for PT used): 1095 ms
[2024-05-21 13:09:16] [INFO ] Transformed 754 places.
[2024-05-21 13:09:16] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:09:16] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1320 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 67 ms.
Deduced a syphon composed of 474 places in 133 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 13:09:16] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 13:09:16] [INFO ] Computed 10 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, 1, 1]
RANDOM walk for 10000 steps (113 resets) in 154 ms. (64 steps per ms)
FORMULA BugTracking-PT-q8m004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (143 resets) in 248 ms. (240 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-05-21 13:09:17] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 13:09:17] [INFO ] Invariant cache hit.
[2024-05-21 13:09:17] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 13:09:18] [INFO ] [Real]Absence check using state equation in 1301 ms returned sat
[2024-05-21 13:09:19] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 13:09:19] [INFO ] [Real]Added 303 Read/Feed constraints in 94 ms returned sat
[2024-05-21 13:09:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:09:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:09:20] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2024-05-21 13:09:20] [INFO ] [Nat]Added 303 Read/Feed constraints in 234 ms returned sat
[2024-05-21 13:09:20] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 446 ms.
[2024-05-21 13:09:21] [INFO ] Added : 6 causal constraints over 2 iterations in 1118 ms. Result :sat
Minimization took 1492 ms.
[2024-05-21 13:09:23] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 13:09:23] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2024-05-21 13:09:24] [INFO ] [Real]Added 303 Read/Feed constraints in 125 ms returned sat
[2024-05-21 13:09:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:09:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:09:25] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2024-05-21 13:09:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 13:09:25] [INFO ] [Nat]Added 303 Read/Feed constraints in 606 ms returned sat
[2024-05-21 13:09:26] [INFO ] Deduced a trap composed of 19 places in 946 ms of which 29 ms to minimize.
[2024-05-21 13:09:27] [INFO ] Deduced a trap composed of 62 places in 607 ms of which 2 ms to minimize.
[2024-05-21 13:09:28] [INFO ] Deduced a trap composed of 50 places in 688 ms of which 2 ms to minimize.
[2024-05-21 13:09:28] [INFO ] Deduced a trap composed of 45 places in 425 ms of which 2 ms to minimize.
[2024-05-21 13:09:29] [INFO ] Deduced a trap composed of 55 places in 379 ms of which 2 ms to minimize.
[2024-05-21 13:09:29] [INFO ] Deduced a trap composed of 60 places in 416 ms of which 1 ms to minimize.
[2024-05-21 13:09:29] [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 1
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 13:09:29] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 13:09:30] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2024-05-21 13:09:30] [INFO ] [Real]Added 303 Read/Feed constraints in 117 ms returned sat
[2024-05-21 13:09:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:09:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:09:31] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-21 13:09:31] [INFO ] [Nat]Added 303 Read/Feed constraints in 247 ms returned sat
[2024-05-21 13:09:32] [INFO ] Deduced a trap composed of 12 places in 347 ms of which 3 ms to minimize.
[2024-05-21 13:09:32] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 12 ms to minimize.
[2024-05-21 13:09:32] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 1 ms to minimize.
[2024-05-21 13:09:33] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 2 ms to minimize.
[2024-05-21 13:09:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1878 ms
[2024-05-21 13:09:33] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 498 ms.
[2024-05-21 13:09:34] [INFO ] Added : 11 causal constraints over 3 iterations in 1424 ms. Result :sat
Minimization took 805 ms.
[2024-05-21 13:09:35] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 13:09:36] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2024-05-21 13:09:36] [INFO ] [Real]Added 303 Read/Feed constraints in 123 ms returned sat
[2024-05-21 13:09:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:09:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 13:09:37] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2024-05-21 13:09:37] [INFO ] [Nat]Added 303 Read/Feed constraints in 79 ms returned sat
[2024-05-21 13:09:38] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 300 ms.
[2024-05-21 13:09:38] [INFO ] Added : 2 causal constraints over 1 iterations in 751 ms. Result :sat
Minimization took 1459 ms.
[2024-05-21 13:09:40] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:09:41] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-05-21 13:09:41] [INFO ] [Real]Added 303 Read/Feed constraints in 87 ms returned sat
[2024-05-21 13:09:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:09:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:09:42] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2024-05-21 13:09:42] [INFO ] [Nat]Added 303 Read/Feed constraints in 115 ms returned sat
[2024-05-21 13:09:42] [INFO ] Deduced a trap composed of 15 places in 420 ms of which 2 ms to minimize.
[2024-05-21 13:09:43] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 2 ms to minimize.
[2024-05-21 13:09:43] [INFO ] Deduced a trap composed of 19 places in 349 ms of which 1 ms to minimize.
[2024-05-21 13:09:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1457 ms
[2024-05-21 13:09:43] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 254 ms.
[2024-05-21 13:09:44] [INFO ] Added : 5 causal constraints over 1 iterations in 676 ms. Result :sat
Minimization took 1354 ms.
[2024-05-21 13:09:45] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:09:46] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2024-05-21 13:09:46] [INFO ] [Real]Added 303 Read/Feed constraints in 142 ms returned sat
[2024-05-21 13:09:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:09:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 13:09:47] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2024-05-21 13:09:47] [INFO ] [Nat]Added 303 Read/Feed constraints in 260 ms returned sat
[2024-05-21 13:09:48] [INFO ] Deduced a trap composed of 52 places in 685 ms of which 3 ms to minimize.
[2024-05-21 13:09:49] [INFO ] Deduced a trap composed of 42 places in 590 ms of which 3 ms to minimize.
[2024-05-21 13:09:50] [INFO ] Deduced a trap composed of 14 places in 639 ms of which 3 ms to minimize.
[2024-05-21 13:09:50] [INFO ] Deduced a trap composed of 61 places in 609 ms of which 2 ms to minimize.
[2024-05-21 13:09:51] [INFO ] Deduced a trap composed of 58 places in 600 ms of which 2 ms to minimize.
[2024-05-21 13:09:52] [INFO ] Deduced a trap composed of 54 places in 559 ms of which 2 ms to minimize.
[2024-05-21 13:09:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 408 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 269/280 places, 3871/3904 transitions.
[2024-05-21 13:09:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-05-21 13:09:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-21 13:09:54] [INFO ] Computed 8 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 7010 ms. (142 steps per ms)
BEST_FIRST walk for 6000005 steps (15 resets) in 12283 ms. (488 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-05-21 13:10:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:10:13] [INFO ] Invariant cache hit.
[2024-05-21 13:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-21 13:10:14] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2024-05-21 13:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:10:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:10:15] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2024-05-21 13:10:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:10:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 227 ms returned sat
[2024-05-21 13:10:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 362 ms.
[2024-05-21 13:10:16] [INFO ] Added : 4 causal constraints over 1 iterations in 764 ms. Result :sat
Minimization took 4510 ms.
[2024-05-21 13:10:20] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-21 13:10:21] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2024-05-21 13:10:21] [INFO ] [Real]Added 283 Read/Feed constraints in 98 ms returned sat
[2024-05-21 13:10:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:10:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 13:10:22] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2024-05-21 13:10:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 159 ms returned sat
[2024-05-21 13:10:23] [INFO ] Deduced a trap composed of 39 places in 615 ms of which 2 ms to minimize.
[2024-05-21 13:10:24] [INFO ] Deduced a trap composed of 38 places in 570 ms of which 2 ms to minimize.
[2024-05-21 13:10:24] [INFO ] Deduced a trap composed of 38 places in 504 ms of which 3 ms to minimize.
[2024-05-21 13:10:25] [INFO ] Deduced a trap composed of 19 places in 585 ms of which 2 ms to minimize.
[2024-05-21 13:10:25] [INFO ] Deduced a trap composed of 33 places in 593 ms of which 2 ms to minimize.
[2024-05-21 13:10:26] [INFO ] Deduced a trap composed of 40 places in 381 ms of which 2 ms to minimize.
[2024-05-21 13:10:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3900 ms
[2024-05-21 13:10:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 295 ms.
[2024-05-21 13:10:28] [INFO ] Deduced a trap composed of 60 places in 378 ms of which 2 ms to minimize.
[2024-05-21 13:10:28] [INFO ] Deduced a trap composed of 62 places in 365 ms of which 2 ms to minimize.
[2024-05-21 13:10:29] [INFO ] Deduced a trap composed of 61 places in 417 ms of which 2 ms to minimize.
[2024-05-21 13:10:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1724 ms
[2024-05-21 13:10:29] [INFO ] Added : 12 causal constraints over 3 iterations in 3017 ms. Result :sat
Minimization took 4501 ms.
[2024-05-21 13:10:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 13:10:34] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2024-05-21 13:10:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:10:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 13:10:35] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2024-05-21 13:10:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 241 ms returned sat
[2024-05-21 13:10:36] [INFO ] Deduced a trap composed of 9 places in 586 ms of which 2 ms to minimize.
[2024-05-21 13:10:37] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 2 ms to minimize.
[2024-05-21 13:10:37] [INFO ] Deduced a trap composed of 55 places in 370 ms of which 2 ms to minimize.
[2024-05-21 13:10:37] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 2 ms to minimize.
[2024-05-21 13:10:38] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 2 ms to minimize.
[2024-05-21 13:10:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2570 ms
[2024-05-21 13:10:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2024-05-21 13:10:39] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 2 ms to minimize.
[2024-05-21 13:10:40] [INFO ] Deduced a trap composed of 55 places in 301 ms of which 6 ms to minimize.
[2024-05-21 13:10:40] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 1 ms to minimize.
[2024-05-21 13:10:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1412 ms
[2024-05-21 13:10:40] [INFO ] Added : 8 causal constraints over 2 iterations in 2468 ms. Result :sat
Minimization took 4498 ms.
[2024-05-21 13:10:45] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:10:46] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-05-21 13:10:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:10:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 13:10:47] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2024-05-21 13:10:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 119 ms returned sat
[2024-05-21 13:10:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 308 ms.
[2024-05-21 13:10:48] [INFO ] Added : 2 causal constraints over 1 iterations in 707 ms. Result :sat
Minimization took 4269 ms.
[2024-05-21 13:10:52] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 13:10:53] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2024-05-21 13:10:53] [INFO ] [Real]Added 283 Read/Feed constraints in 53 ms returned sat
[2024-05-21 13:10:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:10:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-05-21 13:10:54] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2024-05-21 13:10:54] [INFO ] [Nat]Added 283 Read/Feed constraints in 140 ms returned sat
[2024-05-21 13:10:54] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 2 ms to minimize.
[2024-05-21 13:10:55] [INFO ] Deduced a trap composed of 56 places in 398 ms of which 2 ms to minimize.
[2024-05-21 13:10:55] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 2 ms to minimize.
[2024-05-21 13:10:56] [INFO ] Deduced a trap composed of 62 places in 408 ms of which 2 ms to minimize.
[2024-05-21 13:10:56] [INFO ] Deduced a trap composed of 61 places in 443 ms of which 2 ms to minimize.
[2024-05-21 13:10:57] [INFO ] Deduced a trap composed of 32 places in 438 ms of which 2 ms to minimize.
[2024-05-21 13:10:58] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 2 ms to minimize.
[2024-05-21 13:10:58] [INFO ] Deduced a trap composed of 61 places in 393 ms of which 2 ms to minimize.
[2024-05-21 13:10:59] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 2 ms to minimize.
[2024-05-21 13:10:59] [INFO ] Deduced a trap composed of 86 places in 427 ms of which 2 ms to minimize.
[2024-05-21 13:11:00] [INFO ] Deduced a trap composed of 59 places in 391 ms of which 2 ms to minimize.
[2024-05-21 13:11:00] [INFO ] Deduced a trap composed of 57 places in 413 ms of which 2 ms to minimize.
[2024-05-21 13:11:01] [INFO ] Deduced a trap composed of 61 places in 431 ms of which 2 ms to minimize.
[2024-05-21 13:11:02] [INFO ] Deduced a trap composed of 62 places in 427 ms of which 2 ms to minimize.
[2024-05-21 13:11:02] [INFO ] Deduced a trap composed of 44 places in 451 ms of which 3 ms to minimize.
[2024-05-21 13:11:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 8549 ms
[2024-05-21 13:11:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 354 ms.
[2024-05-21 13:11:03] [INFO ] Added : 6 causal constraints over 2 iterations in 981 ms. Result :sat
Minimization took 3997 ms.
[2024-05-21 13:11:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:11:08] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2024-05-21 13:11:08] [INFO ] [Real]Added 283 Read/Feed constraints in 80 ms returned sat
[2024-05-21 13:11:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:11:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 13:11:09] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-05-21 13:11:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 247 ms returned sat
[2024-05-21 13:11:10] [INFO ] Deduced a trap composed of 32 places in 310 ms of which 2 ms to minimize.
[2024-05-21 13:11:10] [INFO ] Deduced a trap composed of 107 places in 481 ms of which 2 ms to minimize.
[2024-05-21 13:11:11] [INFO ] Deduced a trap composed of 99 places in 483 ms of which 2 ms to minimize.
[2024-05-21 13:11:12] [INFO ] Deduced a trap composed of 92 places in 535 ms of which 2 ms to minimize.
[2024-05-21 13:11:12] [INFO ] Deduced a trap composed of 57 places in 497 ms of which 6 ms to minimize.
[2024-05-21 13:11:13] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 1 ms to minimize.
[2024-05-21 13:11:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3309 ms
[2024-05-21 13:11:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 228 ms.
[2024-05-21 13:11:14] [INFO ] Deduced a trap composed of 96 places in 443 ms of which 2 ms to minimize.
[2024-05-21 13:11:14] [INFO ] Deduced a trap composed of 40 places in 444 ms of which 1 ms to minimize.
[2024-05-21 13:11:15] [INFO ] Deduced a trap composed of 14 places in 465 ms of which 2 ms to minimize.
[2024-05-21 13:11:15] [INFO ] Deduced a trap composed of 96 places in 427 ms of which 2 ms to minimize.
[2024-05-21 13:11:16] [INFO ] Deduced a trap composed of 26 places in 420 ms of which 1 ms to minimize.
[2024-05-21 13:11:16] [INFO ] Deduced a trap composed of 56 places in 390 ms of which 2 ms to minimize.
[2024-05-21 13:11:17] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 1 ms to minimize.
[2024-05-21 13:11:17] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 1 ms to minimize.
[2024-05-21 13:11:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4193 ms
[2024-05-21 13:11:18] [INFO ] Added : 5 causal constraints over 1 iterations in 4860 ms. Result :sat
Minimization took 4779 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-21 13:11:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:11:23] [INFO ] Invariant cache hit.
[2024-05-21 13:11:23] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-21 13:11:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:11:23] [INFO ] Invariant cache hit.
[2024-05-21 13:11:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:11:26] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
[2024-05-21 13:11:26] [INFO ] Redundant transitions in 391 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 13:11:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 13:11:26] [INFO ] Invariant cache hit.
[2024-05-21 13:11:26] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-05-21 13:12:43] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 9 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 3862 unsolved
[2024-05-21 13:13:00] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
[2024-05-21 13:13:00] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
[2024-05-21 13:13:00] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
[2024-05-21 13:13:00] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
[2024-05-21 13:13:00] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
[2024-05-21 13:13:05] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
Problem TDEAD2933 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2938 is UNSAT
Problem TDEAD2939 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2941 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2945 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
[2024-05-21 13:13:11] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
Problem TDEAD3830 is UNSAT
Problem TDEAD3831 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3868 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 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 TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 7/16 constraints. Problems are: Problem set: 949 solved, 2921 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 16 constraints, problems are : Problem set: 949 solved, 2921 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 8/8 constraints]
After SMT, in 106557ms problems are : Problem set: 949 solved, 2921 unsolved
Search for dead transitions found 949 dead transitions in 106629ms
Found 949 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 949 transitions
Dead transitions reduction (with SMT) removed 949 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 2922/3871 transitions.
Graph (complete) has 3556 edges and 269 vertex of which 255 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 0 output transitions
Reduce places removed 33 places and 960 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 222 transition count 1962
Reduce places removed 21 places and 405 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 55 place count 201 transition count 1557
Reduce places removed 10 places and 147 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 65 place count 191 transition count 1410
Reduce places removed 6 places and 47 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 71 place count 185 transition count 1363
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 183 transition count 1311
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 74 place count 182 transition count 1292
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 75 place count 181 transition count 1283
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 95 place count 161 transition count 1137
Deduced a syphon composed of 3 places in 3 ms
Iterating global reduction 7 with 20 rules applied. Total rules applied 115 place count 161 transition count 1137
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 126 place count 150 transition count 1038
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 7 with 11 rules applied. Total rules applied 137 place count 150 transition count 1038
Deduced a syphon composed of 3 places in 3 ms
Applied a total of 137 rules in 110 ms. Remains 150 /269 variables (removed 119) and now considering 1038/2922 (removed 1884) transitions.
[2024-05-21 13:13:13] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
// Phase 1: matrix 917 rows 150 cols
[2024-05-21 13:13:13] [INFO ] Computed 10 invariants in 7 ms
[2024-05-21 13:13:13] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-21 13:13:13] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
[2024-05-21 13:13:13] [INFO ] Invariant cache hit.
[2024-05-21 13:13:13] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-21 13:13:14] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 150/269 places, 1038/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 111180 ms. Remains : 150/269 places, 1038/3871 transitions.
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:13:14] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
Found an invariant !
This invariant on transitions {5=1, 735=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 735=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, 1]
[2024-05-21 13:13:14] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
// Phase 1: matrix 917 rows 147 cols
[2024-05-21 13:13:14] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3044 ms. (328 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 2662 ms. (1126 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
[2024-05-21 13:13:20] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
[2024-05-21 13:13:20] [INFO ] Invariant cache hit.
[2024-05-21 13:13:20] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 13:13:20] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-21 13:13:20] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-21 13:13:20] [INFO ] [Real]Added 104 Read/Feed constraints in 33 ms returned sat
[2024-05-21 13:13:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:13:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 13:13:20] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-21 13:13:20] [INFO ] [Nat]Added 104 Read/Feed constraints in 63 ms returned sat
[2024-05-21 13:13:21] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2024-05-21 13:13:21] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-21 13:13:21] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2024-05-21 13:13:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 517 ms
[2024-05-21 13:13:21] [INFO ] Computed and/alt/rep : 360/1426/360 causal constraints (skipped 556 transitions) in 81 ms.
[2024-05-21 13:13:21] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2024-05-21 13:13:21] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-21 13:13:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2024-05-21 13:13:22] [INFO ] Added : 13 causal constraints over 4 iterations in 646 ms. Result :sat
Minimization took 461 ms.
[2024-05-21 13:13:22] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 13:13:22] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-21 13:13:22] [INFO ] [Real]Added 104 Read/Feed constraints in 20 ms returned sat
[2024-05-21 13:13:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:13:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:13:23] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-21 13:13:23] [INFO ] [Nat]Added 104 Read/Feed constraints in 29 ms returned sat
[2024-05-21 13:13:23] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 2 ms to minimize.
[2024-05-21 13:13:23] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 1 ms to minimize.
[2024-05-21 13:13:23] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2024-05-21 13:13:23] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2024-05-21 13:13:24] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-21 13:13:24] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-05-21 13:13:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1158 ms
[2024-05-21 13:13:24] [INFO ] Computed and/alt/rep : 360/1426/360 causal constraints (skipped 556 transitions) in 79 ms.
[2024-05-21 13:13:24] [INFO ] Added : 7 causal constraints over 2 iterations in 205 ms. Result :sat
Minimization took 422 ms.
[2024-05-21 13:13:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:13:25] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-21 13:13:25] [INFO ] [Real]Added 104 Read/Feed constraints in 15 ms returned sat
[2024-05-21 13:13:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:13:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 13:13:25] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-21 13:13:25] [INFO ] [Nat]Added 104 Read/Feed constraints in 47 ms returned sat
[2024-05-21 13:13:25] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2024-05-21 13:13:25] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 1 ms to minimize.
[2024-05-21 13:13:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2024-05-21 13:13:25] [INFO ] Computed and/alt/rep : 360/1426/360 causal constraints (skipped 556 transitions) in 66 ms.
[2024-05-21 13:13:26] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 1 ms to minimize.
[2024-05-21 13:13:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-05-21 13:13:26] [INFO ] Added : 9 causal constraints over 2 iterations in 465 ms. Result :sat
Minimization took 384 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 1038/1038 transitions.
Applied a total of 0 rules in 29 ms. Remains 147 /147 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 147/147 places, 1038/1038 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 1038/1038 transitions.
Applied a total of 0 rules in 27 ms. Remains 147 /147 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2024-05-21 13:13:27] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
[2024-05-21 13:13:27] [INFO ] Invariant cache hit.
[2024-05-21 13:13:27] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 13:13:27] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
[2024-05-21 13:13:27] [INFO ] Invariant cache hit.
[2024-05-21 13:13:27] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-21 13:13:28] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2024-05-21 13:13:28] [INFO ] Redundant transitions in 35 ms returned []
Running 1037 sub problems to find dead transitions.
[2024-05-21 13:13:28] [INFO ] Flow matrix only has 917 transitions (discarded 121 similar events)
[2024-05-21 13:13:28] [INFO ] Invariant cache hit.
[2024-05-21 13:13:28] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
[2024-05-21 13:13:35] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-21 13:13:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 1033 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 1033 unsolved
At refinement iteration 3 (OVERLAPS) 917/1063 variables, 146/155 constraints. Problems are: Problem set: 4 solved, 1033 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1063 variables, 104/259 constraints. Problems are: Problem set: 4 solved, 1033 unsolved
[2024-05-21 13:13:55] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 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 TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 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 TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 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 TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1064 variables, and 260 constraints, problems are : Problem set: 123 solved, 914 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/147 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 1037/1037 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 123 solved, 914 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 7/7 constraints. Problems are: Problem set: 123 solved, 914 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 3/10 constraints. Problems are: Problem set: 123 solved, 914 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 123 solved, 914 unsolved
At refinement iteration 3 (OVERLAPS) 917/1063 variables, 146/156 constraints. Problems are: Problem set: 123 solved, 914 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1063 variables, 104/260 constraints. Problems are: Problem set: 123 solved, 914 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1030 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1063 variables, 696/956 constraints. Problems are: Problem set: 215 solved, 822 unsolved
[2024-05-21 13:14:30] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2024-05-21 13:14:30] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-21 13:14:30] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-21 13:14:30] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-05-21 13:14:31] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-21 13:14:31] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2024-05-21 13:14:31] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2024-05-21 13:14:32] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-05-21 13:14:32] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1064 variables, and 965 constraints, problems are : Problem set: 215 solved, 822 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/147 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 696/1037 constraints, Known Traps: 12/12 constraints]
After SMT, in 64670ms problems are : Problem set: 215 solved, 822 unsolved
Search for dead transitions found 215 dead transitions in 64680ms
Found 215 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 215 transitions
Dead transitions reduction (with SMT) removed 215 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 147/147 places, 823/1038 transitions.
Graph (complete) has 1160 edges and 147 vertex of which 142 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 179 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 128 transition count 644
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 122 transition count 575
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 122 transition count 575
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 27 rules in 20 ms. Remains 122 /147 variables (removed 25) and now considering 575/823 (removed 248) transitions.
[2024-05-21 13:14:32] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
// Phase 1: matrix 524 rows 122 cols
[2024-05-21 13:14:32] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 13:14:33] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 13:14:33] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
[2024-05-21 13:14:33] [INFO ] Invariant cache hit.
[2024-05-21 13:14:33] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-21 13:14:33] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 122/147 places, 575/1038 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66364 ms. Remains : 122/147 places, 575/1038 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:14:33] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
Found an invariant !
This invariant on transitions {5=1, 350=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 350=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
[2024-05-21 13:14:33] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
// Phase 1: matrix 524 rows 121 cols
[2024-05-21 13:14:33] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1911 ms. (523 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1875 ms. (1066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
[2024-05-21 13:14:37] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
[2024-05-21 13:14:37] [INFO ] Invariant cache hit.
[2024-05-21 13:14:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:14:37] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-21 13:14:37] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-21 13:14:37] [INFO ] [Real]Added 82 Read/Feed constraints in 31 ms returned sat
[2024-05-21 13:14:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:14:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 13:14:37] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-21 13:14:37] [INFO ] [Nat]Added 82 Read/Feed constraints in 15 ms returned sat
[2024-05-21 13:14:38] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2024-05-21 13:14:38] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 1 ms to minimize.
[2024-05-21 13:14:38] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-05-21 13:14:38] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2024-05-21 13:14:38] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-21 13:14:38] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 13:14:38] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-21 13:14:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 840 ms
[2024-05-21 13:14:38] [INFO ] Computed and/alt/rep : 225/890/225 causal constraints (skipped 298 transitions) in 31 ms.
[2024-05-21 13:14:39] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-21 13:14:39] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-21 13:14:39] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 13:14:39] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-21 13:14:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 435 ms
[2024-05-21 13:14:39] [INFO ] Added : 27 causal constraints over 7 iterations in 658 ms. Result :sat
Minimization took 179 ms.
[2024-05-21 13:14:39] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:14:40] [INFO ] [Real]Absence check using state equation in 1091 ms returned sat
[2024-05-21 13:14:40] [INFO ] [Real]Added 82 Read/Feed constraints in 31 ms returned sat
[2024-05-21 13:14:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:14:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 13:14:41] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-21 13:14:41] [INFO ] [Nat]Added 82 Read/Feed constraints in 23 ms returned sat
[2024-05-21 13:14:41] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-21 13:14:41] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2024-05-21 13:14:41] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2024-05-21 13:14:41] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-05-21 13:14:41] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2024-05-21 13:14:41] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 2 ms to minimize.
[2024-05-21 13:14:42] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2024-05-21 13:14:42] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-21 13:14:42] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 13:14:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1126 ms
[2024-05-21 13:14:42] [INFO ] Computed and/alt/rep : 225/890/225 causal constraints (skipped 298 transitions) in 52 ms.
[2024-05-21 13:14:42] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-21 13:14:42] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2024-05-21 13:14:42] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-21 13:14:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2024-05-21 13:14:42] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 13:14:43] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-21 13:14:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2024-05-21 13:14:43] [INFO ] Added : 20 causal constraints over 6 iterations in 862 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, 1, 1]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 575/575 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 121/121 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 575/575 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2024-05-21 13:14:43] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
[2024-05-21 13:14:43] [INFO ] Invariant cache hit.
[2024-05-21 13:14:43] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 13:14:43] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
[2024-05-21 13:14:43] [INFO ] Invariant cache hit.
[2024-05-21 13:14:43] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-21 13:14:43] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-21 13:14:43] [INFO ] Redundant transitions in 5 ms returned []
Running 574 sub problems to find dead transitions.
[2024-05-21 13:14:43] [INFO ] Flow matrix only has 524 transitions (discarded 51 similar events)
[2024-05-21 13:14:43] [INFO ] Invariant cache hit.
[2024-05-21 13:14:43] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-05-21 13:14:46] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
Problem TDEAD350 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/8 constraints. Problems are: Problem set: 6 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 568 unsolved
Problem TDEAD232 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
At refinement iteration 3 (OVERLAPS) 524/645 variables, 121/129 constraints. Problems are: Problem set: 9 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 82/211 constraints. Problems are: Problem set: 9 solved, 565 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 0/211 constraints. Problems are: Problem set: 9 solved, 565 unsolved
At refinement iteration 6 (OVERLAPS) 0/645 variables, 0/211 constraints. Problems are: Problem set: 9 solved, 565 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 211 constraints, problems are : Problem set: 9 solved, 565 unsolved in 21034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 565 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 565 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 565 unsolved
At refinement iteration 3 (OVERLAPS) 524/645 variables, 121/129 constraints. Problems are: Problem set: 9 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 82/211 constraints. Problems are: Problem set: 9 solved, 565 unsolved
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 565/776 constraints. Problems are: Problem set: 47 solved, 527 unsolved
[2024-05-21 13:15:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 13:15:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 13:15:18] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 3/779 constraints. Problems are: Problem set: 57 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 779 constraints, problems are : Problem set: 57 solved, 517 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 565/574 constraints, Known Traps: 4/4 constraints]
After SMT, in 52228ms problems are : Problem set: 57 solved, 517 unsolved
Search for dead transitions found 57 dead transitions in 52237ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/121 places, 518/575 transitions.
Graph (complete) has 781 edges and 121 vertex of which 120 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 121 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 108 transition count 397
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 19 place count 102 transition count 342
Reduce places removed 2 places and 22 transitions.
Graph (complete) has 540 edges and 100 vertex of which 2 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.0 ms
Discarding 98 places :
Also discarding 320 output transitions
Drop transitions (Output transitions of discarded places.) removed 320 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 22 rules in 7 ms. Remains 2 /121 variables (removed 119) and now considering 0/518 (removed 518) transitions.
[2024-05-21 13:15:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 13:15:36] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 13:15:36] [INFO ] Invariant cache hit.
[2024-05-21 13:15:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/121 places, 0/575 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 52800 ms. Remains : 2/121 places, 0/575 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 381079 ms.
ITS solved all properties within timeout

BK_STOP 1716297336298

--------------------
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-q8m004"
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-q8m004, 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-171620398100397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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