fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683760400138
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2265.184 187970.00 269602.00 333.70 ??????????T????? 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-171683760400138.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPs-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 675K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717229128245

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:05:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:05:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:05:29] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-06-01 08:05:29] [INFO ] Transformed 2403 places.
[2024-06-01 08:05:29] [INFO ] Transformed 2363 transitions.
[2024-06-01 08:05:29] [INFO ] Found NUPN structural information;
[2024-06-01 08:05:29] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 161 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 259 places :
Symmetric choice reduction at 0 with 259 rule applications. Total rules 259 place count 2144 transition count 2104
Iterating global reduction 0 with 259 rules applied. Total rules applied 518 place count 2144 transition count 2104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 519 place count 2143 transition count 2103
Iterating global reduction 0 with 1 rules applied. Total rules applied 520 place count 2143 transition count 2103
Applied a total of 520 rules in 587 ms. Remains 2143 /2403 variables (removed 260) and now considering 2103/2363 (removed 260) transitions.
// Phase 1: matrix 2103 rows 2143 cols
[2024-06-01 08:05:30] [INFO ] Computed 361 invariants in 40 ms
[2024-06-01 08:05:31] [INFO ] Implicit Places using invariants in 999 ms returned []
[2024-06-01 08:05:31] [INFO ] Invariant cache hit.
[2024-06-01 08:05:33] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 2984 ms to find 0 implicit places.
Running 2102 sub problems to find dead transitions.
[2024-06-01 08:05:33] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2142/4246 variables, and 0 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2143 constraints, PredecessorRefiner: 2102/2102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2102 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2142/4246 variables, and 0 constraints, problems are : Problem set: 0 solved, 2102 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2143 constraints, PredecessorRefiner: 0/2102 constraints, Known Traps: 0/0 constraints]
After SMT, in 60790ms problems are : Problem set: 0 solved, 2102 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Starting structural reductions in LTL mode, iteration 1 : 2143/2403 places, 2103/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64429 ms. Remains : 2143/2403 places, 2103/2363 transitions.
Support contains 161 out of 2143 places after structural reductions.
[2024-06-01 08:06:34] [INFO ] Flatten gal took : 165 ms
[2024-06-01 08:06:34] [INFO ] Flatten gal took : 106 ms
[2024-06-01 08:06:34] [INFO ] Input system was already deterministic with 2103 transitions.
Support contains 149 out of 2143 places (down from 161) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2159 ms. (18 steps per ms) remains 13/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
[2024-06-01 08:06:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 2055/2091 variables, 352/352 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2091 variables, 0/352 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 52/2143 variables, 9/361 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2143 variables, 0/361 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2103/4246 variables, 2143/2504 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4246 variables, 0/2504 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/4246 variables, 0/2504 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4246/4246 variables, and 2504 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2840 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2143/2143 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 478/512 variables, 64/64 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 18 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-06-01 08:06:39] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 7/71 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1631/2143 variables, 297/368 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 5 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 4 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 4 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 4 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 5 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 5 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 5 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 4 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 4 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 4 ms to minimize.
[2024-06-01 08:06:43] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 4 ms to minimize.
[2024-06-01 08:06:43] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 4 ms to minimize.
[2024-06-01 08:06:43] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 5 ms to minimize.
[2024-06-01 08:06:43] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 4 ms to minimize.
[2024-06-01 08:06:44] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 4 ms to minimize.
SMT process timed out in 8007ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 2143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 2143 transition count 1913
Reduce places removed 190 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 192 rules applied. Total rules applied 382 place count 1953 transition count 1911
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 384 place count 1951 transition count 1911
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 384 place count 1951 transition count 1712
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 782 place count 1752 transition count 1712
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 797 place count 1737 transition count 1697
Iterating global reduction 3 with 15 rules applied. Total rules applied 812 place count 1737 transition count 1697
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 812 place count 1737 transition count 1689
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 828 place count 1729 transition count 1689
Performed 694 Post agglomeration using F-continuation condition.Transition count delta: 694
Deduced a syphon composed of 694 places in 2 ms
Reduce places removed 694 places and 0 transitions.
Iterating global reduction 3 with 1388 rules applied. Total rules applied 2216 place count 1035 transition count 995
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 264 times.
Drop transitions (Partial Free agglomeration) removed 264 transitions
Iterating global reduction 3 with 264 rules applied. Total rules applied 2480 place count 1035 transition count 995
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2481 place count 1034 transition count 994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2482 place count 1033 transition count 994
Applied a total of 2482 rules in 733 ms. Remains 1033 /2143 variables (removed 1110) and now considering 994/2103 (removed 1109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 1033/2143 places, 994/2103 transitions.
RANDOM walk for 40000 steps (9 resets) in 730 ms. (54 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
// Phase 1: matrix 994 rows 1033 cols
[2024-06-01 08:06:45] [INFO ] Computed 360 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/111 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 661/772 variables, 234/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/772 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/784 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 780/1564 variables, 784/1055 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1564 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 114/1678 variables, 50/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1678 variables, 14/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1678 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/1682 variables, 3/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 2/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 4/1686 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 106/1792 variables, 63/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1792 variables, 16/1205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1792 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/1794 variables, 3/1208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1794 variables, 2/1210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1794 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/1796 variables, 1/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1796 variables, 2/1213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1796 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/1798 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1798 variables, 2/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1798 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1/1799 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1799 variables, 1/1218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1799 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 55/1854 variables, 30/1248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1854 variables, 12/1260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1854 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 1/1855 variables, 1/1261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1855 variables, 1/1262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1855 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 2/1857 variables, 1/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1857 variables, 2/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1857 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 53/1910 variables, 26/1291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1910 variables, 7/1298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1910 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 1/1911 variables, 1/1299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1911 variables, 1/1300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1911 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 2/1913 variables, 1/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1913 variables, 2/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1913 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 41/1954 variables, 20/1323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1954 variables, 7/1330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1954 variables, 0/1330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 1/1955 variables, 2/1332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1955 variables, 1/1333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1955 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 50/2005 variables, 26/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2005 variables, 7/1366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2005 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 1/2006 variables, 1/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2006 variables, 1/1368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2006 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 2/2008 variables, 1/1369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2008 variables, 2/1371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2008 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 16/2024 variables, 12/1383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2024 variables, 4/1387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2024 variables, 0/1387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 1/2025 variables, 2/1389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2025 variables, 1/1390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2025 variables, 0/1390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 2/2027 variables, 2/1392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2027 variables, 1/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2027 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 0/2027 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2027/2027 variables, and 1393 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2276 ms.
Refiners :[Positive P Invariants (semi-flows): 353/353 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1033/1033 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/111 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 661/772 variables, 234/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:47] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/772 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 12/784 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 780/1564 variables, 784/1061 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1564 variables, 3/1064 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:06:48] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:06:49] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:06:49] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:06:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:06:49] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1564 variables, 6/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:49] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1564 variables, 1/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1564 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 114/1678 variables, 50/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1678 variables, 14/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1678 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/1682 variables, 3/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1682 variables, 2/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1682 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 4/1686 variables, 2/1142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1686 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 106/1792 variables, 63/1205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1792 variables, 16/1221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:50] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:06:50] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:06:50] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:06:50] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1792 variables, 4/1225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:50] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1792 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1792 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 2/1794 variables, 3/1229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1794 variables, 2/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1794 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 2/1796 variables, 1/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1796 variables, 2/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1796 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 2/1798 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1798 variables, 2/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1798 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 1/1799 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1799 variables, 1/1239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1799 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 55/1854 variables, 30/1269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1854 variables, 12/1281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1854 variables, 0/1281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 1/1855 variables, 1/1282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1855 variables, 1/1283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1855 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 2/1857 variables, 1/1284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1857 variables, 2/1286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1857 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 53/1910 variables, 26/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1910 variables, 7/1319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:51] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/1910 variables, 2/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1910 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 1/1911 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1911 variables, 1/1323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 4 ms to minimize.
[2024-06-01 08:06:52] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/1911 variables, 3/1326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1911 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 2/1913 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1913 variables, 2/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1913 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 41/1954 variables, 20/1349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1954 variables, 7/1356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1954 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 1/1955 variables, 2/1358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1955 variables, 1/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1955 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 50/2005 variables, 26/1385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2005 variables, 7/1392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2005 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (OVERLAPS) 1/2006 variables, 1/1393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2006 variables, 1/1394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2006 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 2/2008 variables, 1/1395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2008 variables, 2/1397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2008 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 16/2024 variables, 12/1409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2024 variables, 4/1413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2024 variables, 0/1413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 1/2025 variables, 2/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2025 variables, 1/1416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:54] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
At refinement iteration 79 (INCLUDED_ONLY) 0/2025 variables, 1/1417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 08:06:54] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/2025 variables, 1/1418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2025 variables, 0/1418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 2/2027 variables, 2/1420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2027 variables, 1/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2027 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 0/2027 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2027/2027 variables, and 1421 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7210 ms.
Refiners :[Positive P Invariants (semi-flows): 353/353 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1033/1033 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 25/25 constraints]
After SMT, in 9534ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4174 ms.
Support contains 15 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 994/994 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1033 transition count 992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1031 transition count 992
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1031 transition count 990
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1029 transition count 990
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 38 place count 1014 transition count 975
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 1014 transition count 975
Applied a total of 47 rules in 117 ms. Remains 1014 /1033 variables (removed 19) and now considering 975/994 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1014/1033 places, 975/994 transitions.
RANDOM walk for 40000 steps (8 resets) in 732 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 176552 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :1 out of 3
Probabilistic random walk after 176552 steps, saw 164896 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :1
// Phase 1: matrix 975 rows 1014 cols
[2024-06-01 08:07:02] [INFO ] Computed 360 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 642/736 variables, 232/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/736 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/742 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 726/1468 variables, 742/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/1542 variables, 28/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 9/1042 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1543 variables, 1/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1543 variables, 1/1044 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1543 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1545 variables, 1/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1545 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 117/1662 variables, 57/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 15/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1662 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1664 variables, 2/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1664 variables, 2/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1664 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/1668 variables, 2/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1668 variables, 4/1127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1668 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/1670 variables, 1/1128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1670 variables, 2/1130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1670 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/1671 variables, 1/1131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1671 variables, 1/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1671 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 94/1765 variables, 46/1178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1765 variables, 15/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1765 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 3/1768 variables, 4/1197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1768 variables, 3/1200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1768 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 16/1784 variables, 7/1207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1784 variables, 2/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1784 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 85/1869 variables, 56/1265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1869 variables, 11/1276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1869 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 3/1872 variables, 2/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1872 variables, 1/1279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1872 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 2/1874 variables, 1/1280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1874 variables, 2/1282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1874 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 42/1916 variables, 22/1304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1916 variables, 7/1311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1916 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 1/1917 variables, 2/1313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1917 variables, 1/1314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1917 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 50/1967 variables, 26/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1967 variables, 7/1347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1967 variables, 0/1347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 1/1968 variables, 1/1348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1968 variables, 1/1349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1968 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 2/1970 variables, 1/1350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1970 variables, 2/1352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1970 variables, 0/1352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 16/1986 variables, 12/1364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1986 variables, 4/1368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1986 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 1/1987 variables, 2/1370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1987 variables, 1/1371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1987 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 2/1989 variables, 2/1373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1989 variables, 1/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1989 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 0/1989 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1989/1989 variables, and 1374 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1627 ms.
Refiners :[Positive P Invariants (semi-flows): 356/356 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1014/1014 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 642/736 variables, 232/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/736 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/742 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 726/1468 variables, 742/1009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 12/1023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 74/1542 variables, 28/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1542 variables, 9/1060 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1542 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1542 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1543 variables, 1/1062 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1543 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1543 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1545 variables, 1/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1545 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 117/1662 variables, 57/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1662 variables, 15/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1662 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/1664 variables, 2/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1664 variables, 2/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1664 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/1668 variables, 2/1142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1668 variables, 4/1146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1668 variables, 1/1147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1668 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 2/1670 variables, 1/1148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1670 variables, 2/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:07] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1670 variables, 1/1151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1670 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 1/1671 variables, 1/1152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1671 variables, 1/1153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1671 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 94/1765 variables, 46/1199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1765 variables, 15/1214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:08] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/1765 variables, 1/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1765 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 3/1768 variables, 4/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1768 variables, 3/1222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1768 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 16/1784 variables, 7/1229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1784 variables, 2/1231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:08] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1784 variables, 1/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1784 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 85/1869 variables, 56/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1869 variables, 11/1299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1869 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 3/1872 variables, 2/1301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1872 variables, 1/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1872 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 2/1874 variables, 1/1303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1874 variables, 2/1305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/1874 variables, 4/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1874 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 42/1916 variables, 22/1331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1916 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1916 variables, 0/1338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 1/1917 variables, 2/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1917 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1917 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 50/1967 variables, 26/1367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1967 variables, 7/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1967 variables, 0/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 1/1968 variables, 1/1375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1968 variables, 1/1376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1968 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 2/1970 variables, 1/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1970 variables, 2/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:10] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:07:10] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:07:10] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/1970 variables, 3/1382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1970 variables, 0/1382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 16/1986 variables, 12/1394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1986 variables, 4/1398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1986 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 1/1987 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1987 variables, 1/1401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:11] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:07:11] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/1987 variables, 2/1403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1987 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 2/1989 variables, 2/1405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1989 variables, 1/1406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:11] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:07:12] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:07:12] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
At refinement iteration 85 (INCLUDED_ONLY) 0/1989 variables, 3/1409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1989 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 0/1989 variables, 0/1409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1989/1989 variables, and 1409 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8199 ms.
Refiners :[Positive P Invariants (semi-flows): 356/356 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1014/1014 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints]
After SMT, in 9856ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2225 ms.
Support contains 12 out of 1014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1014/1014 places, 975/975 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1014 transition count 974
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1013 transition count 974
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1013 transition count 973
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1012 transition count 973
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1011 transition count 972
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1011 transition count 972
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1010 transition count 971
Applied a total of 8 rules in 118 ms. Remains 1010 /1014 variables (removed 4) and now considering 971/975 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1010/1014 places, 971/975 transitions.
RANDOM walk for 40000 steps (8 resets) in 661 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 180822 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 180822 steps, saw 167417 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 971 rows 1010 cols
[2024-06-01 08:07:18] [INFO ] Computed 360 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 642/736 variables, 232/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/736 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/742 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 726/1468 variables, 742/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 74/1542 variables, 28/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 9/1042 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1543 variables, 1/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1543 variables, 1/1044 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1543 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1545 variables, 1/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1545 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 117/1662 variables, 57/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 15/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1662 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1664 variables, 2/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1664 variables, 2/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1664 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/1668 variables, 2/1123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1668 variables, 4/1127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1668 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/1670 variables, 1/1128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1670 variables, 2/1130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1670 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/1671 variables, 1/1131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1671 variables, 1/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1671 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 93/1764 variables, 46/1178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1764 variables, 17/1195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1764 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/1766 variables, 2/1197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1766 variables, 2/1199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1766 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 4/1770 variables, 2/1201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1770 variables, 2/1203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1770 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 86/1856 variables, 48/1251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1856 variables, 13/1264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1856 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 2/1858 variables, 2/1266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1858 variables, 2/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1858 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 4/1862 variables, 2/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1862 variables, 4/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1862 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 46/1908 variables, 24/1298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1908 variables, 9/1307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1908 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 1/1909 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1909 variables, 1/1310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1909 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 50/1959 variables, 26/1336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1959 variables, 7/1343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1959 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 1/1960 variables, 1/1344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1960 variables, 1/1345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1960 variables, 0/1345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 2/1962 variables, 1/1346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1962 variables, 2/1348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1962 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 16/1978 variables, 12/1360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1978 variables, 4/1364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1978 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 1/1979 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1979 variables, 1/1367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1979 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 2/1981 variables, 2/1369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1981 variables, 1/1370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 0/1981 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1981/1981 variables, and 1370 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 356/356 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1010/1010 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/94 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 642/736 variables, 232/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/736 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/742 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 726/1468 variables, 742/1009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1468 variables, 4/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1468 variables, 2/1017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1468 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 74/1542 variables, 28/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1542 variables, 9/1054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1542 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/1543 variables, 1/1055 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1543 variables, 1/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1543 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1545 variables, 1/1057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1545 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 117/1662 variables, 57/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1662 variables, 15/1129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1662 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1662 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/1664 variables, 2/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1664 variables, 2/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1664 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 4/1668 variables, 2/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1668 variables, 4/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1668 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 2/1670 variables, 1/1141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1670 variables, 2/1143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1670 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1670 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 1/1671 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1671 variables, 1/1146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1671 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 93/1764 variables, 46/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1764 variables, 17/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1764 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 2/1766 variables, 2/1211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1766 variables, 2/1213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1766 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 4/1770 variables, 2/1215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1770 variables, 2/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1770 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 86/1856 variables, 48/1265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1856 variables, 13/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1856 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 2/1858 variables, 2/1280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1858 variables, 2/1282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1858 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 4/1862 variables, 2/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1862 variables, 4/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1862 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 46/1908 variables, 24/1312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1908 variables, 9/1321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1908 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 1/1909 variables, 2/1323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1909 variables, 1/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1909 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 50/1959 variables, 26/1350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1959 variables, 7/1357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1959 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 1/1960 variables, 1/1358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1960 variables, 1/1359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1960 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 2/1962 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1962 variables, 2/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1962 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 16/1978 variables, 12/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1978 variables, 4/1378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1978 variables, 0/1378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 1/1979 variables, 2/1380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1979 variables, 1/1381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1979 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 2/1981 variables, 2/1383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1981 variables, 1/1384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1981 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 0/1981 variables, 0/1384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1981/1981 variables, and 1384 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4921 ms.
Refiners :[Positive P Invariants (semi-flows): 356/356 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1010/1010 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 6570ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2128 ms.
Support contains 12 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 29 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1010/1010 places, 971/971 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Applied a total of 0 rules in 24 ms. Remains 1010 /1010 variables (removed 0) and now considering 971/971 (removed 0) transitions.
[2024-06-01 08:07:27] [INFO ] Invariant cache hit.
[2024-06-01 08:07:27] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-06-01 08:07:27] [INFO ] Invariant cache hit.
[2024-06-01 08:07:28] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-06-01 08:07:28] [INFO ] Redundant transitions in 72 ms returned []
Running 967 sub problems to find dead transitions.
[2024-06-01 08:07:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 967 unsolved
[2024-06-01 08:07:50] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:07:50] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:07:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:07:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:07:53] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:07:53] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:07:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:07:53] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1981 variables, and 120 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 96/356 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 967/967 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 967 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1007 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 967 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1007 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 967 unsolved
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 967 unsolved
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1981 variables, and 124 constraints, problems are : Problem set: 0 solved, 967 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 96/356 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1010 constraints, PredecessorRefiner: 0/967 constraints, Known Traps: 24/24 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 967 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61916 ms. Remains : 1010/1010 places, 971/971 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-01 08:08:29] [INFO ] Flatten gal took : 75 ms
[2024-06-01 08:08:29] [INFO ] Flatten gal took : 70 ms
[2024-06-01 08:08:29] [INFO ] Input system was already deterministic with 2103 transitions.
Computed a total of 494 stabilizing places and 494 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2124 transition count 2084
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2124 transition count 2084
Applied a total of 38 rules in 173 ms. Remains 2124 /2143 variables (removed 19) and now considering 2084/2103 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 2124/2143 places, 2084/2103 transitions.
[2024-06-01 08:08:29] [INFO ] Flatten gal took : 56 ms
[2024-06-01 08:08:29] [INFO ] Flatten gal took : 61 ms
[2024-06-01 08:08:29] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 2126 transition count 2086
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 2126 transition count 2086
Applied a total of 34 rules in 170 ms. Remains 2126 /2143 variables (removed 17) and now considering 2086/2103 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 2126/2143 places, 2086/2103 transitions.
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 52 ms
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 53 ms
[2024-06-01 08:08:30] [INFO ] Input system was already deterministic with 2086 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2125 transition count 2085
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2125 transition count 2085
Applied a total of 36 rules in 182 ms. Remains 2125 /2143 variables (removed 18) and now considering 2085/2103 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 2125/2143 places, 2085/2103 transitions.
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 59 ms
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 55 ms
[2024-06-01 08:08:30] [INFO ] Input system was already deterministic with 2085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2143 transition count 1905
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 1945 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 1944 transition count 1904
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 398 place count 1944 transition count 1703
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 800 place count 1743 transition count 1703
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 821 place count 1722 transition count 1682
Iterating global reduction 3 with 21 rules applied. Total rules applied 842 place count 1722 transition count 1682
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 842 place count 1722 transition count 1672
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 862 place count 1712 transition count 1672
Performed 693 Post agglomeration using F-continuation condition.Transition count delta: 693
Deduced a syphon composed of 693 places in 2 ms
Reduce places removed 693 places and 0 transitions.
Iterating global reduction 3 with 1386 rules applied. Total rules applied 2248 place count 1019 transition count 979
Applied a total of 2248 rules in 306 ms. Remains 1019 /2143 variables (removed 1124) and now considering 979/2103 (removed 1124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 306 ms. Remains : 1019/2143 places, 979/2103 transitions.
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 36 ms
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 42 ms
[2024-06-01 08:08:31] [INFO ] Input system was already deterministic with 979 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2142 transition count 1902
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1942 transition count 1902
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1942 transition count 1701
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1741 transition count 1701
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 823 place count 1720 transition count 1680
Iterating global reduction 2 with 21 rules applied. Total rules applied 844 place count 1720 transition count 1680
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 844 place count 1720 transition count 1670
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 864 place count 1710 transition count 1670
Performed 704 Post agglomeration using F-continuation condition.Transition count delta: 704
Deduced a syphon composed of 704 places in 2 ms
Reduce places removed 704 places and 0 transitions.
Iterating global reduction 2 with 1408 rules applied. Total rules applied 2272 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2274 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2275 place count 1003 transition count 964
Applied a total of 2275 rules in 316 ms. Remains 1003 /2143 variables (removed 1140) and now considering 964/2103 (removed 1139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 316 ms. Remains : 1003/2143 places, 964/2103 transitions.
[2024-06-01 08:08:31] [INFO ] Flatten gal took : 28 ms
[2024-06-01 08:08:31] [INFO ] Flatten gal took : 30 ms
[2024-06-01 08:08:31] [INFO ] Input system was already deterministic with 964 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2122 transition count 2082
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2122 transition count 2082
Applied a total of 42 rules in 171 ms. Remains 2122 /2143 variables (removed 21) and now considering 2082/2103 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 2122/2143 places, 2082/2103 transitions.
[2024-06-01 08:08:31] [INFO ] Flatten gal took : 45 ms
[2024-06-01 08:08:31] [INFO ] Flatten gal took : 48 ms
[2024-06-01 08:08:31] [INFO ] Input system was already deterministic with 2082 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2142 transition count 1903
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1943 transition count 1903
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1943 transition count 1702
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1742 transition count 1702
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 821 place count 1721 transition count 1681
Iterating global reduction 2 with 21 rules applied. Total rules applied 842 place count 1721 transition count 1681
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 842 place count 1721 transition count 1671
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 862 place count 1711 transition count 1671
Performed 705 Post agglomeration using F-continuation condition.Transition count delta: 705
Deduced a syphon composed of 705 places in 2 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 2 with 1410 rules applied. Total rules applied 2272 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2274 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2275 place count 1003 transition count 964
Applied a total of 2275 rules in 312 ms. Remains 1003 /2143 variables (removed 1140) and now considering 964/2103 (removed 1139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 313 ms. Remains : 1003/2143 places, 964/2103 transitions.
[2024-06-01 08:08:32] [INFO ] Flatten gal took : 27 ms
[2024-06-01 08:08:32] [INFO ] Flatten gal took : 29 ms
[2024-06-01 08:08:32] [INFO ] Input system was already deterministic with 964 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 2123 transition count 2083
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 2123 transition count 2083
Applied a total of 40 rules in 169 ms. Remains 2123 /2143 variables (removed 20) and now considering 2083/2103 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 2123/2143 places, 2083/2103 transitions.
[2024-06-01 08:08:32] [INFO ] Flatten gal took : 59 ms
[2024-06-01 08:08:32] [INFO ] Flatten gal took : 46 ms
[2024-06-01 08:08:32] [INFO ] Input system was already deterministic with 2083 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2124 transition count 2084
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2124 transition count 2084
Applied a total of 38 rules in 169 ms. Remains 2124 /2143 variables (removed 19) and now considering 2084/2103 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 2124/2143 places, 2084/2103 transitions.
[2024-06-01 08:08:32] [INFO ] Flatten gal took : 43 ms
[2024-06-01 08:08:32] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:08:33] [INFO ] Input system was already deterministic with 2084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2142 transition count 1904
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1944 transition count 1904
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 396 place count 1944 transition count 1703
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 798 place count 1743 transition count 1703
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 817 place count 1724 transition count 1684
Iterating global reduction 2 with 19 rules applied. Total rules applied 836 place count 1724 transition count 1684
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 836 place count 1724 transition count 1675
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 854 place count 1715 transition count 1675
Performed 705 Post agglomeration using F-continuation condition.Transition count delta: 705
Deduced a syphon composed of 705 places in 2 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 2 with 1410 rules applied. Total rules applied 2264 place count 1010 transition count 970
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2266 place count 1008 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2267 place count 1007 transition count 968
Applied a total of 2267 rules in 255 ms. Remains 1007 /2143 variables (removed 1136) and now considering 968/2103 (removed 1135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 256 ms. Remains : 1007/2143 places, 968/2103 transitions.
[2024-06-01 08:08:33] [INFO ] Flatten gal took : 26 ms
[2024-06-01 08:08:33] [INFO ] Flatten gal took : 28 ms
[2024-06-01 08:08:33] [INFO ] Input system was already deterministic with 968 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2142 transition count 1901
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1941 transition count 1901
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1941 transition count 1701
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1741 transition count 1701
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 823 place count 1720 transition count 1680
Iterating global reduction 2 with 21 rules applied. Total rules applied 844 place count 1720 transition count 1680
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 844 place count 1720 transition count 1670
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 864 place count 1710 transition count 1670
Performed 707 Post agglomeration using F-continuation condition.Transition count delta: 707
Deduced a syphon composed of 707 places in 2 ms
Reduce places removed 707 places and 0 transitions.
Iterating global reduction 2 with 1414 rules applied. Total rules applied 2278 place count 1003 transition count 963
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2280 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2281 place count 1000 transition count 961
Applied a total of 2281 rules in 263 ms. Remains 1000 /2143 variables (removed 1143) and now considering 961/2103 (removed 1142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 263 ms. Remains : 1000/2143 places, 961/2103 transitions.
[2024-06-01 08:08:33] [INFO ] Flatten gal took : 26 ms
[2024-06-01 08:08:33] [INFO ] Flatten gal took : 27 ms
[2024-06-01 08:08:33] [INFO ] Input system was already deterministic with 961 transitions.
RANDOM walk for 19 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-040B-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 2126 transition count 2086
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 2126 transition count 2086
Applied a total of 34 rules in 187 ms. Remains 2126 /2143 variables (removed 17) and now considering 2086/2103 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 2126/2143 places, 2086/2103 transitions.
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:08:34] [INFO ] Input system was already deterministic with 2086 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2122 transition count 2082
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2122 transition count 2082
Applied a total of 42 rules in 168 ms. Remains 2122 /2143 variables (removed 21) and now considering 2082/2103 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 2122/2143 places, 2082/2103 transitions.
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 43 ms
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 46 ms
[2024-06-01 08:08:34] [INFO ] Input system was already deterministic with 2082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 2125 transition count 2085
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 2125 transition count 2085
Applied a total of 36 rules in 189 ms. Remains 2125 /2143 variables (removed 18) and now considering 2085/2103 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 2125/2143 places, 2085/2103 transitions.
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 43 ms
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 46 ms
[2024-06-01 08:08:34] [INFO ] Input system was already deterministic with 2085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2142 transition count 1901
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1941 transition count 1901
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1941 transition count 1700
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1740 transition count 1700
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 825 place count 1719 transition count 1679
Iterating global reduction 2 with 21 rules applied. Total rules applied 846 place count 1719 transition count 1679
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 846 place count 1719 transition count 1669
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 866 place count 1709 transition count 1669
Performed 705 Post agglomeration using F-continuation condition.Transition count delta: 705
Deduced a syphon composed of 705 places in 2 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 2 with 1410 rules applied. Total rules applied 2276 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2278 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2279 place count 1001 transition count 962
Applied a total of 2279 rules in 270 ms. Remains 1001 /2143 variables (removed 1142) and now considering 962/2103 (removed 1141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 270 ms. Remains : 1001/2143 places, 962/2103 transitions.
[2024-06-01 08:08:35] [INFO ] Flatten gal took : 25 ms
[2024-06-01 08:08:35] [INFO ] Flatten gal took : 26 ms
[2024-06-01 08:08:35] [INFO ] Input system was already deterministic with 962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2143/2143 places, 2103/2103 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2122 transition count 2082
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2122 transition count 2082
Applied a total of 42 rules in 168 ms. Remains 2122 /2143 variables (removed 21) and now considering 2082/2103 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 2122/2143 places, 2082/2103 transitions.
[2024-06-01 08:08:35] [INFO ] Flatten gal took : 62 ms
[2024-06-01 08:08:35] [INFO ] Flatten gal took : 45 ms
[2024-06-01 08:08:35] [INFO ] Input system was already deterministic with 2082 transitions.
[2024-06-01 08:08:35] [INFO ] Flatten gal took : 45 ms
[2024-06-01 08:08:35] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:08:35] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 08:08:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2143 places, 2103 transitions and 6606 arcs took 13 ms.
Total runtime 186459 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-040B-CTLFireability-2023-15

BK_STOP 1717229316215

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/928/ctl_0_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/928/ctl_1_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/928/ctl_2_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/928/ctl_3_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/928/ctl_4_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/928/ctl_5_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/928/ctl_6_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/928/ctl_7_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/928/ctl_8_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/928/ctl_9_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/928/ctl_10_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/928/ctl_11_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/928/ctl_12_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/928/ctl_13_
ctl formula name ShieldIIPs-PT-040B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/928/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-040B, examination is CTLFireability"
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-171683760400138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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