Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333484460

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 23:18:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:18:06] [INFO ] Load time of PNML (sax parser for PT used): 770 ms
[2024-05-21 23:18:06] [INFO ] Transformed 754 places.
[2024-05-21 23:18:06] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:18:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 998 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 110 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (11 resets) in 1772 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 498 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
[2024-05-21 23:18:08] [INFO ] Flatten gal took : 623 ms
[2024-05-21 23:18:08] [INFO ] Flatten gal took : 264 ms
[2024-05-21 23:18:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3245607006523613892.gal : 123 ms
[2024-05-21 23:18:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9097666108356387743.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3245607006523613892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9097666108356387743.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9097666108356387743.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :35 after 84
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :84 after 286
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :286 after 1140
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1140 after 5456
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :5456 after 32509
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :32509 after 221815
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :221815 after 1.61056e+06
Interrupted probabilistic random walk after 100501 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 4
Probabilistic random walk after 100501 steps, saw 48208 distinct states, run finished after 3006 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-21 23:18:11] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 23:18:11] [INFO ] Computed 10 invariants in 40 ms
[2024-05-21 23:18:11] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 23:18:12] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 9 ms to minimize.
[2024-05-21 23:18:12] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 3 ms to minimize.
[2024-05-21 23:18:12] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 1 ms to minimize.
[2024-05-21 23:18:12] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
[2024-05-21 23:18:12] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 9 ms to minimize.
Problem BugTracking-PT-q8m256-ReachabilityFireability-2023-05 is UNSAT
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2023-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q8m256-ReachabilityFireability-2023-15 is UNSAT
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2023-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3005/3129 variables, 124/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3129 variables, 222/357 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3129 variables, 0/357 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 801/3930 variables, 112/469 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3930 variables, 67/536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3930 variables, 0/536 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/3937 variables, 2/538 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3937 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 72/4009 variables, 44/582 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4009 variables, 2/584 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4009 variables, 14/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4009 variables, 0/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4009 variables, 0/598 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4009/4009 variables, and 598 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2814 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 109/122 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 23:18:14] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3002/3124 variables, 122/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3124 variables, 222/356 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 23:18:15] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:18:15] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 2/358 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3124 variables, 0/358 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 806/3930 variables, 114/472 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3930 variables, 67/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3930 variables, 0/539 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/3937 variables, 2/541 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 23:18:16] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3937 variables, 1/542 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3937 variables, 0/542 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 72/4009 variables, 44/586 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4009 variables, 2/588 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4009 variables, 14/602 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-21 23:18:17] [INFO ] Deduced a trap composed of 65 places in 362 ms of which 1 ms to minimize.
[2024-05-21 23:18:17] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 2 ms to minimize.
[2024-05-21 23:18:18] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4009 variables, 3/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4009 variables, 0/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/4009 variables, 0/605 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4009/4009 variables, and 605 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 280/280 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 7487ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 856 ms.
Support contains 13 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 270 transition count 3872
Applied a total of 17 rules in 669 ms. Remains 270 /280 variables (removed 10) and now considering 3872/3904 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 270/280 places, 3872/3904 transitions.
RANDOM walk for 40067 steps (16 resets) in 779 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.61056e+06 after 8.99017e+09
Interrupted probabilistic random walk after 87152 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 2
Probabilistic random walk after 87152 steps, saw 57531 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-21 23:18:23] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2024-05-21 23:18:23] [INFO ] Computed 8 invariants in 22 ms
[2024-05-21 23:18:23] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:18:24] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 7 ms to minimize.
[2024-05-21 23:18:24] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2940/3048 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3048 variables, 170/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3048 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 849/3897 variables, 111/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3897 variables, 106/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3897 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/3900 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3900 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3900 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 70/3970 variables, 50/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3970 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3970 variables, 7/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3970 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/3970 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3970/3970 variables, and 563 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:18:26] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2940/3048 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3048 variables, 170/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:18:27] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2024-05-21 23:18:27] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3048 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3048 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 849/3897 variables, 111/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3897 variables, 106/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:18:29] [INFO ] Deduced a trap composed of 69 places in 426 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3897 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3897 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/3900 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3900 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3900 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 70/3970 variables, 50/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3970 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3970 variables, 7/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:18:30] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 1 ms to minimize.
[2024-05-21 23:18:30] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3970 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3970 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3970/3970 variables, and 569 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 270/270 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 8/8 constraints]
After SMT, in 7819ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 13 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 111 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 138 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2024-05-21 23:18:32] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 23:18:32] [INFO ] Invariant cache hit.
[2024-05-21 23:18:32] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-05-21 23:18:33] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 23:18:33] [INFO ] Invariant cache hit.
[2024-05-21 23:18:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 23:18:35] [INFO ] Implicit Places using invariants and state equation in 2758 ms returned []
Implicit Place search using SMT with State Equation took 3538 ms to find 0 implicit places.
[2024-05-21 23:18:36] [INFO ] Redundant transitions in 336 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 23:18:36] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2024-05-21 23:18:36] [INFO ] Invariant cache hit.
[2024-05-21 23:18:36] [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, 3870 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/3970 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30129 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2024-05-21 23:20:37] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:20:37] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
[2024-05-21 23:20:37] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
[2024-05-21 23:20:37] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem 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 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
[2024-05-21 23:20:37] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
Problem TDEAD2690 is UNSAT
Problem TDEAD2691 is UNSAT
[2024-05-21 23:20:37] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
Problem TDEAD2692 is UNSAT
Problem TDEAD2693 is UNSAT
[2024-05-21 23:20:38] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
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 TDEAD2705 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2707 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 TDEAD2717 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2753 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2755 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2757 is UNSAT
Problem TDEAD2758 is UNSAT
Problem TDEAD2759 is UNSAT
Problem TDEAD2760 is UNSAT
Problem TDEAD2761 is UNSAT
Problem TDEAD2762 is UNSAT
Problem TDEAD2763 is UNSAT
Problem TDEAD2768 is UNSAT
Problem TDEAD2769 is UNSAT
Problem TDEAD2770 is UNSAT
Problem TDEAD2771 is UNSAT
Problem TDEAD2772 is UNSAT
Problem TDEAD2773 is UNSAT
Problem TDEAD2774 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2776 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2779 is UNSAT
Problem TDEAD2780 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2791 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2793 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2807 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2809 is UNSAT
Problem TDEAD2810 is UNSAT
Problem TDEAD2811 is UNSAT
Problem TDEAD2812 is UNSAT
Problem TDEAD2813 is UNSAT
Problem TDEAD2814 is UNSAT
Problem TDEAD2815 is UNSAT
Problem TDEAD2816 is UNSAT
Problem TDEAD2817 is UNSAT
Problem TDEAD2818 is UNSAT
Problem TDEAD2822 is UNSAT
Problem TDEAD2823 is UNSAT
Problem TDEAD2824 is UNSAT
Problem TDEAD2825 is UNSAT
Problem TDEAD2826 is UNSAT
Problem TDEAD2827 is UNSAT
Problem TDEAD2828 is UNSAT
Problem TDEAD2829 is UNSAT
Problem TDEAD2830 is UNSAT
Problem TDEAD2831 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2833 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/3970 variables, and 15 constraints, problems are : Problem set: 152 solved, 3718 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/270 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 7/7 constraints]
After SMT, in 123136ms problems are : Problem set: 152 solved, 3718 unsolved
Search for dead transitions found 152 dead transitions in 123214ms
Found 152 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 152 transitions
Dead transitions reduction (with SMT) removed 152 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 3720/3872 transitions.
Reduce places removed 14 places and 462 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 256 transition count 3258
Reduce places removed 10 places and 259 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 24 place count 246 transition count 2999
Reduce places removed 11 places and 335 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 35 place count 235 transition count 2664
Reduce places removed 7 places and 189 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 42 place count 228 transition count 2475
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 42 rules in 98 ms. Remains 228 /270 variables (removed 42) and now considering 2475/3720 (removed 1245) transitions.
[2024-05-21 23:20:39] [INFO ] Flow matrix only has 2355 transitions (discarded 120 similar events)
// Phase 1: matrix 2355 rows 228 cols
[2024-05-21 23:20:39] [INFO ] Computed 10 invariants in 25 ms
[2024-05-21 23:20:39] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-21 23:20:39] [INFO ] Flow matrix only has 2355 transitions (discarded 120 similar events)
[2024-05-21 23:20:39] [INFO ] Invariant cache hit.
[2024-05-21 23:20:40] [INFO ] State equation strengthened by 215 read => feed constraints.
[2024-05-21 23:20:41] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/270 places, 2475/3872 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 129280 ms. Remains : 228/270 places, 2475/3872 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m256-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40178 steps (14 resets) in 160 ms. (249 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 172246 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 172246 steps, saw 112318 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-21 23:20:44] [INFO ] Flow matrix only has 2355 transitions (discarded 120 similar events)
// Phase 1: matrix 2355 rows 226 cols
[2024-05-21 23:20:44] [INFO ] Computed 8 invariants in 30 ms
[2024-05-21 23:20:44] [INFO ] State equation strengthened by 215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:20:44] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1230/1296 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1296 variables, 111/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1296 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1089/2385 variables, 80/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2385 variables, 80/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2385 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2386 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2386 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2386 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/2578 variables, 77/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2578 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2578 variables, 24/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2578 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/2581 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2581 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2581 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2581/2581 variables, and 450 constraints, problems are : Problem set: 0 solved, 1 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1230/1296 variables, 66/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1296 variables, 111/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1296 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1089/2385 variables, 80/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2385 variables, 80/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2385 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2386 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2386 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2386 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/2578 variables, 77/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2578 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2578 variables, 24/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2578 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2578 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2578 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/2581 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2581 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2581 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2581/2581 variables, and 452 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 9 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 2475/2475 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 2474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 2474
Applied a total of 2 rules in 144 ms. Remains 225 /226 variables (removed 1) and now considering 2474/2475 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 225/226 places, 2474/2475 transitions.
RANDOM walk for 40544 steps (8 resets) in 39 ms. (1013 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 186436 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 186436 steps, saw 97551 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-21 23:20:50] [INFO ] Flow matrix only has 2354 transitions (discarded 120 similar events)
// Phase 1: matrix 2354 rows 225 cols
[2024-05-21 23:20:50] [INFO ] Computed 8 invariants in 15 ms
[2024-05-21 23:20:50] [INFO ] State equation strengthened by 215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1230/1296 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1296 variables, 111/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1296 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1089/2385 variables, 80/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2385 variables, 80/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2385 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/2386 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2386 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2386 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/2578 variables, 77/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2578 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2578 variables, 24/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2578 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/2579 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2579 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2579 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2579/2579 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:20:51] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1230/1296 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1296 variables, 111/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1296 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1089/2385 variables, 80/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2385 variables, 80/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2385 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2386 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2386 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2386 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/2578 variables, 77/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2578 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2578 variables, 24/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2578 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2578 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2578 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/2579 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2579 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2579 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2579/2579 variables, and 452 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2545 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3577ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 9 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2474/2474 transitions.
Applied a total of 0 rules in 44 ms. Remains 225 /225 variables (removed 0) and now considering 2474/2474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 225/225 places, 2474/2474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 2474/2474 transitions.
Applied a total of 0 rules in 48 ms. Remains 225 /225 variables (removed 0) and now considering 2474/2474 (removed 0) transitions.
[2024-05-21 23:20:54] [INFO ] Flow matrix only has 2354 transitions (discarded 120 similar events)
[2024-05-21 23:20:54] [INFO ] Invariant cache hit.
[2024-05-21 23:20:54] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-21 23:20:54] [INFO ] Flow matrix only has 2354 transitions (discarded 120 similar events)
[2024-05-21 23:20:54] [INFO ] Invariant cache hit.
[2024-05-21 23:20:55] [INFO ] State equation strengthened by 215 read => feed constraints.
[2024-05-21 23:20:57] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 2537 ms to find 0 implicit places.
[2024-05-21 23:20:57] [INFO ] Redundant transitions in 65 ms returned []
Running 2473 sub problems to find dead transitions.
[2024-05-21 23:20:57] [INFO ] Flow matrix only has 2354 transitions (discarded 120 similar events)
[2024-05-21 23:20:57] [INFO ] Invariant cache hit.
[2024-05-21 23:20:57] [INFO ] State equation strengthened by 215 read => feed constraints.

BK_STOP 1716333673334

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-q8m256"
export BK_EXAMINATION="ReachabilityFireability"
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-q8m256, examination is ReachabilityFireability"
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-171620399500447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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