About the Execution of LTSMin+red for ShieldRVs-PT-020A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 484.472 | 74598.00 | 106273.00 | 184.40 | FT?FTTTFTTTT?TFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761900807.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-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761900807
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K 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 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 17:51 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 127K 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-020A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717266150069
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-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:22:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:22:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:22:31] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-01 18:22:31] [INFO ] Transformed 283 places.
[2024-06-01 18:22:31] [INFO ] Transformed 383 transitions.
[2024-06-01 18:22:31] [INFO ] Found NUPN structural information;
[2024-06-01 18:22:31] [INFO ] Parsed PT model containing 283 places and 383 transitions and 1840 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (144 resets) in 1813 ms. (22 steps per ms) remains 5/16 properties
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 376 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 142 ms. (279 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 1416 ms. (28 steps per ms) remains 4/4 properties
// Phase 1: matrix 383 rows 283 cols
[2024-06-01 18:22:32] [INFO ] Computed 81 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ShieldRVs-PT-020A-ReachabilityFireability-2024-14 is UNSAT
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 112/271 variables, 75/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 112/346 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/283 variables, 6/352 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 12/364 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/364 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 383/666 variables, 283/647 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/647 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/666 variables, 0/647 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 647 constraints, problems are : Problem set: 1 solved, 3 unsolved in 670 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 139/249 variables, 67/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 139/316 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 18:22:33] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/317 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 34/283 variables, 14/331 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 34/365 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 18:22:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/366 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/366 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 383/666 variables, 283/649 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 3/652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 18:22:34] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-06-01 18:22:34] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:22:34] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 18:22:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 4/656 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/656 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/656 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 656 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1626 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 2492ms problems are : Problem set: 1 solved, 3 unsolved
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1758 ms.
Support contains 104 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 383/383 transitions.
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 283 transition count 383
Applied a total of 23 rules in 56 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 283/283 places, 383/383 transitions.
RANDOM walk for 40000 steps (157 resets) in 479 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (22 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (18 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 598692 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 2
Probabilistic random walk after 598692 steps, saw 114497 distinct states, run finished after 3004 ms. (steps per millisecond=199 ) properties seen :0
// Phase 1: matrix 383 rows 283 cols
[2024-06-01 18:22:40] [INFO ] Computed 81 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 141/245 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 141/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/283 variables, 15/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 38/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 383/666 variables, 283/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/666 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/666 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 647 constraints, problems are : Problem set: 0 solved, 2 unsolved in 255 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 141/245 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 141/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:22:40] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/283 variables, 15/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 38/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 383/666 variables, 283/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 18:22:41] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:22:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 664 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1917 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 2232ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 781 ms.
Support contains 104 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 28 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 283/283 places, 383/383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 13 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2024-06-01 18:22:43] [INFO ] Invariant cache hit.
[2024-06-01 18:22:43] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 18:22:43] [INFO ] Invariant cache hit.
[2024-06-01 18:22:43] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-06-01 18:22:43] [INFO ] Redundant transitions in 67 ms returned []
Running 382 sub problems to find dead transitions.
[2024-06-01 18:22:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 81/363 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:22:49] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-06-01 18:22:50] [INFO ] Deduced a trap composed of 7 places in 892 ms of which 2 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:22:51] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:22:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 18:22:53] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:22:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:22:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:22:56] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:22:56] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:22:56] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:22:56] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:22:56] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:22:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 18:22:57] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:22:57] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:22:58] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 10/434 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:22:58] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:22:58] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:22:58] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 18:22:58] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 18:22:59] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:23:00] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:23:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:03] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:23:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
[2024-06-01 18:23:05] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 18:23:05] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:23:05] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:23:05] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 18:23:05] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 18:23:05] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 18/492 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:23:07] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 18:23:08] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 18:23:09] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:09] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-01 18:23:09] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:23:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 18:23:09] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 18:23:10] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:23:10] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 18:23:10] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 18:23:10] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 18:23:10] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 18:23:10] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 18:23:10] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 11/523 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 283/666 variables, and 523 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30030 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/283 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 159/159 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 81/363 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 159/523 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:23:16] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 18:23:16] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:23:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 18:23:16] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:23:16] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:23:16] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:23:17] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:23:17] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:23:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:23:17] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 18:23:17] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:23:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 13/536 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:19] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:23:19] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2024-06-01 18:23:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 18:23:19] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:23:19] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:23:20] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-06-01 18:23:21] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 14/550 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2024-06-01 18:23:22] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 8/558 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:23:25] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:23:26] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:27] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 18:23:29] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 18:23:30] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 18:23:30] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:23:30] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 18:23:30] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 12/591 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 12 (OVERLAPS) 383/666 variables, 283/874 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 382/1256 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 18:23:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
[2024-06-01 18:23:43] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 18:23:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 18:23:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 18:23:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 1261 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30025 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 232/232 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60650 ms. Remains : 283/283 places, 383/383 transitions.
[2024-06-01 18:23:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-01 18:23:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 283 places, 383 transitions and 1882 arcs took 7 ms.
[2024-06-01 18:23:44] [INFO ] Flatten gal took : 72 ms
Total runtime 73160 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldRVs-PT-020A-ReachabilityFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-020A-ReachabilityFireability-2024-12
BK_STOP 1717266224667
--------------------
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-020A-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/1287/inv_0_
rfs formula name ShieldRVs-PT-020A-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1287/inv_1_
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-020A"
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-020A, 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-171683761900807"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020A.tgz
mv ShieldRVs-PT-020A 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 '
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 ;