Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399300350.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 itstools
Input is BugTracking-PT-q3m016, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399300350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.9K 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 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716331690028

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 22:48:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:48:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:48:12] [INFO ] Load time of PNML (sax parser for PT used): 831 ms
[2024-05-21 22:48:12] [INFO ] Transformed 754 places.
[2024-05-21 22:48:12] [INFO ] Transformed 27370 transitions.
[2024-05-21 22:48:12] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1053 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 130 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (103 resets) in 3878 ms. (10 steps per ms) remains 5/6 properties
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 22:48:13] [INFO ] Flatten gal took : 614 ms
BEST_FIRST walk for 40003 steps (19 resets) in 445 ms. (89 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 325 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (25 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
[2024-05-21 22:48:14] [INFO ] Flatten gal took : 362 ms
BEST_FIRST walk for 40003 steps (28 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (23 resets) in 300 ms. (132 steps per ms) remains 5/5 properties
[2024-05-21 22:48:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17508756145156076424.gal : 88 ms
[2024-05-21 22:48:14] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 22:48:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17194107530319047951.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17508756145156076424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17194107530319047951.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 2642 rows 240 cols
[2024-05-21 22:48:14] [INFO ] Computed 10 invariants in 58 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2024-05-21 22:48:14] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality17194107530319047951.prop.
At refinement iteration 1 (OVERLAPS) 77/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1776/1874 variables, 98/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :20 after 56
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :56 after 165
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :165 after 680
At refinement iteration 4 (INCLUDED_ONLY) 0/1874 variables, 123/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :680 after 53142
At refinement iteration 5 (INCLUDED_ONLY) 0/1874 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :53142 after 302175
At refinement iteration 6 (OVERLAPS) 998/2872 variables, 132/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2872 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2872 variables, 132/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :302175 after 799272
At refinement iteration 9 (INCLUDED_ONLY) 0/2872 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/2875 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2875 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2875 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 7/2882 variables, 7/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 505 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1717 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 77/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:48:16] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 23 ms to minimize.
[2024-05-21 22:48:16] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 2 ms to minimize.
[2024-05-21 22:48:16] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1776/1874 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1874 variables, 123/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:48:17] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1874 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :799272 after 1.7925e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/1874 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 998/2872 variables, 132/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2872 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2872 variables, 132/497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2872 variables, 5/502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:48:19] [INFO ] Deduced a trap composed of 18 places in 406 ms of which 24 ms to minimize.
[2024-05-21 22:48:19] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 2 ms to minimize.
[2024-05-21 22:48:20] [INFO ] Deduced a trap composed of 12 places in 476 ms of which 2 ms to minimize.
[2024-05-21 22:48:20] [INFO ] Deduced a trap composed of 14 places in 536 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2872 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2872/2882 variables, and 506 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 230/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 6973ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 238 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 238 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 236 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 236 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 231 transition count 2748
Applied a total of 17 rules in 486 ms. Remains 231 /240 variables (removed 9) and now considering 2748/2769 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 517 ms. Remains : 231/240 places, 2748/2769 transitions.
RANDOM walk for 40006 steps (8 resets) in 566 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 91660 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 5
Probabilistic random walk after 91660 steps, saw 63451 distinct states, run finished after 3026 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-21 22:48:25] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 231 cols
[2024-05-21 22:48:25] [INFO ] Computed 9 invariants in 14 ms
[2024-05-21 22:48:25] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 75/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1773/1869 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1869 variables, 122/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1869 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 974/2843 variables, 128/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2843 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2843 variables, 119/474 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2843 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 7/2850 variables, 7/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2850 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/2850 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2850/2850 variables, and 481 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 231/231 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 75/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1773/1869 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1869 variables, 122/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:48:28] [INFO ] Deduced a trap composed of 19 places in 347 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1869 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1869 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 974/2843 variables, 128/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2843 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2843 variables, 119/475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2843 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:48:29] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-21 22:48:29] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2024-05-21 22:48:30] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2843 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2843 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 7/2850 variables, 7/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2850 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/2850 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2850/2850 variables, and 490 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4922 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 231/231 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 6708ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.7925e+06 after 3.77798e+06
Parikh walk visited 0 properties in 3639 ms.
Support contains 21 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2748/2748 transitions.
Applied a total of 0 rules in 125 ms. Remains 231 /231 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 231/231 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2748/2748 transitions.
Applied a total of 0 rules in 74 ms. Remains 231 /231 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2024-05-21 22:48:36] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-21 22:48:36] [INFO ] Invariant cache hit.
[2024-05-21 22:48:37] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-21 22:48:37] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-21 22:48:37] [INFO ] Invariant cache hit.
[2024-05-21 22:48:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 22:48:39] [INFO ] Implicit Places using invariants and state equation in 2543 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
[2024-05-21 22:48:39] [INFO ] Redundant transitions in 202 ms returned []
Running 2747 sub problems to find dead transitions.
[2024-05-21 22:48:39] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-21 22:48:39] [INFO ] Invariant cache hit.
[2024-05-21 22:48:39] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2747 unsolved
[2024-05-21 22:49:22] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
[2024-05-21 22:49:29] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
[2024-05-21 22:49:29] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
[2024-05-21 22:49:30] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
[2024-05-21 22:49:30] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 7 ms to minimize.
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
[2024-05-21 22:49:30] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 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 TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 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 TDEAD1595 is UNSAT
Problem TDEAD1596 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 TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 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 TDEAD1615 is UNSAT
Problem TDEAD1616 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 TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
[2024-05-21 22:49:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
[2024-05-21 22:49:31] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1793 is UNSAT
[2024-05-21 22:49:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 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
[2024-05-21 22:49:31] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 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
[2024-05-21 22:49:31] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
Problem TDEAD1832 is UNSAT
[2024-05-21 22:49:36] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Problem TDEAD2696 is UNSAT
[2024-05-21 22:49:36] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 13/21 constraints. Problems are: Problem set: 506 solved, 2241 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2850 variables, and 21 constraints, problems are : Problem set: 506 solved, 2241 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/231 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2747/2747 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 506 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 506 solved, 2241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 13/20 constraints. Problems are: Problem set: 506 solved, 2241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/20 constraints. Problems are: Problem set: 506 solved, 2241 unsolved
At refinement iteration 3 (OVERLAPS) 9/231 variables, 2/22 constraints. Problems are: Problem set: 506 solved, 2241 unsolved
[2024-05-21 22:49:55] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 26 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem 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 TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :3.77798e+06 after 7.74797e+06
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 TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 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 TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 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 TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 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 TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
[2024-05-21 22:49:57] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
[2024-05-21 22:49:57] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
[2024-05-21 22:49:58] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
[2024-05-21 22:49:58] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
[2024-05-21 22:49:58] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 7 ms to minimize.
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 6/28 constraints. Problems are: Problem set: 1055 solved, 1692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/2850 variables, and 28 constraints, problems are : Problem set: 1055 solved, 1692 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/231 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2747 constraints, Known Traps: 19/19 constraints]
After SMT, in 91519ms problems are : Problem set: 1055 solved, 1692 unsolved
Search for dead transitions found 1055 dead transitions in 91630ms
Found 1055 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1055 transitions
Dead transitions reduction (with SMT) removed 1055 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/231 places, 1693/2748 transitions.
Graph (complete) has 2209 edges and 231 vertex of which 217 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Reduce places removed 48 places and 881 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 169 transition count 812
Reduce places removed 28 places and 210 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 77 place count 141 transition count 602
Reduce places removed 10 places and 123 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 87 place count 131 transition count 479
Reduce places removed 10 places and 77 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 97 place count 121 transition count 402
Reduce places removed 6 places and 35 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 103 place count 115 transition count 367
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 105 place count 113 transition count 356
Reduce places removed 0 places and 9 transitions.
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 112 place count 106 transition count 306
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 119 place count 106 transition count 306
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 120 place count 105 transition count 297
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 121 place count 105 transition count 297
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 121 rules in 39 ms. Remains 105 /231 variables (removed 126) and now considering 297/1693 (removed 1396) transitions.
[2024-05-21 22:50:11] [INFO ] Flow matrix only has 270 transitions (discarded 27 similar events)
// Phase 1: matrix 270 rows 105 cols
[2024-05-21 22:50:11] [INFO ] Computed 18 invariants in 25 ms
[2024-05-21 22:50:11] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 22:50:11] [INFO ] Flow matrix only has 270 transitions (discarded 27 similar events)
[2024-05-21 22:50:11] [INFO ] Invariant cache hit.
[2024-05-21 22:50:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 22:50:11] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 105/231 places, 297/2748 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 95606 ms. Remains : 105/231 places, 297/2748 transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40032 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 412245 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 412245 steps, saw 285366 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2024-05-21 22:50:14] [INFO ] Flow matrix only has 270 transitions (discarded 27 similar events)
// Phase 1: matrix 270 rows 95 cols
[2024-05-21 22:50:14] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 22:50:14] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 104/118 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 208/326 variables, 51/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 26/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/334 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 31/365 variables, 26/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 104/118 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 208/326 variables, 51/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 26/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/334 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 31/365 variables, 26/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/365 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 294 ms.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 297/297 transitions.
Graph (complete) has 518 edges and 95 vertex of which 92 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 92 /95 variables (removed 3) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 92/95 places, 297/297 transitions.
RANDOM walk for 40012 steps (8 resets) in 62 ms. (635 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 457828 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 2
Probabilistic random walk after 457828 steps, saw 316915 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2024-05-21 22:50:18] [INFO ] Flow matrix only has 270 transitions (discarded 27 similar events)
// Phase 1: matrix 270 rows 92 cols
[2024-05-21 22:50:18] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 22:50:18] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/105 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 216/321 variables, 51/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/323 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 39/362 variables, 32/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/362 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/105 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 216/321 variables, 51/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:50:19] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/323 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 39/362 variables, 32/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/362 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 418 ms.
Support contains 6 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 297/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 297/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-21 22:50:19] [INFO ] Flow matrix only has 270 transitions (discarded 27 similar events)
[2024-05-21 22:50:19] [INFO ] Invariant cache hit.
[2024-05-21 22:50:19] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 22:50:19] [INFO ] Flow matrix only has 270 transitions (discarded 27 similar events)
[2024-05-21 22:50:19] [INFO ] Invariant cache hit.
[2024-05-21 22:50:19] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 22:50:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-21 22:50:19] [INFO ] Redundant transitions in 4 ms returned []
Running 296 sub problems to find dead transitions.
[2024-05-21 22:50:19] [INFO ] Flow matrix only has 270 transitions (discarded 27 similar events)
[2024-05-21 22:50:19] [INFO ] Invariant cache hit.
[2024-05-21 22:50:19] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-21 22:50:20] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-21 22:50:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:50:21] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 3/9 constraints. Problems are: Problem set: 6 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 290 unsolved
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 3 (OVERLAPS) 270/362 variables, 92/101 constraints. Problems are: Problem set: 15 solved, 281 unsolved
Problem TDEAD119 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 45/146 constraints. Problems are: Problem set: 16 solved, 280 unsolved
[2024-05-21 22:50:23] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/147 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/147 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/362 variables, 0/147 constraints. Problems are: Problem set: 22 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 147 constraints, problems are : Problem set: 22 solved, 274 unsolved in 7009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 22 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 2/7 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 2/92 variables, 1/8 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/10 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 270/362 variables, 92/102 constraints. Problems are: Problem set: 22 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 45/147 constraints. Problems are: Problem set: 22 solved, 274 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 274/421 constraints. Problems are: Problem set: 31 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/421 constraints. Problems are: Problem set: 31 solved, 265 unsolved
[2024-05-21 22:50:33] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/362 variables, 1/422 constraints. Problems are: Problem set: 31 solved, 265 unsolved
[2024-05-21 22:50:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 1/423 constraints. Problems are: Problem set: 31 solved, 265 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/423 constraints. Problems are: Problem set: 31 solved, 265 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/423 constraints. Problems are: Problem set: 31 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 423 constraints, problems are : Problem set: 31 solved, 265 unsolved in 18994 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 274/296 constraints, Known Traps: 6/6 constraints]
After SMT, in 26358ms problems are : Problem set: 31 solved, 265 unsolved
Search for dead transitions found 31 dead transitions in 26363ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/92 places, 266/297 transitions.
Graph (complete) has 452 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 87 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 87 transition count 246
Applied a total of 5 rules in 19 ms. Remains 87 /92 variables (removed 5) and now considering 246/266 (removed 20) transitions.
[2024-05-21 22:50:46] [INFO ] Flow matrix only has 228 transitions (discarded 18 similar events)
// Phase 1: matrix 228 rows 87 cols
[2024-05-21 22:50:46] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 22:50:46] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-21 22:50:46] [INFO ] Flow matrix only has 228 transitions (discarded 18 similar events)
[2024-05-21 22:50:46] [INFO ] Invariant cache hit.
[2024-05-21 22:50:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 22:50:46] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 87/92 places, 246/297 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27068 ms. Remains : 87/92 places, 246/297 transitions.
RANDOM walk for 40013 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 609603 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Probabilistic random walk after 609603 steps, saw 421976 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :0
[2024-05-21 22:50:49] [INFO ] Flow matrix only has 228 transitions (discarded 18 similar events)
[2024-05-21 22:50:49] [INFO ] Invariant cache hit.
[2024-05-21 22:50:49] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/118 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 166/284 variables, 45/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 24/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/286 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 29/315 variables, 25/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/315 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/118 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 166/284 variables, 45/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 24/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/286 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 29/315 variables, 25/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/315 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 265ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA BugTracking-PT-q3m016-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 95 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 246/246 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 240
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 86 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 85 transition count 239
Applied a total of 4 rules in 8 ms. Remains 85 /87 variables (removed 2) and now considering 239/246 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 85/87 places, 239/246 transitions.
RANDOM walk for 40014 steps (8 resets) in 56 ms. (702 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1255408 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 1
Probabilistic random walk after 1255408 steps, saw 735687 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
[2024-05-21 22:50:53] [INFO ] Flow matrix only has 220 transitions (discarded 19 similar events)
// Phase 1: matrix 220 rows 85 cols
[2024-05-21 22:50:53] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 22:50:53] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/92 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/156 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 127/283 variables, 19/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/285 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/286 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/286 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/286 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 19/305 variables, 19/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/305 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/305 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/305 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/92 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/156 variables, 32/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 127/283 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 27/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:50:53] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/285 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/285 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/285 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/286 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/286 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/286 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 19/305 variables, 19/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/305 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:50:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-21 22:50:53] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/305 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/305 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/305 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 239/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 239/239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 239/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-05-21 22:50:53] [INFO ] Flow matrix only has 220 transitions (discarded 19 similar events)
[2024-05-21 22:50:53] [INFO ] Invariant cache hit.
[2024-05-21 22:50:54] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 22:50:54] [INFO ] Flow matrix only has 220 transitions (discarded 19 similar events)
[2024-05-21 22:50:54] [INFO ] Invariant cache hit.
[2024-05-21 22:50:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 22:50:54] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-21 22:50:54] [INFO ] Redundant transitions in 1 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-21 22:50:54] [INFO ] Flow matrix only has 220 transitions (discarded 19 similar events)
[2024-05-21 22:50:54] [INFO ] Invariant cache hit.
[2024-05-21 22:50:54] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 220/305 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 45/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/305 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 138 constraints, problems are : Problem set: 0 solved, 238 unsolved in 4235 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 220/305 variables, 85/93 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 45/138 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 238/376 constraints. Problems are: Problem set: 3 solved, 235 unsolved
[2024-05-21 22:51:00] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 1/377 constraints. Problems are: Problem set: 3 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/377 constraints. Problems are: Problem set: 3 solved, 235 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/377 constraints. Problems are: Problem set: 3 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 377 constraints, problems are : Problem set: 3 solved, 235 unsolved in 7759 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 1/1 constraints]
After SMT, in 12184ms problems are : Problem set: 3 solved, 235 unsolved
Search for dead transitions found 3 dead transitions in 12187ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/85 places, 236/239 transitions.
Reduce places removed 2 places and 14 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 222
Applied a total of 2 rules in 3 ms. Remains 83 /85 variables (removed 2) and now considering 222/236 (removed 14) transitions.
[2024-05-21 22:51:06] [INFO ] Flow matrix only has 205 transitions (discarded 17 similar events)
// Phase 1: matrix 205 rows 83 cols
[2024-05-21 22:51:06] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 22:51:06] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 22:51:06] [INFO ] Flow matrix only has 205 transitions (discarded 17 similar events)
[2024-05-21 22:51:06] [INFO ] Invariant cache hit.
[2024-05-21 22:51:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 22:51:06] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/85 places, 222/239 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12961 ms. Remains : 83/85 places, 222/239 transitions.
RANDOM walk for 40007 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1394262 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :0 out of 1
Probabilistic random walk after 1394262 steps, saw 780606 distinct states, run finished after 3002 ms. (steps per millisecond=464 ) properties seen :0
[2024-05-21 22:51:09] [INFO ] Flow matrix only has 205 transitions (discarded 17 similar events)
[2024-05-21 22:51:09] [INFO ] Invariant cache hit.
[2024-05-21 22:51:09] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/83 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/85 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/147 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/267 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/269 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/270 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/270 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/270 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 18/288 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/288 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/288 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/288 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/83 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/85 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/147 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:51:09] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 120/267 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 27/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/267 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/269 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/269 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/270 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/270 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/270 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/288 variables, 18/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/288 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:51:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/288 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/288 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/288 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 83/83 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-21 22:51:10] [INFO ] Flow matrix only has 205 transitions (discarded 17 similar events)
[2024-05-21 22:51:10] [INFO ] Invariant cache hit.
[2024-05-21 22:51:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 22:51:10] [INFO ] Flow matrix only has 205 transitions (discarded 17 similar events)
[2024-05-21 22:51:10] [INFO ] Invariant cache hit.
[2024-05-21 22:51:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 22:51:10] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-21 22:51:10] [INFO ] Redundant transitions in 0 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-21 22:51:10] [INFO ] Flow matrix only has 205 transitions (discarded 17 similar events)
[2024-05-21 22:51:10] [INFO ] Invariant cache hit.
[2024-05-21 22:51:10] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 205/288 variables, 83/91 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 45/136 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 136 constraints, problems are : Problem set: 0 solved, 221 unsolved in 3772 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 205/288 variables, 83/91 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 45/136 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 221/357 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 22:51:16] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/288 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 358 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 12151ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 12154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12387 ms. Remains : 83/83 places, 222/222 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 335 edges and 83 vertex of which 81 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 81 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 19 place count 81 transition count 203
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 80 transition count 203
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 31 place count 70 transition count 161
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 70 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 69 transition count 160
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 68 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 67 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 67 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 67 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 65 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 63 transition count 156
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 60 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 67 place count 56 transition count 158
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 56 transition count 154
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 52 transition count 154
Applied a total of 75 rules in 35 ms. Remains 52 /83 variables (removed 31) and now considering 154/222 (removed 68) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 52 cols
[2024-05-21 22:51:22] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 22:51:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 22:51:22] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 22:51:22] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-21 22:51:22] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2024-05-21 22:51:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:51:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:51:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4397628973571449029.gal : 4 ms
[2024-05-21 22:51:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7232909440109484296.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4397628973571449029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7232909440109484296.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7232909440109484296.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 186
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :186 after 747
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :747 after 1852
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1852 after 4045
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4045 after 8414
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8414 after 17135
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :17135 after 34560
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :34560 after 69393
Detected timeout of ITS tools.
[2024-05-21 22:51:37] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:51:37] [INFO ] Applying decomposition
[2024-05-21 22:51:37] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3384026705548886243.txt' '-o' '/tmp/graph3384026705548886243.bin' '-w' '/tmp/graph3384026705548886243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3384026705548886243.bin' '-l' '-1' '-v' '-w' '/tmp/graph3384026705548886243.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:51:37] [INFO ] Decomposing Gal with order
[2024-05-21 22:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:51:37] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-21 22:51:38] [INFO ] Flatten gal took : 54 ms
[2024-05-21 22:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 3 ms.
[2024-05-21 22:51:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10864627551855258824.gal : 4 ms
[2024-05-21 22:51:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5594920877020921547.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10864627551855258824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5594920877020921547.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5594920877020921547.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 238
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :238 after 3583
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3583 after 30940
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :30940 after 4.27129e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.27129e+06 after 4.95351e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.95351e+08 after 8.20661e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.20661e+10 after 1.82321e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.82321e+13 after 4.136e+15
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30593 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 22:51:53] [INFO ] Flatten gal took : 191 ms
[2024-05-21 22:51:53] [INFO ] Applying decomposition
[2024-05-21 22:51:53] [INFO ] Flatten gal took : 153 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14842498795342439651.txt' '-o' '/tmp/graph14842498795342439651.bin' '-w' '/tmp/graph14842498795342439651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14842498795342439651.bin' '-l' '-1' '-v' '-w' '/tmp/graph14842498795342439651.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:51:53] [INFO ] Decomposing Gal with order
[2024-05-21 22:51:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:51:54] [INFO ] Removed a total of 399 redundant transitions.
[2024-05-21 22:51:54] [INFO ] Flatten gal took : 345 ms
[2024-05-21 22:51:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 301 labels/synchronizations in 21 ms.
[2024-05-21 22:51:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8426042173387043601.gal : 30 ms
[2024-05-21 22:51:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1085866795083593213.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8426042173387043601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1085866795083593213.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1085866795083593213.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 1785
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1785 after 2907
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2907 after 11679
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11679 after 12615
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12615 after 12788
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12788 after 14756
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :14756 after 15724
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :15724 after 95792
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :95792 after 100937
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :100937 after 141909
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :141909 after 363178
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :363178 after 1.3787e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.3787e+06 after 5.46522e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :5.46522e+06 after 1.87235e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.87235e+07 after 2.99428e+07

BK_STOP 1716332241204

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-q3m016"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BugTracking-PT-q3m016, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399300350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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