Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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-q8m002-ReachabilityCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-01
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-11
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-12
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2024-13
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716332594794

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-q8m002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:03:16] [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 23:03:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:03:17] [INFO ] Load time of PNML (sax parser for PT used): 1060 ms
[2024-05-21 23:03:17] [INFO ] Transformed 754 places.
[2024-05-21 23:03:17] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:03:17] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1275 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 164 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (895 resets) in 4068 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (261 resets) in 447 ms. (89 steps per ms) remains 9/9 properties
[2024-05-21 23:03:19] [INFO ] Flatten gal took : 1026 ms
BEST_FIRST walk for 40003 steps (215 resets) in 457 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (235 resets) in 490 ms. (81 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (254 resets) in 509 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (238 resets) in 273 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (207 resets) in 361 ms. (110 steps per ms) remains 9/9 properties
[2024-05-21 23:03:20] [INFO ] Flatten gal took : 722 ms
BEST_FIRST walk for 40003 steps (237 resets) in 382 ms. (104 steps per ms) remains 9/9 properties
[2024-05-21 23:03:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14346478732384217893.gal : 151 ms
[2024-05-21 23:03:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16347492915261821905.prop : 2 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/ReachabilityCardinality14346478732384217893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16347492915261821905.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 ...330
BEST_FIRST walk for 40002 steps (263 resets) in 456 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (205 resets) in 508 ms. (78 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality16347492915261821905.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :20 after 30
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :30 after 114
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :114 after 764
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :764 after 2054
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :2054 after 4624
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :4624 after 9754
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :9754 after 20004
Interrupted probabilistic random walk after 115782 steps, run timeout after 6004 ms. (steps per millisecond=19 ) properties seen :0 out of 9
Probabilistic random walk after 115782 steps, saw 66909 distinct states, run finished after 6017 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-21 23:03:27] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 23:03:27] [INFO ] Computed 10 invariants in 65 ms
[2024-05-21 23:03:27] [INFO ] State equation strengthened by 303 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, 9 unsolved
Problem BugTracking-PT-q8m002-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m002-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m002-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 112/133 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3558/3691 variables, 133/139 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3691 variables, 144/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3691 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 317/4008 variables, 146/429 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4008 variables, 3/432 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4008 variables, 159/591 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4008 variables, 0/591 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/4009 variables, 1/592 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4009 variables, 1/593 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/4009 variables, 0/593 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 593 constraints, problems are : Problem set: 3 solved, 6 unsolved in 4800 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 81/95 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 23:03:33] [INFO ] Deduced a trap composed of 24 places in 1355 ms of which 15 ms to minimize.
[2024-05-21 23:03:33] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 23:03:34] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2962/3057 variables, 95/102 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3057 variables, 134/236 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3057 variables, 0/236 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 923/3980 variables, 167/403 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3980 variables, 2/405 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3980 variables, 162/567 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3980 variables, 5/572 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 23:03:36] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3980 variables, 1/573 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3980 variables, 0/573 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 6/3986 variables, 3/576 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3986 variables, 3/579 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-21 23:03:37] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 1 ms to minimize.
SMT process timed out in 10474ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 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 278 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 278 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 276 transition count 3877
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :20004 after 40494
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 276 transition count 3873
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 272 transition count 3873
Applied a total of 15 rules in 450 ms. Remains 272 /280 variables (removed 8) and now considering 3873/3904 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 272/280 places, 3873/3904 transitions.
RANDOM walk for 40001 steps (912 resets) in 929 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (404 resets) in 437 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (269 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (270 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (252 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (274 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (268 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 60507 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 6
Probabilistic random walk after 60507 steps, saw 33834 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-21 23:03:41] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
// Phase 1: matrix 3701 rows 272 cols
[2024-05-21 23:03:42] [INFO ] Computed 9 invariants in 29 ms
[2024-05-21 23:03:42] [INFO ] State equation strengthened by 283 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) 75/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2363/2452 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2452 variables, 99/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2452 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1485/3937 variables, 147/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3937 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3937 variables, 184/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3937 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/3938 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3938 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3938 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 35/3973 variables, 35/563 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3973 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3973 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/3973 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3973/3973 variables, and 564 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2596 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 272/272 constraints, ReadFeed: 283/283 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) 75/89 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:03:45] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2024-05-21 23:03:45] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2024-05-21 23:03:45] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 1 ms to minimize.
[2024-05-21 23:03:45] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2363/2452 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2452 variables, 99/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2452 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1485/3937 variables, 147/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3937 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3937 variables, 184/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3937 variables, 5/535 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:03:48] [INFO ] Deduced a trap composed of 30 places in 642 ms of which 3 ms to minimize.
[2024-05-21 23:03:48] [INFO ] Deduced a trap composed of 21 places in 577 ms of which 3 ms to minimize.
[2024-05-21 23:03:49] [INFO ] Deduced a trap composed of 16 places in 391 ms of which 2 ms to minimize.
[2024-05-21 23:03:49] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 21 ms to minimize.
[2024-05-21 23:03:50] [INFO ] Deduced a trap composed of 59 places in 657 ms of which 1 ms to minimize.
[2024-05-21 23:03:50] [INFO ] Deduced a trap composed of 8 places in 387 ms of which 2 ms to minimize.
[2024-05-21 23:03:51] [INFO ] Deduced a trap composed of 10 places in 544 ms of which 1 ms to minimize.
[2024-05-21 23:03:52] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3937 variables, 8/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3937 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/3938 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3938 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:03:53] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3938 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3938 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 35/3973 variables, 35/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3973 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3973 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:03:56] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3973 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3973 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/3973 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3973/3973 variables, and 584 constraints, problems are : Problem set: 0 solved, 6 unsolved in 14659 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 272/272 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 14/14 constraints]
After SMT, in 17441ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 37261 ms.
Support contains 14 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 3873/3873 transitions.
Applied a total of 0 rules in 125 ms. Remains 272 /272 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 272/272 places, 3873/3873 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 3873/3873 transitions.
Applied a total of 0 rules in 137 ms. Remains 272 /272 variables (removed 0) and now considering 3873/3873 (removed 0) transitions.
[2024-05-21 23:04:36] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:04:36] [INFO ] Invariant cache hit.
[2024-05-21 23:04:37] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-21 23:04:37] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:04:37] [INFO ] Invariant cache hit.
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :40494 after 81464
[2024-05-21 23:04:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 23:04:44] [INFO ] Implicit Places using invariants and state equation in 6252 ms returned []
Implicit Place search using SMT with State Equation took 7250 ms to find 0 implicit places.
[2024-05-21 23:04:44] [INFO ] Redundant transitions in 401 ms returned []
Running 3871 sub problems to find dead transitions.
[2024-05-21 23:04:44] [INFO ] Flow matrix only has 3701 transitions (discarded 172 similar events)
[2024-05-21 23:04:44] [INFO ] Invariant cache hit.
[2024-05-21 23:04:44] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3871 unsolved
[2024-05-21 23:06:06] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
Problem TDEAD782 is UNSAT
[2024-05-21 23:06:06] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3973 variables, and 10 constraints, problems are : Problem set: 10 solved, 3861 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/272 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3871/2668 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 10 solved, 3861 unsolved
Problem TDEAD3799 is UNSAT
Problem TDEAD3805 is UNSAT
Problem TDEAD3811 is UNSAT
Problem TDEAD3817 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 2/10 constraints. Problems are: Problem set: 14 solved, 3857 unsolved
[2024-05-21 23:06:36] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2689 is UNSAT
Problem TDEAD2690 is UNSAT
[2024-05-21 23:06:36] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
Problem TDEAD2691 is UNSAT
[2024-05-21 23:06:36] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
Problem TDEAD2695 is UNSAT
[2024-05-21 23:06:37] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Problem TDEAD2717 is UNSAT
[2024-05-21 23:06:37] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3973 variables, and 15 constraints, problems are : Problem set: 58 solved, 3813 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/272 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2668 constraints, Known Traps: 7/7 constraints]
After SMT, in 120321ms problems are : Problem set: 58 solved, 3813 unsolved
Search for dead transitions found 58 dead transitions in 120369ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 272/272 places, 3815/3873 transitions.
Reduce places removed 12 places and 525 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 260 transition count 3290
Reduce places removed 10 places and 280 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 250 transition count 3010
Reduce places removed 12 places and 338 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 34 place count 238 transition count 2672
Reduce places removed 7 places and 185 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 41 place count 231 transition count 2487
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 230 transition count 2467
Deduced a syphon composed of 5 places in 4 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 230 transition count 2467
Deduced a syphon composed of 5 places in 2 ms
Applied a total of 43 rules in 83 ms. Remains 230 /272 variables (removed 42) and now considering 2467/3815 (removed 1348) transitions.
[2024-05-21 23:06:45] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 230 cols
[2024-05-21 23:06:45] [INFO ] Computed 14 invariants in 41 ms
[2024-05-21 23:06:45] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-21 23:06:45] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
[2024-05-21 23:06:45] [INFO ] Invariant cache hit.
[2024-05-21 23:06:45] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:06:46] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 230/272 places, 2467/3873 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 130126 ms. Remains : 230/272 places, 2467/3873 transitions.
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (926 resets) in 420 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (293 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (271 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (269 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 120564 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 120564 steps, saw 67465 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-21 23:06:50] [INFO ] Flow matrix only has 2356 transitions (discarded 111 similar events)
// Phase 1: matrix 2356 rows 225 cols
[2024-05-21 23:06:50] [INFO ] Computed 9 invariants in 21 ms
[2024-05-21 23:06:50] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1809/1894 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1894 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1894 variables, 155/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1894 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/1903 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1903 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1903 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 457/2360 variables, 109/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2360 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2360 variables, 17/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2360 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 184/2544 variables, 25/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2544 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2544 variables, 28/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2544 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 37/2581 variables, 25/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2581 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2581 variables, 9/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2581 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/2581 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2581/2581 variables, and 445 constraints, problems are : Problem set: 0 solved, 3 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 225/225 constraints, ReadFeed: 211/211 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1809/1894 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1894 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1894 variables, 155/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1894 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/1903 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1903 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1903 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 457/2360 variables, 109/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2360 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2360 variables, 17/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2360 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:06:52] [INFO ] Deduced a trap composed of 37 places in 360 ms of which 2 ms to minimize.
[2024-05-21 23:06:52] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 2 ms to minimize.
[2024-05-21 23:06:52] [INFO ] Deduced a trap composed of 15 places in 368 ms of which 1 ms to minimize.
[2024-05-21 23:06:53] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 1 ms to minimize.
[2024-05-21 23:06:53] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2360 variables, 5/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:06:53] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2360 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2360 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 184/2544 variables, 25/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2544 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2544 variables, 28/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2544 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 37/2581 variables, 25/444 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2581 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2581 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:06:54] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 2 ms to minimize.
[2024-05-21 23:06:54] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 2 ms to minimize.
[2024-05-21 23:06:54] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2581 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2581 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2581 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2581/2581 variables, and 457 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4161 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 225/225 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 4928ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 807 ms.
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2467/2467 transitions.
Graph (complete) has 3082 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 224 transition count 2465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 222 transition count 2465
Applied a total of 5 rules in 146 ms. Remains 222 /225 variables (removed 3) and now considering 2465/2467 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 222/225 places, 2465/2467 transitions.
RANDOM walk for 40000 steps (8 resets) in 629 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 143757 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 143757 steps, saw 60173 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-05-21 23:06:59] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
// Phase 1: matrix 2354 rows 222 cols
[2024-05-21 23:06:59] [INFO ] Computed 8 invariants in 11 ms
[2024-05-21 23:06:59] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1808/1893 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1893 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1893 variables, 155/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1893 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/1899 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1899 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1899 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 460/2359 variables, 109/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2359 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2359 variables, 17/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2359 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 194/2553 variables, 25/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2553 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2553 variables, 37/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2553 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 23/2576 variables, 23/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2576 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/2576 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2576/2576 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1808/1893 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1893 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1893 variables, 155/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1893 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/1899 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1899 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1899 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 460/2359 variables, 109/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2359 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2359 variables, 17/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2359 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 1 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 1 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 2 ms to minimize.
[2024-05-21 23:07:02] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 1 ms to minimize.
[2024-05-21 23:07:02] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2359 variables, 5/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:07:02] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2359 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2359 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 194/2553 variables, 25/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2553 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2553 variables, 37/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2553 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 23/2576 variables, 23/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2576 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:07:03] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 2 ms to minimize.
[2024-05-21 23:07:03] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2576 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2576 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/2576 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2576/2576 variables, and 452 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4189 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 222/222 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 5008ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 592 ms.
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 44 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 222/222 places, 2465/2465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 2465/2465 transitions.
Applied a total of 0 rules in 43 ms. Remains 222 /222 variables (removed 0) and now considering 2465/2465 (removed 0) transitions.
[2024-05-21 23:07:05] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 23:07:05] [INFO ] Invariant cache hit.
[2024-05-21 23:07:05] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-21 23:07:05] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 23:07:05] [INFO ] Invariant cache hit.
[2024-05-21 23:07:05] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-21 23:07:06] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2024-05-21 23:07:06] [INFO ] Redundant transitions in 46 ms returned []
Running 2464 sub problems to find dead transitions.
[2024-05-21 23:07:06] [INFO ] Flow matrix only has 2354 transitions (discarded 111 similar events)
[2024-05-21 23:07:06] [INFO ] Invariant cache hit.
[2024-05-21 23:07:06] [INFO ] State equation strengthened by 211 read => feed constraints.

BK_STOP 1716332832396

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

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