Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r532-smll-171683810700095.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d1m96, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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 SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717246657930

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:57:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:57:40] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-06-01 12:57:40] [INFO ] Transformed 1295 places.
[2024-06-01 12:57:40] [INFO ] Transformed 749 transitions.
[2024-06-01 12:57:40] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 16 ms
Reduce places removed 1036 places and 0 transitions.
RANDOM walk for 40000 steps (8812 resets) in 4853 ms. (8 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (196 resets) in 128 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (184 resets) in 120 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (171 resets) in 65 ms. (60 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (196 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (398 resets) in 131 ms. (30 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (176 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (181 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (187 resets) in 150 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (174 resets) in 88 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (183 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (185 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (180 resets) in 73 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (187 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (194 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (163 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (185 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 172893 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :6 out of 16
Probabilistic random walk after 172893 steps, saw 79715 distinct states, run finished after 3020 ms. (steps per millisecond=57 ) properties seen :6
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 12:57:45] [INFO ] Computed 6 invariants in 78 ms
[2024-06-01 12:57:46] [INFO ] State equation strengthened by 587 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 84/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-06 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-07 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-11 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 91/259 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 749/1008 variables, 259/265 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 587/852 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1008 variables, 0/852 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1008/1008 variables, and 852 constraints, problems are : Problem set: 4 solved, 6 unsolved in 2696 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 99/160 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 99/259 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 118 places in 360 ms of which 39 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 749/1008 variables, 259/267 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1008 variables, 587/854 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 6/860 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1008 variables, 0/860 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/1008 variables, and 860 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 259/259 constraints, ReadFeed: 587/587 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 8558ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.5 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 242 transition count 509
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 274 place count 209 transition count 444
Iterating global reduction 1 with 33 rules applied. Total rules applied 307 place count 209 transition count 444
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 319 place count 209 transition count 432
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 330 place count 198 transition count 421
Iterating global reduction 2 with 11 rules applied. Total rules applied 341 place count 198 transition count 421
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 351 place count 188 transition count 410
Iterating global reduction 2 with 10 rules applied. Total rules applied 361 place count 188 transition count 410
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 378 place count 188 transition count 393
Applied a total of 378 rules in 166 ms. Remains 188 /259 variables (removed 71) and now considering 393/749 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 188/259 places, 393/749 transitions.
RANDOM walk for 40000 steps (8927 resets) in 741 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1891 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1933 resets) in 371 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1925 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1850 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 358400 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 6
Probabilistic random walk after 358400 steps, saw 166126 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 393 rows 188 cols
[2024-06-01 12:57:58] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 12:57:58] [INFO ] State equation strengthened by 263 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 69/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/170 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 377/547 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 247/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 34/581 variables, 18/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 16/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/581 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 456 constraints, problems are : Problem set: 0 solved, 6 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 263/263 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 69/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/170 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 377/547 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 247/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 34/581 variables, 18/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 16/456 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 12:58:02] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 3 ms to minimize.
[2024-06-01 12:58:02] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:58:02] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 12:58:02] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/581 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 466 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4802 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 5879ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 18814 ms.
Support contains 61 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 393/393 transitions.
Applied a total of 0 rules in 60 ms. Remains 188 /188 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 188/188 places, 393/393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 393/393 transitions.
Applied a total of 0 rules in 27 ms. Remains 188 /188 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2024-06-01 12:58:23] [INFO ] Invariant cache hit.
[2024-06-01 12:58:23] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-06-01 12:58:23] [INFO ] Invariant cache hit.
[2024-06-01 12:58:23] [INFO ] State equation strengthened by 263 read => feed constraints.
[2024-06-01 12:58:24] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-06-01 12:58:24] [INFO ] Redundant transitions in 29 ms returned []
Running 392 sub problems to find dead transitions.
[2024-06-01 12:58:24] [INFO ] Invariant cache hit.
[2024-06-01 12:58:24] [INFO ] State equation strengthened by 263 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 12:58:36] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 4 ms to minimize.
[2024-06-01 12:58:36] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 393/581 variables, 188/195 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 263/458 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-06-01 12:58:49] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 1/459 constraints. Problems are: Problem set: 3 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/581 variables, and 459 constraints, problems are : Problem set: 3 solved, 389 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 4/188 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 389 unsolved
At refinement iteration 6 (OVERLAPS) 393/581 variables, 188/196 constraints. Problems are: Problem set: 3 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 263/459 constraints. Problems are: Problem set: 3 solved, 389 unsolved
Problem TDEAD359 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 389/848 constraints. Problems are: Problem set: 4 solved, 388 unsolved
[2024-06-01 12:59:13] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:59:15] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 850 constraints, problems are : Problem set: 4 solved, 388 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 188/188 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 389/392 constraints, Known Traps: 5/5 constraints]
After SMT, in 61696ms problems are : Problem set: 4 solved, 388 unsolved
Search for dead transitions found 4 dead transitions in 61717ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 188/188 places, 389/393 transitions.
Graph (complete) has 678 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 38 ms. Remains 186 /188 variables (removed 2) and now considering 389/389 (removed 0) transitions.
// Phase 1: matrix 389 rows 186 cols
[2024-06-01 12:59:26] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 12:59:27] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-06-01 12:59:27] [INFO ] Invariant cache hit.
[2024-06-01 12:59:27] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-06-01 12:59:27] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 186/188 places, 389/393 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64541 ms. Remains : 186/188 places, 389/393 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (9045 resets) in 480 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1883 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1930 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 421740 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 6
Probabilistic random walk after 421740 steps, saw 197209 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 389 rows 185 cols
[2024-06-01 12:59:31] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 12:59:31] [INFO ] State equation strengthened by 262 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/167 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 373/540 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 246/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 34/574 variables, 18/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 16/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/574 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 452 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1468 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 262/262 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/167 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 373/540 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 246/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 34/574 variables, 18/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 16/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 6/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 12:59:35] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 3 ms to minimize.
[2024-06-01 12:59:35] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 460 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 5812ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 29274 ms.
Support contains 60 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 389/389 transitions.
Applied a total of 0 rules in 31 ms. Remains 185 /185 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 185/185 places, 389/389 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 389/389 transitions.
Applied a total of 0 rules in 18 ms. Remains 185 /185 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2024-06-01 13:00:06] [INFO ] Invariant cache hit.
[2024-06-01 13:00:06] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 13:00:06] [INFO ] Invariant cache hit.
[2024-06-01 13:00:06] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-06-01 13:00:07] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
[2024-06-01 13:00:07] [INFO ] Redundant transitions in 7 ms returned []
Running 388 sub problems to find dead transitions.
[2024-06-01 13:00:07] [INFO ] Invariant cache hit.
[2024-06-01 13:00:07] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 2/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-01 13:00:18] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:00:19] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 6 (OVERLAPS) 389/574 variables, 185/192 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 262/454 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/454 constraints. Problems are: Problem set: 5 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 454 constraints, problems are : Problem set: 5 solved, 383 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 7/185 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 3/5 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 389/574 variables, 185/192 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 262/454 constraints. Problems are: Problem set: 5 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 383/837 constraints. Problems are: Problem set: 5 solved, 383 unsolved
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:00:54] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:00:55] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 3/840 constraints. Problems are: Problem set: 5 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 840 constraints, problems are : Problem set: 5 solved, 383 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 383/388 constraints, Known Traps: 5/5 constraints]
After SMT, in 61157ms problems are : Problem set: 5 solved, 383 unsolved
Search for dead transitions found 5 dead transitions in 61164ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/185 places, 384/389 transitions.
Graph (complete) has 666 edges and 185 vertex of which 182 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 23 ms. Remains 182 /185 variables (removed 3) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 182 cols
[2024-06-01 13:01:08] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 13:01:09] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 13:01:09] [INFO ] Invariant cache hit.
[2024-06-01 13:01:09] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:01:09] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 182/185 places, 384/389 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63463 ms. Remains : 182/185 places, 384/389 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (8970 resets) in 351 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1874 resets) in 374 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1939 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1918 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 335 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1878 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 225559 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 6
Probabilistic random walk after 225559 steps, saw 106842 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 384 rows 181 cols
[2024-06-01 13:01:13] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 13:01:13] [INFO ] State equation strengthened by 260 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 64/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/163 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 368/531 variables, 163/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 244/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 34/565 variables, 18/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 16/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/565 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 446 constraints, problems are : Problem set: 0 solved, 6 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 260/260 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 64/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/163 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 368/531 variables, 163/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 244/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 34/565 variables, 18/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 16/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 6/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:01:16] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/565 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 453 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5375ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 36502 ms.
Support contains 59 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 384/384 transitions.
Applied a total of 0 rules in 35 ms. Remains 181 /181 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 181/181 places, 384/384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 384/384 transitions.
Applied a total of 0 rules in 18 ms. Remains 181 /181 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2024-06-01 13:01:55] [INFO ] Invariant cache hit.
[2024-06-01 13:01:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 13:01:55] [INFO ] Invariant cache hit.
[2024-06-01 13:01:55] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:01:56] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2024-06-01 13:01:56] [INFO ] Redundant transitions in 4 ms returned []
Running 383 sub problems to find dead transitions.
[2024-06-01 13:01:56] [INFO ] Invariant cache hit.
[2024-06-01 13:01:56] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 3/181 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-06-01 13:02:04] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:02:04] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (OVERLAPS) 384/565 variables, 181/188 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 260/448 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-06-01 13:02:13] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 449 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 3/181 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-06-01 13:02:31] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (OVERLAPS) 384/565 variables, 181/190 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 260/450 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 383/833 constraints. Problems are: Problem set: 0 solved, 383 unsolved
[2024-06-01 13:02:44] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 834 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 181/181 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 5/5 constraints]
After SMT, in 60883ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61884 ms. Remains : 181/181 places, 384/384 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 607 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 180 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 178 transition count 381
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 6 place count 178 transition count 372
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 169 transition count 372
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 40 place count 161 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 160 transition count 369
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 160 transition count 368
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 160 transition count 365
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 157 transition count 365
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 56 place count 157 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 157 transition count 363
Applied a total of 58 rules in 64 ms. Remains 157 /181 variables (removed 24) and now considering 363/384 (removed 21) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 363 rows 157 cols
[2024-06-01 13:02:57] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:02:57] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 13:02:57] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 13:02:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 13:02:58] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 13:02:58] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
TRAPS : Iteration 1
[2024-06-01 13:02:59] [INFO ] After 1886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 13:03:00] [INFO ] After 2517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 2779 ms.
[2024-06-01 13:03:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-06-01 13:03:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 181 places, 384 transitions and 1519 arcs took 7 ms.
[2024-06-01 13:03:00] [INFO ] Flatten gal took : 92 ms
Total runtime 320460 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-05
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-08
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-15

BK_STOP 1717246981053

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_0_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/698/inv_1_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_2_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_3_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_4_
rfs formula name SieveSingleMsgMbox-PT-d1m96-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="SieveSingleMsgMbox-PT-d1m96"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m96, 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 r532-smll-171683810700095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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