MCC'2024- Execution of r528-tall-171683760500174

About the Execution of LTSMin+red for ShieldIIPs-PT-100B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1421.535	194576.00	252502.00	365.90	FFFF??T?TTF??FFT	normal

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.r528-tall-171683760500174.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 ShieldIIPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760500174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K 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 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 ShieldIIPs-PT-100B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717234528165

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:35:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:35:29] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2024-06-01 09:35:29] [INFO ] Transformed 6003 places.
[2024-06-01 09:35:29] [INFO ] Transformed 5903 transitions.
[2024-06-01 09:35:29] [INFO ] Found NUPN structural information;
[2024-06-01 09:35:30] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 682 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2983 ms. (13 steps per ms) remains 9/14 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 563 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 9/9 properties
// Phase 1: matrix 5903 rows 6003 cols
[2024-06-01 09:35:31] [INFO ] Computed 901 invariants in 65 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2363/2551 variables, 312/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2551 variables, 2363/2863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2551 variables, 0/2863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3452/6003 variables, 589/3452 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6003 variables, 3452/6904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6003 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 5903/11906 variables, 6003/12907 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11906/11906 variables, and 12907 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5053 ms.
Refiners :[Domain max(s): 6003/6003 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 6003/6003 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2363/2551 variables, 312/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2551 variables, 2363/2863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:35:38] [INFO ] Deduced a trap composed of 15 places in 413 ms of which 56 ms to minimize.
[2024-06-01 09:35:38] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 6 ms to minimize.
[2024-06-01 09:35:39] [INFO ] Deduced a trap composed of 48 places in 336 ms of which 6 ms to minimize.
[2024-06-01 09:35:39] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 6 ms to minimize.
[2024-06-01 09:35:39] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 6 ms to minimize.
[2024-06-01 09:35:40] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 6 ms to minimize.
[2024-06-01 09:35:40] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 5 ms to minimize.
[2024-06-01 09:35:40] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 6 ms to minimize.
[2024-06-01 09:35:41] [INFO ] Deduced a trap composed of 30 places in 303 ms of which 6 ms to minimize.
[2024-06-01 09:35:41] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 6 ms to minimize.
[2024-06-01 09:35:41] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 5 ms to minimize.
[2024-06-01 09:35:42] [INFO ] Deduced a trap composed of 41 places in 280 ms of which 5 ms to minimize.
SMT process timed out in 10346ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 188 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 6003 transition count 5466
Reduce places removed 437 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 468 rules applied. Total rules applied 905 place count 5566 transition count 5435
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 936 place count 5535 transition count 5435
Performed 494 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 494 Pre rules applied. Total rules applied 936 place count 5535 transition count 4941
Deduced a syphon composed of 494 places in 24 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 3 with 988 rules applied. Total rules applied 1924 place count 5041 transition count 4941
Discarding 647 places :
Symmetric choice reduction at 3 with 647 rule applications. Total rules 2571 place count 4394 transition count 4294
Iterating global reduction 3 with 647 rules applied. Total rules applied 3218 place count 4394 transition count 4294
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 3218 place count 4394 transition count 4047
Deduced a syphon composed of 247 places in 63 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 3712 place count 4147 transition count 4047
Performed 1430 Post agglomeration using F-continuation condition.Transition count delta: 1430
Deduced a syphon composed of 1430 places in 15 ms
Reduce places removed 1430 places and 0 transitions.
Iterating global reduction 3 with 2860 rules applied. Total rules applied 6572 place count 2717 transition count 2617
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 653 times.
Drop transitions (Partial Free agglomeration) removed 653 transitions
Iterating global reduction 3 with 653 rules applied. Total rules applied 7225 place count 2717 transition count 2617
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7226 place count 2716 transition count 2616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7227 place count 2715 transition count 2616
Applied a total of 7227 rules in 2340 ms. Remains 2715 /6003 variables (removed 3288) and now considering 2616/5903 (removed 3287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2350 ms. Remains : 2715/6003 places, 2616/5903 transitions.
RANDOM walk for 40000 steps (8 resets) in 1296 ms. (30 steps per ms) remains 6/9 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 5/6 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 413 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 5/5 properties
// Phase 1: matrix 2616 rows 2715 cols
[2024-06-01 09:35:45] [INFO ] Computed 900 invariants in 90 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 700/828 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1700/2528 variables, 610/829 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2528 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/2554 variables, 13/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2554 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2497/5051 variables, 2554/3396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5051 variables, 0/3396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 105/5156 variables, 56/3452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5156 variables, 19/3471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5156 variables, 0/3471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/5158 variables, 1/3472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5158 variables, 0/3472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/5160 variables, 1/3473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5160 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 93/5253 variables, 56/3529 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5253 variables, 14/3543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5253 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 3/5256 variables, 4/3547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5256 variables, 3/3550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5256 variables, 0/3550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 4/5260 variables, 2/3552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5260 variables, 4/3556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5260 variables, 0/3556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 31/5291 variables, 18/3574 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5291 variables, 6/3580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/5291 variables, 0/3580 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 2/5293 variables, 3/3583 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5293 variables, 2/3585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5293 variables, 0/3585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 26/5319 variables, 13/3598 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5319 variables, 4/3602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5319 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 9/5328 variables, 6/3608 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5328 variables, 1/3609 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5328 variables, 1/3610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5328 variables, 0/3610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 1/5329 variables, 1/3611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/5329 variables, 1/3612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5329 variables, 0/3612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 2/5331 variables, 2/3614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5331 variables, 1/3615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5331 variables, 0/3615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 0/5331 variables, 0/3615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5331/5331 variables, and 3615 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7431 ms.
Refiners :[Positive P Invariants (semi-flows): 886/886 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2715/2715 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 700/828 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:35:53] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-06-01 09:35:53] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-06-01 09:35:53] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:35:53] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 09:35:53] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2024-06-01 09:35:53] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 3 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 3 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 09:35:54] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-06-01 09:35:55] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 15/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:35:55] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1700/2528 variables, 610/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:35:56] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 5 ms to minimize.
[2024-06-01 09:35:56] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 5 ms to minimize.
[2024-06-01 09:35:56] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 5 ms to minimize.
[2024-06-01 09:35:57] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 5 ms to minimize.
[2024-06-01 09:35:57] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 5 ms to minimize.
[2024-06-01 09:35:57] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 9 ms to minimize.
[2024-06-01 09:35:57] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 5 ms to minimize.
[2024-06-01 09:35:58] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 4 ms to minimize.
[2024-06-01 09:35:58] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 5 ms to minimize.
[2024-06-01 09:35:58] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 4 ms to minimize.
[2024-06-01 09:35:59] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 5 ms to minimize.
[2024-06-01 09:35:59] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 5 ms to minimize.
[2024-06-01 09:35:59] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 4 ms to minimize.
[2024-06-01 09:36:00] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 5 ms to minimize.
[2024-06-01 09:36:00] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 5 ms to minimize.
[2024-06-01 09:36:00] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 5 ms to minimize.
[2024-06-01 09:36:01] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 5 ms to minimize.
[2024-06-01 09:36:01] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-06-01 09:36:01] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 5 ms to minimize.
[2024-06-01 09:36:01] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2528 variables, 20/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:02] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 4 ms to minimize.
[2024-06-01 09:36:02] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 5 ms to minimize.
[2024-06-01 09:36:02] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 4 ms to minimize.
[2024-06-01 09:36:03] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 3 ms to minimize.
[2024-06-01 09:36:03] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 3 ms to minimize.
[2024-06-01 09:36:03] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
[2024-06-01 09:36:03] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-06-01 09:36:04] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 5 ms to minimize.
[2024-06-01 09:36:04] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 4 ms to minimize.
[2024-06-01 09:36:04] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-06-01 09:36:04] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 6 ms to minimize.
[2024-06-01 09:36:04] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-06-01 09:36:05] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-06-01 09:36:05] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-06-01 09:36:05] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-06-01 09:36:05] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-06-01 09:36:05] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 3 ms to minimize.
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2528 variables, 20/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-06-01 09:36:06] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-06-01 09:36:07] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 4 ms to minimize.
[2024-06-01 09:36:07] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-06-01 09:36:07] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 3 ms to minimize.
[2024-06-01 09:36:07] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-06-01 09:36:08] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 3 ms to minimize.
[2024-06-01 09:36:09] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-06-01 09:36:09] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2528 variables, 13/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2528 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 26/2554 variables, 13/911 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:09] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 3 ms to minimize.
[2024-06-01 09:36:09] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-06-01 09:36:10] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-06-01 09:36:10] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-06-01 09:36:10] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2554 variables, 5/916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2554 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2497/5051 variables, 2554/3470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5051 variables, 2/3472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:12] [INFO ] Deduced a trap composed of 9 places in 455 ms of which 7 ms to minimize.
[2024-06-01 09:36:13] [INFO ] Deduced a trap composed of 9 places in 450 ms of which 7 ms to minimize.
[2024-06-01 09:36:13] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 6 ms to minimize.
[2024-06-01 09:36:14] [INFO ] Deduced a trap composed of 8 places in 435 ms of which 6 ms to minimize.
[2024-06-01 09:36:14] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 7 ms to minimize.
[2024-06-01 09:36:15] [INFO ] Deduced a trap composed of 6 places in 445 ms of which 7 ms to minimize.
[2024-06-01 09:36:15] [INFO ] Deduced a trap composed of 11 places in 440 ms of which 6 ms to minimize.
[2024-06-01 09:36:16] [INFO ] Deduced a trap composed of 11 places in 428 ms of which 6 ms to minimize.
[2024-06-01 09:36:16] [INFO ] Deduced a trap composed of 11 places in 423 ms of which 6 ms to minimize.
[2024-06-01 09:36:17] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 7 ms to minimize.
[2024-06-01 09:36:17] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 7 ms to minimize.
[2024-06-01 09:36:18] [INFO ] Deduced a trap composed of 14 places in 393 ms of which 6 ms to minimize.
[2024-06-01 09:36:18] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 6 ms to minimize.
[2024-06-01 09:36:19] [INFO ] Deduced a trap composed of 8 places in 394 ms of which 7 ms to minimize.
[2024-06-01 09:36:19] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 6 ms to minimize.
[2024-06-01 09:36:20] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 6 ms to minimize.
[2024-06-01 09:36:20] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 6 ms to minimize.
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 6 ms to minimize.
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 6 ms to minimize.
[2024-06-01 09:36:21] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/5051 variables, 20/3492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:22] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 5 ms to minimize.
[2024-06-01 09:36:23] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 6 ms to minimize.
[2024-06-01 09:36:23] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 4 ms to minimize.
[2024-06-01 09:36:24] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 5 ms to minimize.
[2024-06-01 09:36:24] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 5 ms to minimize.
[2024-06-01 09:36:24] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 4 ms to minimize.
[2024-06-01 09:36:25] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 5 ms to minimize.
[2024-06-01 09:36:25] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 5 ms to minimize.
[2024-06-01 09:36:25] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 4 ms to minimize.
[2024-06-01 09:36:26] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 5 ms to minimize.
[2024-06-01 09:36:26] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 5 ms to minimize.
[2024-06-01 09:36:27] [INFO ] Deduced a trap composed of 11 places in 302 ms of which 5 ms to minimize.
[2024-06-01 09:36:27] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 5 ms to minimize.
[2024-06-01 09:36:27] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 5 ms to minimize.
[2024-06-01 09:36:28] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 4 ms to minimize.
[2024-06-01 09:36:28] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 5 ms to minimize.
[2024-06-01 09:36:28] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 5 ms to minimize.
[2024-06-01 09:36:29] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-06-01 09:36:29] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 4 ms to minimize.
[2024-06-01 09:36:29] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/5051 variables, 20/3512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:30] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 6 ms to minimize.
[2024-06-01 09:36:31] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 6 ms to minimize.
[2024-06-01 09:36:31] [INFO ] Deduced a trap composed of 8 places in 336 ms of which 5 ms to minimize.
[2024-06-01 09:36:32] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 5 ms to minimize.
[2024-06-01 09:36:32] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 6 ms to minimize.
[2024-06-01 09:36:33] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 5 ms to minimize.
[2024-06-01 09:36:33] [INFO ] Deduced a trap composed of 11 places in 321 ms of which 6 ms to minimize.
[2024-06-01 09:36:33] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 6 ms to minimize.
[2024-06-01 09:36:34] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 5 ms to minimize.
[2024-06-01 09:36:34] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 5 ms to minimize.
[2024-06-01 09:36:35] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 5 ms to minimize.
[2024-06-01 09:36:35] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 5 ms to minimize.
[2024-06-01 09:36:35] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 4 ms to minimize.
[2024-06-01 09:36:36] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 5 ms to minimize.
[2024-06-01 09:36:36] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 5 ms to minimize.
[2024-06-01 09:36:36] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 5 ms to minimize.
[2024-06-01 09:36:37] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 5 ms to minimize.
[2024-06-01 09:36:37] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 5 ms to minimize.
[2024-06-01 09:36:37] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5051/5331 variables, and 3531 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 829/886 constraints, Generalized P Invariants (flows): 13/14 constraints, State Equation: 2554/2715 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 133/133 constraints]
After SMT, in 52588ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 2715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2715/2715 places, 2616/2616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 2715 transition count 2607
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 2706 transition count 2607
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 2706 transition count 2602
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 2701 transition count 2602
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 106 place count 2662 transition count 2563
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 124 place count 2662 transition count 2563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 2661 transition count 2562
Applied a total of 125 rules in 400 ms. Remains 2661 /2715 variables (removed 54) and now considering 2562/2616 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 2661/2715 places, 2562/2616 transitions.
RANDOM walk for 40000 steps (8 resets) in 1165 ms. (34 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 420 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 427 ms. (93 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 94818 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :0 out of 5
Probabilistic random walk after 94818 steps, saw 92772 distinct states, run finished after 3006 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 2562 rows 2661 cols
[2024-06-01 09:36:42] [INFO ] Computed 900 invariants in 57 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 680/808 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1676/2484 variables, 615/833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2484 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 16/2500 variables, 8/841 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2500 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2441/4941 variables, 2500/3341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4941 variables, 0/3341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 109/5050 variables, 56/3397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5050 variables, 19/3416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5050 variables, 0/3416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/5051 variables, 1/3417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5051 variables, 1/3418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5051 variables, 0/3418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/5053 variables, 1/3419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5053 variables, 0/3419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 94/5147 variables, 56/3475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5147 variables, 15/3490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5147 variables, 0/3490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 3/5150 variables, 4/3494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5150 variables, 3/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5150 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 4/5154 variables, 2/3499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5154 variables, 4/3503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5154 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 30/5184 variables, 18/3521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/5184 variables, 7/3528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5184 variables, 0/3528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 1/5185 variables, 2/3530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5185 variables, 1/3531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5185 variables, 0/3531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 26/5211 variables, 13/3544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5211 variables, 4/3548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5211 variables, 0/3548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 9/5220 variables, 6/3554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5220 variables, 1/3555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5220 variables, 1/3556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5220 variables, 0/3556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 1/5221 variables, 1/3557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5221 variables, 1/3558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5221 variables, 0/3558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 2/5223 variables, 2/3560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5223 variables, 1/3561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5223 variables, 0/3561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 0/5223 variables, 0/3561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5223/5223 variables, and 3561 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7349 ms.
Refiners :[Positive P Invariants (semi-flows): 891/891 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 2661/2661 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 680/808 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:36:50] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 09:36:51] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 09:36:51] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 09:36:51] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/808 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1676/2484 variables, 615/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:51] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 2 ms to minimize.
[2024-06-01 09:36:52] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 3 ms to minimize.
[2024-06-01 09:36:52] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-06-01 09:36:52] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 3 ms to minimize.
[2024-06-01 09:36:52] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-01 09:36:52] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-06-01 09:36:52] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-06-01 09:36:53] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 2 ms to minimize.
[2024-06-01 09:36:53] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-06-01 09:36:53] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 3 ms to minimize.
[2024-06-01 09:36:53] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 09:36:53] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
[2024-06-01 09:36:54] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
[2024-06-01 09:36:54] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-06-01 09:36:54] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-06-01 09:36:54] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-06-01 09:36:54] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-06-01 09:36:55] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-06-01 09:36:55] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-06-01 09:36:55] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2484 variables, 20/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:55] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 3 ms to minimize.
[2024-06-01 09:36:55] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-06-01 09:36:55] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 3 ms to minimize.
[2024-06-01 09:36:56] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2024-06-01 09:36:56] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-06-01 09:36:56] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-06-01 09:36:56] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2024-06-01 09:36:56] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 3 ms to minimize.
[2024-06-01 09:36:56] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 3 ms to minimize.
[2024-06-01 09:36:57] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 09:36:57] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 09:36:57] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-06-01 09:36:57] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:36:57] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
[2024-06-01 09:36:57] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-06-01 09:36:57] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 09:36:58] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-01 09:36:58] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-06-01 09:36:58] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-06-01 09:36:58] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2484 variables, 20/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:36:58] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 09:36:58] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 09:36:59] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-06-01 09:36:59] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-06-01 09:36:59] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-06-01 09:36:59] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-06-01 09:36:59] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
[2024-06-01 09:36:59] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 3 ms to minimize.
[2024-06-01 09:37:00] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:37:00] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:37:00] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-06-01 09:37:00] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2484 variables, 12/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2484 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 16/2500 variables, 8/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:01] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-06-01 09:37:01] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-01 09:37:01] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 09:37:01] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2500 variables, 4/909 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:01] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2500 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2500 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2441/4941 variables, 2500/3410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4941 variables, 2/3412 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:03] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 6 ms to minimize.
[2024-06-01 09:37:04] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 8 ms to minimize.
[2024-06-01 09:37:04] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 6 ms to minimize.
[2024-06-01 09:37:05] [INFO ] Deduced a trap composed of 10 places in 420 ms of which 6 ms to minimize.
[2024-06-01 09:37:05] [INFO ] Deduced a trap composed of 7 places in 418 ms of which 7 ms to minimize.
[2024-06-01 09:37:06] [INFO ] Deduced a trap composed of 10 places in 416 ms of which 7 ms to minimize.
[2024-06-01 09:37:06] [INFO ] Deduced a trap composed of 8 places in 401 ms of which 7 ms to minimize.
[2024-06-01 09:37:07] [INFO ] Deduced a trap composed of 7 places in 429 ms of which 7 ms to minimize.
[2024-06-01 09:37:07] [INFO ] Deduced a trap composed of 7 places in 391 ms of which 6 ms to minimize.
[2024-06-01 09:37:08] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 6 ms to minimize.
[2024-06-01 09:37:08] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 6 ms to minimize.
[2024-06-01 09:37:09] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 7 ms to minimize.
[2024-06-01 09:37:09] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 6 ms to minimize.
[2024-06-01 09:37:10] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 6 ms to minimize.
[2024-06-01 09:37:10] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 6 ms to minimize.
[2024-06-01 09:37:10] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 5 ms to minimize.
[2024-06-01 09:37:11] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 5 ms to minimize.
[2024-06-01 09:37:11] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 5 ms to minimize.
[2024-06-01 09:37:12] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 5 ms to minimize.
[2024-06-01 09:37:12] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4941 variables, 20/3432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:13] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 6 ms to minimize.
[2024-06-01 09:37:13] [INFO ] Deduced a trap composed of 7 places in 316 ms of which 5 ms to minimize.
[2024-06-01 09:37:14] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 5 ms to minimize.
[2024-06-01 09:37:14] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 5 ms to minimize.
[2024-06-01 09:37:14] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 5 ms to minimize.
[2024-06-01 09:37:15] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 5 ms to minimize.
[2024-06-01 09:37:15] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 5 ms to minimize.
[2024-06-01 09:37:16] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 4 ms to minimize.
[2024-06-01 09:37:16] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 5 ms to minimize.
[2024-06-01 09:37:16] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 4 ms to minimize.
[2024-06-01 09:37:17] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 4 ms to minimize.
[2024-06-01 09:37:17] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 4 ms to minimize.
[2024-06-01 09:37:17] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 5 ms to minimize.
[2024-06-01 09:37:18] [INFO ] Deduced a trap composed of 7 places in 298 ms of which 5 ms to minimize.
[2024-06-01 09:37:18] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 5 ms to minimize.
[2024-06-01 09:37:18] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 4 ms to minimize.
[2024-06-01 09:37:19] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 5 ms to minimize.
[2024-06-01 09:37:19] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 5 ms to minimize.
[2024-06-01 09:37:20] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 4 ms to minimize.
[2024-06-01 09:37:20] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4941 variables, 20/3452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:21] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 5 ms to minimize.
[2024-06-01 09:37:21] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 5 ms to minimize.
[2024-06-01 09:37:21] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 5 ms to minimize.
[2024-06-01 09:37:22] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 4 ms to minimize.
[2024-06-01 09:37:22] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 4 ms to minimize.
[2024-06-01 09:37:22] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 5 ms to minimize.
[2024-06-01 09:37:23] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 4 ms to minimize.
[2024-06-01 09:37:23] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 5 ms to minimize.
[2024-06-01 09:37:23] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 4 ms to minimize.
[2024-06-01 09:37:24] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 4 ms to minimize.
[2024-06-01 09:37:24] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 4 ms to minimize.
[2024-06-01 09:37:24] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 4 ms to minimize.
[2024-06-01 09:37:25] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 4 ms to minimize.
[2024-06-01 09:37:25] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 4 ms to minimize.
[2024-06-01 09:37:25] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 3 ms to minimize.
[2024-06-01 09:37:26] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 4 ms to minimize.
[2024-06-01 09:37:26] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 3 ms to minimize.
[2024-06-01 09:37:26] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-06-01 09:37:27] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 3 ms to minimize.
[2024-06-01 09:37:27] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4941 variables, 20/3472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:28] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 4 ms to minimize.
[2024-06-01 09:37:28] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 4 ms to minimize.
[2024-06-01 09:37:28] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 4 ms to minimize.
[2024-06-01 09:37:29] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 4 ms to minimize.
[2024-06-01 09:37:29] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 4 ms to minimize.
[2024-06-01 09:37:29] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 4 ms to minimize.
[2024-06-01 09:37:29] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 4 ms to minimize.
[2024-06-01 09:37:30] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 4 ms to minimize.
[2024-06-01 09:37:30] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 4 ms to minimize.
[2024-06-01 09:37:30] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 4 ms to minimize.
[2024-06-01 09:37:31] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 3 ms to minimize.
[2024-06-01 09:37:31] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 3 ms to minimize.
[2024-06-01 09:37:31] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 3 ms to minimize.
[2024-06-01 09:37:31] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-06-01 09:37:32] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-06-01 09:37:32] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-06-01 09:37:32] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 3 ms to minimize.
[2024-06-01 09:37:32] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 3 ms to minimize.
[2024-06-01 09:37:33] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-06-01 09:37:33] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4941 variables, 20/3492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:34] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 3 ms to minimize.
[2024-06-01 09:37:34] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-06-01 09:37:35] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 4 ms to minimize.
[2024-06-01 09:37:35] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 4 ms to minimize.
[2024-06-01 09:37:35] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 4 ms to minimize.
[2024-06-01 09:37:35] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-06-01 09:37:36] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 3 ms to minimize.
[2024-06-01 09:37:36] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-06-01 09:37:36] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-06-01 09:37:36] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 4 ms to minimize.
[2024-06-01 09:37:37] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 4 ms to minimize.
[2024-06-01 09:37:37] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 4 ms to minimize.
[2024-06-01 09:37:37] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 4 ms to minimize.
[2024-06-01 09:37:37] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 4 ms to minimize.
[2024-06-01 09:37:38] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 4 ms to minimize.
[2024-06-01 09:37:38] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-01 09:37:38] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-06-01 09:37:39] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2024-06-01 09:37:39] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2024-06-01 09:37:39] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4941 variables, 20/3512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:40] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 4 ms to minimize.
[2024-06-01 09:37:40] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 4 ms to minimize.
[2024-06-01 09:37:41] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 3 ms to minimize.
[2024-06-01 09:37:41] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-06-01 09:37:41] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 4 ms to minimize.
[2024-06-01 09:37:42] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 4 ms to minimize.
[2024-06-01 09:37:42] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 4 ms to minimize.
[2024-06-01 09:37:42] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 09:37:42] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-06-01 09:37:43] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 4 ms to minimize.
[2024-06-01 09:37:43] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2024-06-01 09:37:43] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-06-01 09:37:43] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-06-01 09:37:44] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-01 09:37:44] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 4 ms to minimize.
[2024-06-01 09:37:45] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 3 ms to minimize.
[2024-06-01 09:37:45] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 4 ms to minimize.
[2024-06-01 09:37:45] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-06-01 09:37:45] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 4 ms to minimize.
[2024-06-01 09:37:46] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4941 variables, 20/3532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:47] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 6 ms to minimize.
[2024-06-01 09:37:47] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 4 ms to minimize.
[2024-06-01 09:37:47] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 4 ms to minimize.
[2024-06-01 09:37:48] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-06-01 09:37:48] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 3 ms to minimize.
[2024-06-01 09:37:48] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-06-01 09:37:48] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 3 ms to minimize.
[2024-06-01 09:37:49] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 4 ms to minimize.
[2024-06-01 09:37:49] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 4 ms to minimize.
[2024-06-01 09:37:50] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 4 ms to minimize.
[2024-06-01 09:37:50] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 4 ms to minimize.
[2024-06-01 09:37:50] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 4 ms to minimize.
[2024-06-01 09:37:51] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 4 ms to minimize.
[2024-06-01 09:37:51] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 4 ms to minimize.
[2024-06-01 09:37:51] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 4 ms to minimize.
[2024-06-01 09:37:52] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 4 ms to minimize.
[2024-06-01 09:37:52] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
[2024-06-01 09:37:52] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4941 variables, 18/3550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:53] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 4 ms to minimize.
[2024-06-01 09:37:53] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 3 ms to minimize.
[2024-06-01 09:37:54] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 4 ms to minimize.
[2024-06-01 09:37:54] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 4 ms to minimize.
[2024-06-01 09:37:54] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 4 ms to minimize.
[2024-06-01 09:37:55] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 3 ms to minimize.
[2024-06-01 09:37:55] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 4 ms to minimize.
[2024-06-01 09:37:55] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 4 ms to minimize.
[2024-06-01 09:37:56] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 4 ms to minimize.
[2024-06-01 09:37:56] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 3 ms to minimize.
[2024-06-01 09:37:56] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 3 ms to minimize.
[2024-06-01 09:37:57] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 4 ms to minimize.
[2024-06-01 09:37:57] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-06-01 09:37:57] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 09:37:58] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 3 ms to minimize.
[2024-06-01 09:37:58] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/4941 variables, 16/3566 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:37:59] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 4 ms to minimize.
[2024-06-01 09:37:59] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 4 ms to minimize.
[2024-06-01 09:37:59] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-06-01 09:38:00] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 4 ms to minimize.
[2024-06-01 09:38:00] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2024-06-01 09:38:01] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 4 ms to minimize.
[2024-06-01 09:38:01] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 3 ms to minimize.
[2024-06-01 09:38:01] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-06-01 09:38:01] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/4941 variables, 9/3575 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:38:02] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 4 ms to minimize.
[2024-06-01 09:38:03] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-06-01 09:38:03] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 4 ms to minimize.
[2024-06-01 09:38:03] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
[2024-06-01 09:38:03] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 3 ms to minimize.
[2024-06-01 09:38:04] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/4941 variables, 6/3581 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4941/5223 variables, and 3581 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75013 ms.
Refiners :[Positive P Invariants (semi-flows): 833/891 constraints, Generalized P Invariants (flows): 8/9 constraints, State Equation: 2500/2661 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 238/238 constraints]
After SMT, in 82452ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 2661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 2562/2562 transitions.
Applied a total of 0 rules in 90 ms. Remains 2661 /2661 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2661/2661 places, 2562/2562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 2562/2562 transitions.
Applied a total of 0 rules in 97 ms. Remains 2661 /2661 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2024-06-01 09:38:05] [INFO ] Invariant cache hit.
[2024-06-01 09:38:06] [INFO ] Implicit Places using invariants in 1583 ms returned []
[2024-06-01 09:38:06] [INFO ] Invariant cache hit.
[2024-06-01 09:38:10] [INFO ] Implicit Places using invariants and state equation in 3763 ms returned []
Implicit Place search using SMT with State Equation took 5360 ms to find 0 implicit places.
[2024-06-01 09:38:10] [INFO ] Redundant transitions in 169 ms returned []
Running 2557 sub problems to find dead transitions.
[2024-06-01 09:38:10] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2657 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2557 unsolved
SMT process timed out in 31252ms, After SMT, problems are : Problem set: 0 solved, 2557 unsolved
Search for dead transitions found 0 dead transitions in 31277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36919 ms. Remains : 2661/2661 places, 2562/2562 transitions.
[2024-06-01 09:38:41] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-01 09:38:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2661 places, 2562 transitions and 12463 arcs took 23 ms.
[2024-06-01 09:38:42] [INFO ] Flatten gal took : 313 ms
Total runtime 193160 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 : ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12

BK_STOP 1717234722741

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/1695/inv_0_
rfs formula name ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1695/inv_1_
rfs formula name ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/1695/inv_2_
rfs formula name ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/1695/inv_3_
rfs formula name ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/1695/inv_4_
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="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760500174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;