Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:09 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-q3m002-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-01
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2023-05
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2023-09
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-11
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2023-12
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2023-14
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716331059628

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-q3m002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 22:37:41] [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:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:37:42] [INFO ] Load time of PNML (sax parser for PT used): 988 ms
[2024-05-21 22:37:42] [INFO ] Transformed 754 places.
[2024-05-21 22:37:42] [INFO ] Transformed 27370 transitions.
[2024-05-21 22:37:42] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 181 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (850 resets) in 3054 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (281 resets) in 419 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (242 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (276 resets) in 394 ms. (101 steps per ms) remains 6/6 properties
[2024-05-21 22:37:44] [INFO ] Flatten gal took : 659 ms
BEST_FIRST walk for 40003 steps (276 resets) in 533 ms. (74 steps per ms) remains 6/6 properties
[2024-05-21 22:37:44] [INFO ] Flatten gal took : 222 ms
BEST_FIRST walk for 40003 steps (212 resets) in 296 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (275 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
[2024-05-21 22:37:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14424883195683860729.gal : 202 ms
[2024-05-21 22:37:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7221808871321986333.prop : 4 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/ReachabilityCardinality14424883195683860729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7221808871321986333.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 ...329
Loading property file /tmp/ReachabilityCardinality7221808871321986333.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 30
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :30 after 224
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :224 after 874
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :874 after 2164
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2164 after 4734
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4734 after 9864
Interrupted probabilistic random walk after 70950 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 6
Probabilistic random walk after 70950 steps, saw 41000 distinct states, run finished after 3028 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-21 22:37:47] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-05-21 22:37:47] [INFO ] Computed 10 invariants in 113 ms
[2024-05-21 22:37:47] [INFO ] State equation strengthened by 255 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 77/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :9864 after 20114
At refinement iteration 3 (OVERLAPS) 2003/2094 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2094 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2094 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 732/2826 variables, 105/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2826 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2826 variables, 233/449 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2826 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/2835 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2835 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2835 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 47/2882 variables, 40/497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2882 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2882 variables, 7/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 505 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 77/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2003/2094 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2094 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2094 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 732/2826 variables, 105/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2826 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2826 variables, 233/449 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2826 variables, 5/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:37:53] [INFO ] Deduced a trap composed of 12 places in 531 ms of which 28 ms to minimize.
[2024-05-21 22:37:55] [INFO ] Deduced a trap composed of 27 places in 2085 ms of which 3 ms to minimize.
SMT process timed out in 8063ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 487 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 229/240 places, 2747/2769 transitions.
RANDOM walk for 40000 steps (14 resets) in 1080 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 380 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 329 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (26 resets) in 332 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (16 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (15 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :20114 after 40604
Interrupted probabilistic random walk after 85935 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 6
Probabilistic random walk after 85935 steps, saw 31360 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 22:38:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-21 22:38:00] [INFO ] Computed 8 invariants in 11 ms
[2024-05-21 22:38:00] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 77/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2002/2093 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2093 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2093 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 716/2809 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2809 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2809 variables, 226/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2809 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/2812 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2812 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2812 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 35/2847 variables, 35/477 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2847 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2847/2847 variables, and 478 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 77/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2002/2093 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2093 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2093 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 716/2809 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2809 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2809 variables, 226/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2809 variables, 5/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:38:04] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 1 ms to minimize.
[2024-05-21 22:38:05] [INFO ] Deduced a trap composed of 10 places in 555 ms of which 25 ms to minimize.
[2024-05-21 22:38:05] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 2 ms to minimize.
[2024-05-21 22:38:06] [INFO ] Deduced a trap composed of 30 places in 995 ms of which 2 ms to minimize.
[2024-05-21 22:38:06] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 2 ms to minimize.
[2024-05-21 22:38:07] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 4 ms to minimize.
[2024-05-21 22:38:07] [INFO ] Deduced a trap composed of 14 places in 352 ms of which 1 ms to minimize.
[2024-05-21 22:38:08] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 9 ms to minimize.
[2024-05-21 22:38:08] [INFO ] Deduced a trap composed of 47 places in 410 ms of which 1 ms to minimize.
[2024-05-21 22:38:08] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 2 ms to minimize.
[2024-05-21 22:38:09] [INFO ] Deduced a trap composed of 49 places in 319 ms of which 1 ms to minimize.
[2024-05-21 22:38:11] [INFO ] Deduced a trap composed of 48 places in 2564 ms of which 27 ms to minimize.
[2024-05-21 22:38:14] [INFO ] Deduced a trap composed of 51 places in 2570 ms of which 27 ms to minimize.
[2024-05-21 22:38:14] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 1 ms to minimize.
[2024-05-21 22:38:15] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 1 ms to minimize.
[2024-05-21 22:38:15] [INFO ] Deduced a trap composed of 48 places in 271 ms of which 1 ms to minimize.
[2024-05-21 22:38:15] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 1 ms to minimize.
[2024-05-21 22:38:16] [INFO ] Deduced a trap composed of 46 places in 301 ms of which 1 ms to minimize.
[2024-05-21 22:38:16] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 19/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2809 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/2812 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2812 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2812 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 35/2847 variables, 35/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2847 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2847 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:38:18] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
Problem BugTracking-PT-q3m002-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 18 (INCLUDED_ONLY) 0/2847 variables, 1/504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2847 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 22:38:19] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/2847 variables, 1/505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2847 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/2847 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2847/2847 variables, and 505 constraints, problems are : Problem set: 1 solved, 5 unsolved in 17946 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 21/21 constraints]
After SMT, in 19911ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3463 ms.
Support contains 14 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 44 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 229/229 places, 2747/2747 transitions.
RANDOM walk for 40000 steps (21 resets) in 876 ms. (45 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (13 resets) in 284 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (15 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (23 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (25 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 84967 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 5
Probabilistic random walk after 84967 steps, saw 31022 distinct states, run finished after 3014 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-21 22:38:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 22:38:27] [INFO ] Invariant cache hit.
[2024-05-21 22:38:27] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 77/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2002/2093 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2093 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2093 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 716/2809 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2809 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2809 variables, 226/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2809 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/2812 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2812 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2812 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 35/2847 variables, 35/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2847 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/2847 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2847/2847 variables, and 478 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3940 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 77/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2002/2093 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2093 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2093 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 716/2809 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2809 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2809 variables, 226/437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2809 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/2812 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2812 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2812 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 35/2847 variables, 35/481 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2847 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2847 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:38:33] [INFO ] Deduced a trap composed of 30 places in 339 ms of which 1 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2024-05-21 22:38:34] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2024-05-21 22:38:35] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2847 variables, 5/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:38:35] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 1 ms to minimize.
[2024-05-21 22:38:35] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2847 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 22:38:36] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2024-05-21 22:38:36] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2847 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2847 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2847 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2847/2847 variables, and 492 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6823 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints]
After SMT, in 10828ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10666 ms.
Support contains 14 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 65 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 79 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-21 22:38:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 22:38:49] [INFO ] Invariant cache hit.
[2024-05-21 22:38:49] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-21 22:38:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 22:38:49] [INFO ] Invariant cache hit.
[2024-05-21 22:38:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 22:38:52] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
[2024-05-21 22:38:52] [INFO ] Redundant transitions in 192 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-05-21 22:38:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 22:38:52] [INFO ] Invariant cache hit.
[2024-05-21 22:38:52] [INFO ] State equation strengthened by 241 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :40604 after 81574
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-05-21 22:39:46] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2024-05-21 22:39:49] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 5 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-05-21 22:39:50] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem 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
[2024-05-21 22:39:50] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 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 TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
[2024-05-21 22:39:51] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
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 TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
[2024-05-21 22:39:52] [INFO ] Deduced a trap composed of 9 places in 1340 ms of which 26 ms to minimize.
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 TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
[2024-05-21 22:39:52] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-05-21 22:39:52] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 2 ms to minimize.
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
[2024-05-21 22:39:58] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
Problem TDEAD2683 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 17 constraints, problems are : Problem set: 201 solved, 2545 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 201 solved, 2545 unsolved
SMT process timed out in 95442ms, After SMT, problems are : Problem set: 201 solved, 2545 unsolved
Search for dead transitions found 201 dead transitions in 95518ms
Found 201 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 201 transitions
Dead transitions reduction (with SMT) removed 201 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2546/2747 transitions.
Graph (complete) has 3114 edges and 229 vertex of which 221 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 9 places and 377 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 212 transition count 2169
Reduce places removed 9 places and 234 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 203 transition count 1935
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 196 transition count 1872
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 196 transition count 1872
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 33 rules in 50 ms. Remains 196 /229 variables (removed 33) and now considering 1872/2546 (removed 674) transitions.
[2024-05-21 22:40:28] [INFO ] Flow matrix only has 1769 transitions (discarded 103 similar events)
// Phase 1: matrix 1769 rows 196 cols
[2024-05-21 22:40:28] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 22:40:28] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-21 22:40:28] [INFO ] Flow matrix only has 1769 transitions (discarded 103 similar events)
[2024-05-21 22:40:28] [INFO ] Invariant cache hit.
[2024-05-21 22:40:31] [INFO ] State equation strengthened by 185 read => feed constraints.
[2024-05-21 22:40:33] [INFO ] Implicit Places using invariants and state equation in 4213 ms returned []
Implicit Place search using SMT with State Equation took 4869 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 196/229 places, 1872/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 103987 ms. Remains : 196/229 places, 1872/2747 transitions.
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2023-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityCardinality-2023-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (26 resets) in 516 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (22 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (14 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 127261 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 3
Probabilistic random walk after 127261 steps, saw 50668 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-21 22:40:36] [INFO ] Flow matrix only has 1769 transitions (discarded 103 similar events)
// Phase 1: matrix 1769 rows 191 cols
[2024-05-21 22:40:36] [INFO ] Computed 7 invariants in 15 ms
[2024-05-21 22:40:36] [INFO ] State equation strengthened by 185 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1049/1102 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1102 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 808/1910 variables, 88/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1910 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1910 variables, 178/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1910 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/1914 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1914 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1914 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 46/1960 variables, 46/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1960 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1960 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1960 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1960/1960 variables, and 383 constraints, problems are : Problem set: 0 solved, 3 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1049/1102 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1102 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 808/1910 variables, 88/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1910 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1910 variables, 178/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1910 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 22:40:37] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2024-05-21 22:40:38] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1910 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1910 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/1914 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1914 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1914 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 46/1960 variables, 46/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1960 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1960 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1960 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1960 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1960/1960 variables, and 388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 185/185 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3897 ms.
Support contains 9 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 1872/1872 transitions.
Applied a total of 0 rules in 34 ms. Remains 191 /191 variables (removed 0) and now considering 1872/1872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 191/191 places, 1872/1872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 1872/1872 transitions.
Applied a total of 0 rules in 35 ms. Remains 191 /191 variables (removed 0) and now considering 1872/1872 (removed 0) transitions.
[2024-05-21 22:40:42] [INFO ] Flow matrix only has 1769 transitions (discarded 103 similar events)
[2024-05-21 22:40:42] [INFO ] Invariant cache hit.
[2024-05-21 22:40:44] [INFO ] Implicit Places using invariants in 1873 ms returned []
[2024-05-21 22:40:44] [INFO ] Flow matrix only has 1769 transitions (discarded 103 similar events)
[2024-05-21 22:40:44] [INFO ] Invariant cache hit.
[2024-05-21 22:40:45] [INFO ] State equation strengthened by 185 read => feed constraints.
[2024-05-21 22:40:45] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
[2024-05-21 22:40:45] [INFO ] Redundant transitions in 100 ms returned []
Running 1871 sub problems to find dead transitions.
[2024-05-21 22:40:45] [INFO ] Flow matrix only has 1769 transitions (discarded 103 similar events)
[2024-05-21 22:40:46] [INFO ] Invariant cache hit.
[2024-05-21 22:40:46] [INFO ] State equation strengthened by 185 read => feed constraints.

BK_STOP 1716331253614

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-q3m002"
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-q3m002, 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-171620399300326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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