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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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.3M 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 ShieldRVs-PT-100B-ReachabilityFireability-2023-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2023-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717274250053

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:37:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:37:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:37:31] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2024-06-01 20:37:31] [INFO ] Transformed 4003 places.
[2024-06-01 20:37:31] [INFO ] Transformed 4503 transitions.
[2024-06-01 20:37:31] [INFO ] Found NUPN structural information;
[2024-06-01 20:37:31] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2841 ms. (14 steps per ms) remains 10/16 properties
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 838 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
// Phase 1: matrix 4503 rows 4003 cols
[2024-06-01 20:37:33] [INFO ] Computed 401 invariants in 52 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 409/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 3584/3993 variables, 400/809 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3993 variables, 3584/4393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3993 variables, 0/4393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 10/4003 variables, 1/4394 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4003 variables, 10/4404 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4003 variables, 0/4404 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4503/8506 variables, 4003/8407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8506/8506 variables, and 8407 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5046 ms.
Refiners :[Domain max(s): 4003/4003 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 4003/4003 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 409/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 3584/3993 variables, 400/809 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3993 variables, 3584/4393 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 20:37:41] [INFO ] Deduced a trap composed of 21 places in 1613 ms of which 134 ms to minimize.
[2024-06-01 20:37:43] [INFO ] Deduced a trap composed of 34 places in 1546 ms of which 19 ms to minimize.
[2024-06-01 20:37:44] [INFO ] Deduced a trap composed of 26 places in 1434 ms of which 19 ms to minimize.
SMT process timed out in 11369ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 409 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 4003 transition count 4175
Reduce places removed 328 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 350 rules applied. Total rules applied 678 place count 3675 transition count 4153
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 700 place count 3653 transition count 4153
Performed 455 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 455 Pre rules applied. Total rules applied 700 place count 3653 transition count 3698
Deduced a syphon composed of 455 places in 10 ms
Reduce places removed 455 places and 0 transitions.
Iterating global reduction 3 with 910 rules applied. Total rules applied 1610 place count 3198 transition count 3698
Discarding 604 places :
Symmetric choice reduction at 3 with 604 rule applications. Total rules 2214 place count 2594 transition count 3094
Iterating global reduction 3 with 604 rules applied. Total rules applied 2818 place count 2594 transition count 3094
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 2818 place count 2594 transition count 2919
Deduced a syphon composed of 175 places in 26 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 3168 place count 2419 transition count 2919
Performed 634 Post agglomeration using F-continuation condition.Transition count delta: 634
Deduced a syphon composed of 634 places in 9 ms
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 3 with 1268 rules applied. Total rules applied 4436 place count 1785 transition count 2285
Partial Free-agglomeration rule applied 152 times.
Drop transitions (Partial Free agglomeration) removed 152 transitions
Iterating global reduction 3 with 152 rules applied. Total rules applied 4588 place count 1785 transition count 2285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4589 place count 1784 transition count 2284
Applied a total of 4589 rules in 1377 ms. Remains 1784 /4003 variables (removed 2219) and now considering 2284/4503 (removed 2219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1389 ms. Remains : 1784/4003 places, 2284/4503 transitions.
RANDOM walk for 40000 steps (20 resets) in 828 ms. (48 steps per ms) remains 9/10 properties
FORMULA ShieldRVs-PT-100B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
// Phase 1: matrix 2284 rows 1784 cols
[2024-06-01 20:37:47] [INFO ] Computed 401 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1372/1780 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1780 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2282/4062 variables, 1780/2180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4062 variables, 0/2180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6/4068 variables, 4/2184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4068 variables, 1/2185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4068 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/4068 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4068/4068 variables, and 2185 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1784/1784 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/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1372/1780 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:37:52] [INFO ] Deduced a trap composed of 12 places in 503 ms of which 7 ms to minimize.
[2024-06-01 20:37:52] [INFO ] Deduced a trap composed of 14 places in 421 ms of which 7 ms to minimize.
[2024-06-01 20:37:53] [INFO ] Deduced a trap composed of 13 places in 460 ms of which 6 ms to minimize.
[2024-06-01 20:37:53] [INFO ] Deduced a trap composed of 9 places in 426 ms of which 6 ms to minimize.
[2024-06-01 20:37:54] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 11 ms to minimize.
[2024-06-01 20:37:54] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 8 ms to minimize.
[2024-06-01 20:37:54] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 6 ms to minimize.
[2024-06-01 20:37:55] [INFO ] Deduced a trap composed of 14 places in 451 ms of which 6 ms to minimize.
[2024-06-01 20:37:55] [INFO ] Deduced a trap composed of 22 places in 408 ms of which 6 ms to minimize.
[2024-06-01 20:37:56] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 6 ms to minimize.
[2024-06-01 20:37:56] [INFO ] Deduced a trap composed of 12 places in 382 ms of which 6 ms to minimize.
[2024-06-01 20:37:57] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 6 ms to minimize.
[2024-06-01 20:37:57] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 6 ms to minimize.
[2024-06-01 20:37:57] [INFO ] Deduced a trap composed of 14 places in 384 ms of which 6 ms to minimize.
[2024-06-01 20:37:58] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 5 ms to minimize.
[2024-06-01 20:37:58] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 6 ms to minimize.
[2024-06-01 20:37:59] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 5 ms to minimize.
[2024-06-01 20:37:59] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 5 ms to minimize.
[2024-06-01 20:37:59] [INFO ] Deduced a trap composed of 15 places in 326 ms of which 6 ms to minimize.
[2024-06-01 20:38:00] [INFO ] Deduced a trap composed of 21 places in 329 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1780 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:00] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 5 ms to minimize.
[2024-06-01 20:38:01] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 5 ms to minimize.
[2024-06-01 20:38:01] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 6 ms to minimize.
[2024-06-01 20:38:01] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 4 ms to minimize.
[2024-06-01 20:38:02] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 6 ms to minimize.
[2024-06-01 20:38:02] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 5 ms to minimize.
[2024-06-01 20:38:02] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 5 ms to minimize.
[2024-06-01 20:38:03] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 5 ms to minimize.
[2024-06-01 20:38:03] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 5 ms to minimize.
[2024-06-01 20:38:03] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 5 ms to minimize.
[2024-06-01 20:38:04] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 5 ms to minimize.
[2024-06-01 20:38:04] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 7 ms to minimize.
[2024-06-01 20:38:05] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 4 ms to minimize.
[2024-06-01 20:38:05] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 5 ms to minimize.
[2024-06-01 20:38:05] [INFO ] Deduced a trap composed of 21 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:38:06] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 4 ms to minimize.
[2024-06-01 20:38:06] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 5 ms to minimize.
[2024-06-01 20:38:06] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 5 ms to minimize.
[2024-06-01 20:38:07] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 4 ms to minimize.
[2024-06-01 20:38:07] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1780 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:07] [INFO ] Deduced a trap composed of 8 places in 356 ms of which 5 ms to minimize.
[2024-06-01 20:38:08] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 5 ms to minimize.
[2024-06-01 20:38:08] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 5 ms to minimize.
[2024-06-01 20:38:09] [INFO ] Deduced a trap composed of 32 places in 321 ms of which 5 ms to minimize.
[2024-06-01 20:38:09] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 5 ms to minimize.
[2024-06-01 20:38:09] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 5 ms to minimize.
[2024-06-01 20:38:10] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 5 ms to minimize.
[2024-06-01 20:38:10] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 5 ms to minimize.
[2024-06-01 20:38:10] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 5 ms to minimize.
[2024-06-01 20:38:11] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:38:11] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-06-01 20:38:11] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 3 ms to minimize.
[2024-06-01 20:38:11] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:38:12] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:38:12] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:38:12] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:38:13] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:38:13] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 4 ms to minimize.
[2024-06-01 20:38:13] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:38:13] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1780 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:14] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 5 ms to minimize.
[2024-06-01 20:38:14] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 4 ms to minimize.
[2024-06-01 20:38:14] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:38:15] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 5 ms to minimize.
[2024-06-01 20:38:15] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 5 ms to minimize.
[2024-06-01 20:38:15] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:38:16] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:38:16] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:38:16] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:38:17] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:38:17] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:38:17] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:38:17] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:38:18] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:38:18] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:38:18] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 4 ms to minimize.
[2024-06-01 20:38:18] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:38:19] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 4 ms to minimize.
[2024-06-01 20:38:19] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:38:19] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1780 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:20] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:38:20] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 5 ms to minimize.
[2024-06-01 20:38:20] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:38:21] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:38:21] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 5 ms to minimize.
[2024-06-01 20:38:21] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:38:22] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:38:22] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:38:22] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:38:22] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:38:23] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:38:23] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:38:23] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 4 ms to minimize.
[2024-06-01 20:38:23] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 4 ms to minimize.
[2024-06-01 20:38:24] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 4 ms to minimize.
[2024-06-01 20:38:24] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:38:24] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:38:25] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:38:25] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:38:25] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1780 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:25] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:38:26] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:38:26] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:38:26] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:38:27] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:38:27] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:38:27] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 4 ms to minimize.
[2024-06-01 20:38:27] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:38:28] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:38:28] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:38:28] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:38:28] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:38:29] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
[2024-06-01 20:38:29] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:38:29] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:38:29] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:38:29] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:38:30] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:38:30] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:38:30] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1780 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:30] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 4 ms to minimize.
[2024-06-01 20:38:31] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 4 ms to minimize.
[2024-06-01 20:38:31] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:38:31] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:38:31] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:38:32] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 4 ms to minimize.
[2024-06-01 20:38:32] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:38:32] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:38:32] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 4 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:38:34] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:38:34] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:38:34] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:38:34] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:38:34] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1780 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:35] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:38:35] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:38:35] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:38:35] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:38:36] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:38:36] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
SMT process timed out in 49336ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 408 out of 1784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1784/1784 places, 2284/2284 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1783 transition count 2283
Applied a total of 2 rules in 470 ms. Remains 1783 /1784 variables (removed 1) and now considering 2283/2284 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 1783/1784 places, 2283/2284 transitions.
RANDOM walk for 40000 steps (20 resets) in 898 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 322 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 69500 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 9
Probabilistic random walk after 69500 steps, saw 38935 distinct states, run finished after 3005 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 2283 rows 1783 cols
[2024-06-01 20:38:40] [INFO ] Computed 401 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1371/1779 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1779 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2281/4060 variables, 1779/2179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4060 variables, 0/2179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6/4066 variables, 4/2183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4066 variables, 1/2184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4066 variables, 0/2184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/4066 variables, 0/2184 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4066/4066 variables, and 2184 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4059 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1783/1783 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/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1371/1779 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:45] [INFO ] Deduced a trap composed of 11 places in 398 ms of which 6 ms to minimize.
[2024-06-01 20:38:46] [INFO ] Deduced a trap composed of 8 places in 409 ms of which 5 ms to minimize.
[2024-06-01 20:38:46] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 6 ms to minimize.
[2024-06-01 20:38:46] [INFO ] Deduced a trap composed of 12 places in 377 ms of which 6 ms to minimize.
[2024-06-01 20:38:47] [INFO ] Deduced a trap composed of 17 places in 374 ms of which 5 ms to minimize.
[2024-06-01 20:38:47] [INFO ] Deduced a trap composed of 16 places in 364 ms of which 5 ms to minimize.
[2024-06-01 20:38:48] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 5 ms to minimize.
[2024-06-01 20:38:48] [INFO ] Deduced a trap composed of 8 places in 378 ms of which 6 ms to minimize.
[2024-06-01 20:38:48] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 5 ms to minimize.
[2024-06-01 20:38:49] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 5 ms to minimize.
[2024-06-01 20:38:49] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 5 ms to minimize.
[2024-06-01 20:38:50] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:38:50] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 5 ms to minimize.
[2024-06-01 20:38:50] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 5 ms to minimize.
[2024-06-01 20:38:51] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 5 ms to minimize.
[2024-06-01 20:38:51] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 5 ms to minimize.
[2024-06-01 20:38:51] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 5 ms to minimize.
[2024-06-01 20:38:52] [INFO ] Deduced a trap composed of 21 places in 323 ms of which 4 ms to minimize.
[2024-06-01 20:38:52] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 5 ms to minimize.
[2024-06-01 20:38:53] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1779 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:53] [INFO ] Deduced a trap composed of 14 places in 320 ms of which 4 ms to minimize.
[2024-06-01 20:38:53] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 5 ms to minimize.
[2024-06-01 20:38:54] [INFO ] Deduced a trap composed of 18 places in 345 ms of which 5 ms to minimize.
[2024-06-01 20:38:54] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 4 ms to minimize.
[2024-06-01 20:38:54] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:38:55] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 5 ms to minimize.
[2024-06-01 20:38:55] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 5 ms to minimize.
[2024-06-01 20:38:55] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:38:56] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:38:56] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:38:56] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 5 ms to minimize.
[2024-06-01 20:38:57] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:38:57] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:38:57] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:38:57] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:38:58] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 5 ms to minimize.
[2024-06-01 20:38:58] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:38:58] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:38:59] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:38:59] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1779 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:38:59] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 3 ms to minimize.
[2024-06-01 20:39:00] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:39:00] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:39:00] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:39:00] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 4 ms to minimize.
[2024-06-01 20:39:01] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 4 ms to minimize.
[2024-06-01 20:39:01] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:39:01] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:39:01] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 4 ms to minimize.
[2024-06-01 20:39:02] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:39:02] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:39:02] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:39:02] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:39:03] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:39:03] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 2 ms to minimize.
[2024-06-01 20:39:03] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:39:03] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:39:03] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:39:04] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:39:04] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1779 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:04] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 5 ms to minimize.
[2024-06-01 20:39:05] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 5 ms to minimize.
[2024-06-01 20:39:05] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 5 ms to minimize.
[2024-06-01 20:39:05] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 5 ms to minimize.
[2024-06-01 20:39:06] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 4 ms to minimize.
[2024-06-01 20:39:06] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:39:06] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:39:07] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 4 ms to minimize.
[2024-06-01 20:39:07] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:39:07] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:39:07] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:39:08] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:39:08] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:39:08] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:39:09] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:39:09] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:39:09] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:39:10] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 4 ms to minimize.
[2024-06-01 20:39:10] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:39:10] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1779 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:10] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:39:11] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:39:11] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:39:11] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:39:11] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 4 ms to minimize.
[2024-06-01 20:39:12] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:39:12] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:39:12] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:39:12] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:39:12] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:39:13] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:39:13] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:39:13] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 4 ms to minimize.
[2024-06-01 20:39:13] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1779 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:15] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:39:15] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:39:15] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 4 ms to minimize.
[2024-06-01 20:39:15] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:39:16] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 2 ms to minimize.
[2024-06-01 20:39:16] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:39:16] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 5 ms to minimize.
[2024-06-01 20:39:16] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1779 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1779 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:23] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:39:23] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:39:23] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:39:23] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:39:24] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:39:24] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:39:24] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 4 ms to minimize.
[2024-06-01 20:39:24] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:39:25] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:39:25] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 4 ms to minimize.
[2024-06-01 20:39:25] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:39:25] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:39:26] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:39:26] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2024-06-01 20:39:26] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 2 ms to minimize.
[2024-06-01 20:39:26] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:39:26] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:39:27] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:39:27] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:39:27] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1779 variables, 20/560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:27] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:39:28] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:39:28] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:39:28] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 2 ms to minimize.
[2024-06-01 20:39:28] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:39:28] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:39:29] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:39:29] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:39:29] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:39:29] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:39:29] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:39:30] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:39:30] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-06-01 20:39:30] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:39:30] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:39:30] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:39:31] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:39:31] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:39:31] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-06-01 20:39:31] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1779 variables, 20/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:31] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:39:34] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2024-06-01 20:39:34] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:39:34] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:39:34] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:39:34] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:39:35] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:39:35] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1779 variables, 20/600 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:35] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:39:35] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:39:35] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:39:36] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:39:36] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:39:36] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:39:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:39:36] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:39:37] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:39:37] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:39:37] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:39:37] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:39:37] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:39:38] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1779 variables, 14/614 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:38] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-06-01 20:39:38] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:39:38] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:39:39] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:39:39] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:39:39] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:39:39] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-06-01 20:39:39] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:39:40] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:39:40] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1779 variables, 10/624 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:40] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:39:40] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:39:40] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:39:42] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:39:42] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:39:42] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:39:42] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:39:43] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:39:43] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:39:43] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:39:43] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1779 variables, 17/641 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:44] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:39:44] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:39:44] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:39:44] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:39:44] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:39:45] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:39:45] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:39:45] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-06-01 20:39:45] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:39:46] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:39:46] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:39:46] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:39:46] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:39:47] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:39:47] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:39:47] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:39:47] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:39:47] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:39:48] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:39:48] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1779 variables, 20/661 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:48] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:39:48] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:39:48] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:39:49] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:39:49] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:39:49] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1779 variables, 6/667 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:50] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-06-01 20:39:50] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:39:50] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:39:50] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:39:51] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1779 variables, 5/672 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:51] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 5 ms to minimize.
[2024-06-01 20:39:51] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1779 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:52] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:39:52] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:39:52] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:39:53] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:39:53] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:39:53] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1779 variables, 6/680 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:53] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1779 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:54] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
[2024-06-01 20:39:54] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:39:54] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:39:55] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:39:55] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:39:55] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:39:55] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1779 variables, 7/688 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:56] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:39:56] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1779 variables, 2/690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:57] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:39:57] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1779 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:57] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:39:57] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:39:58] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:39:58] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1779 variables, 4/696 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:58] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1779 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:39:59] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:39:59] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1779/4066 variables, and 699 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75024 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1783 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 299/299 constraints]
After SMT, in 79198ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 408 out of 1783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1783/1783 places, 2283/2283 transitions.
Applied a total of 0 rules in 102 ms. Remains 1783 /1783 variables (removed 0) and now considering 2283/2283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 1783/1783 places, 2283/2283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1783/1783 places, 2283/2283 transitions.
Applied a total of 0 rules in 99 ms. Remains 1783 /1783 variables (removed 0) and now considering 2283/2283 (removed 0) transitions.
[2024-06-01 20:40:00] [INFO ] Invariant cache hit.
[2024-06-01 20:40:00] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-06-01 20:40:00] [INFO ] Invariant cache hit.
[2024-06-01 20:40:02] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
[2024-06-01 20:40:02] [INFO ] Redundant transitions in 341 ms returned []
Running 2279 sub problems to find dead transitions.
[2024-06-01 20:40:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1779 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1779/4066 variables, and 3 constraints, problems are : Problem set: 0 solved, 2279 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 3/401 constraints, State Equation: 0/1783 constraints, PredecessorRefiner: 2279/2279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1779 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1779/4066 variables, and 3 constraints, problems are : Problem set: 0 solved, 2279 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/401 constraints, State Equation: 0/1783 constraints, PredecessorRefiner: 0/2279 constraints, Known Traps: 0/0 constraints]
After SMT, in 61159ms problems are : Problem set: 0 solved, 2279 unsolved
Search for dead transitions found 0 dead transitions in 61182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64203 ms. Remains : 1783/1783 places, 2283/2283 transitions.
[2024-06-01 20:41:04] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 20:41:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1783 places, 2283 transitions and 10226 arcs took 18 ms.
[2024-06-01 20:41:04] [INFO ] Flatten gal took : 227 ms
Total runtime 213425 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 : ShieldRVs-PT-100B-ReachabilityFireability-2023-00
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2023-07
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-100B-ReachabilityFireability-2023-15

BK_STOP 1717274465002

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2023-00
rfs formula type AG
rfs formula formula --invariant=/tmp/1903/inv_0_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/1903/inv_1_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/1903/inv_2_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1903/inv_3_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2023-07
rfs formula type EF
rfs formula formula --invariant=/tmp/1903/inv_4_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/1903/inv_5_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/1903/inv_6_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/1903/inv_7_
rfs formula name ShieldRVs-PT-100B-ReachabilityFireability-2023-15
rfs formula type AG
rfs formula formula --invariant=/tmp/1903/inv_8_
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="ShieldRVs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762000879"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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