About the Execution of LTSMin+red for RingSingleMessageInMbox-PT-d1m020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8226.867 | 156943.00 | 221055.00 | 344.50 | ???FT?????T????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.r524-tall-171679079500074.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 RingSingleMessageInMbox-PT-d1m020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079500074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 23:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 23:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717218249187
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:04:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:04:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:04:10] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2024-06-01 05:04:10] [INFO ] Transformed 6690 places.
[2024-06-01 05:04:11] [INFO ] Transformed 11934 transitions.
[2024-06-01 05:04:11] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 647 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 4305 places in 36 ms
Reduce places removed 4305 places and 0 transitions.
Support contains 69 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1060 places :
Symmetric choice reduction at 1 with 1060 rule applications. Total rules 1179 place count 1308 transition count 10359
Iterating global reduction 1 with 1060 rules applied. Total rules applied 2239 place count 1308 transition count 10359
Ensure Unique test removed 423 transitions
Reduce isomorphic transitions removed 423 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 2662 place count 1308 transition count 9936
Discarding 852 places :
Symmetric choice reduction at 2 with 852 rule applications. Total rules 3514 place count 456 transition count 9084
Iterating global reduction 2 with 852 rules applied. Total rules applied 4366 place count 456 transition count 9084
Ensure Unique test removed 6909 transitions
Reduce isomorphic transitions removed 6909 transitions.
Iterating post reduction 2 with 6909 rules applied. Total rules applied 11275 place count 456 transition count 2175
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 11288 place count 443 transition count 2162
Iterating global reduction 3 with 13 rules applied. Total rules applied 11301 place count 443 transition count 2162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11302 place count 443 transition count 2161
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 11308 place count 437 transition count 2155
Iterating global reduction 4 with 6 rules applied. Total rules applied 11314 place count 437 transition count 2155
Applied a total of 11314 rules in 474 ms. Remains 437 /2385 variables (removed 1948) and now considering 2155/11934 (removed 9779) transitions.
// Phase 1: matrix 2155 rows 437 cols
[2024-06-01 05:04:11] [INFO ] Computed 3 invariants in 38 ms
[2024-06-01 05:04:12] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-06-01 05:04:12] [INFO ] Invariant cache hit.
[2024-06-01 05:04:12] [INFO ] State equation strengthened by 1761 read => feed constraints.
[2024-06-01 05:04:16] [INFO ] Implicit Places using invariants and state equation in 4512 ms returned []
Implicit Place search using SMT with State Equation took 5088 ms to find 0 implicit places.
Running 2154 sub problems to find dead transitions.
[2024-06-01 05:04:16] [INFO ] Invariant cache hit.
[2024-06-01 05:04:16] [INFO ] State equation strengthened by 1761 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/2592 variables, and 3 constraints, problems are : Problem set: 0 solved, 2154 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/437 constraints, ReadFeed: 0/1761 constraints, PredecessorRefiner: 2154/2154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/2592 variables, and 3 constraints, problems are : Problem set: 0 solved, 2154 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/437 constraints, ReadFeed: 0/1761 constraints, PredecessorRefiner: 0/2154 constraints, Known Traps: 0/0 constraints]
After SMT, in 72881ms problems are : Problem set: 0 solved, 2154 unsolved
Search for dead transitions found 0 dead transitions in 72952ms
Starting structural reductions in LTL mode, iteration 1 : 437/2385 places, 2155/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78553 ms. Remains : 437/2385 places, 2155/11934 transitions.
Support contains 69 out of 437 places after structural reductions.
[2024-06-01 05:05:30] [INFO ] Flatten gal took : 141 ms
[2024-06-01 05:05:30] [INFO ] Flatten gal took : 96 ms
[2024-06-01 05:05:30] [INFO ] Input system was already deterministic with 2155 transitions.
Reduction of identical properties reduced properties to check from 72 to 69
RANDOM walk for 40000 steps (6385 resets) in 3007 ms. (13 steps per ms) remains 11/69 properties
BEST_FIRST walk for 40004 steps (726 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (622 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (639 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (478 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (744 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (650 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (640 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (605 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (584 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (680 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (783 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
[2024-06-01 05:05:31] [INFO ] Invariant cache hit.
[2024-06-01 05:05:32] [INFO ] State equation strengthened by 1761 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 123/148 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 45/193 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1151/1344 variables, 193/196 constraints. Problems are: Problem set: 3 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1344 variables, 757/953 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1344 variables, 0/953 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 8 (OVERLAPS) 1248/2592 variables, 244/1197 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2592 variables, 1004/2201 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2592 variables, 0/2201 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2592 variables, 0/2201 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2592/2592 variables, and 2201 constraints, problems are : Problem set: 9 solved, 2 unsolved in 1627 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 437/437 constraints, ReadFeed: 1761/1761 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/123 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/131 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/176 variables, 1/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 425/601 variables, 176/179 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 31/210 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/210 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1987/2588 variables, 257/467 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2588 variables, 1730/2197 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2588 variables, 2/2199 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2588 variables, 0/2199 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/2592 variables, 4/2203 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2592 variables, 0/2203 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2592 variables, 0/2203 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2592/2592 variables, and 2203 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 437/437 constraints, ReadFeed: 1761/1761 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 4078ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 0 properties in 740 ms.
Support contains 4 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Graph (complete) has 2943 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 436 transition count 2146
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 73 place count 373 transition count 618
Iterating global reduction 1 with 63 rules applied. Total rules applied 136 place count 373 transition count 618
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 152 place count 373 transition count 602
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 228 place count 297 transition count 526
Iterating global reduction 2 with 76 rules applied. Total rules applied 304 place count 297 transition count 526
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 351 place count 297 transition count 479
Discarding 116 places :
Symmetric choice reduction at 3 with 116 rule applications. Total rules 467 place count 181 transition count 363
Iterating global reduction 3 with 116 rules applied. Total rules applied 583 place count 181 transition count 363
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 96 rules applied. Total rules applied 679 place count 181 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 682 place count 178 transition count 228
Iterating global reduction 4 with 3 rules applied. Total rules applied 685 place count 178 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 687 place count 176 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 689 place count 176 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 690 place count 176 transition count 225
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 694 place count 172 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 698 place count 172 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 702 place count 172 transition count 217
Applied a total of 702 rules in 153 ms. Remains 172 /437 variables (removed 265) and now considering 217/2155 (removed 1938) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 172/437 places, 217/2155 transitions.
RANDOM walk for 40000 steps (8494 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2928 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1465 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 713727 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 2
Probabilistic random walk after 713727 steps, saw 320896 distinct states, run finished after 3011 ms. (steps per millisecond=237 ) properties seen :0
// Phase 1: matrix 217 rows 172 cols
[2024-06-01 05:05:40] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 05:05:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 200/335 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 36/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/385 variables, 33/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 17/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/389 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/389 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 211 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:05:40] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 200/335 variables, 135/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 36/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 50/385 variables, 33/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 17/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/389 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/389 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 669ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 117 ms.
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 171 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 171 transition count 216
Applied a total of 2 rules in 16 ms. Remains 171 /172 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 171/172 places, 216/217 transitions.
RANDOM walk for 40000 steps (8437 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2924 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2065739 steps, run timeout after 3001 ms. (steps per millisecond=688 ) properties seen :0 out of 1
Probabilistic random walk after 2065739 steps, saw 904867 distinct states, run finished after 3006 ms. (steps per millisecond=687 ) properties seen :0
// Phase 1: matrix 216 rows 171 cols
[2024-06-01 05:05:43] [INFO ] Computed 4 invariants in 8 ms
[2024-06-01 05:05:43] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 131/133 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 198/331 variables, 133/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 35/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 52/383 variables, 34/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 17/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/387 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 131/133 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 198/331 variables, 133/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 35/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/383 variables, 34/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 17/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/387 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:05:44] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/387 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 171/171 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 05:05:44] [INFO ] Invariant cache hit.
[2024-06-01 05:05:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 05:05:44] [INFO ] Invariant cache hit.
[2024-06-01 05:05:44] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 05:05:44] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-06-01 05:05:44] [INFO ] Redundant transitions in 9 ms returned []
Running 215 sub problems to find dead transitions.
[2024-06-01 05:05:44] [INFO ] Invariant cache hit.
[2024-06-01 05:05:44] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-01 05:05:46] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-06-01 05:05:47] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
[2024-06-01 05:05:47] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
[2024-06-01 05:05:47] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 203 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 4 (OVERLAPS) 216/387 variables, 171/179 constraints. Problems are: Problem set: 36 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 52/231 constraints. Problems are: Problem set: 36 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/231 constraints. Problems are: Problem set: 36 solved, 179 unsolved
[2024-06-01 05:05:52] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/387 variables, 1/232 constraints. Problems are: Problem set: 36 solved, 179 unsolved
[2024-06-01 05:05:52] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/233 constraints. Problems are: Problem set: 46 solved, 169 unsolved
[2024-06-01 05:05:54] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/234 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/234 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/387 variables, 0/234 constraints. Problems are: Problem set: 46 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 234 constraints, problems are : Problem set: 46 solved, 169 unsolved in 13589 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 46 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 43/171 variables, 4/4 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 7/11 constraints. Problems are: Problem set: 46 solved, 169 unsolved
[2024-06-01 05:05:59] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:05:59] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
[2024-06-01 05:05:59] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:05:59] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 4/15 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/15 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 216/387 variables, 171/186 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 52/238 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 169/407 constraints. Problems are: Problem set: 46 solved, 169 unsolved
[2024-06-01 05:06:04] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/408 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/408 constraints. Problems are: Problem set: 46 solved, 169 unsolved
[2024-06-01 05:06:11] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:06:12] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:06:14] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:06:14] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/387 variables, 4/412 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/412 constraints. Problems are: Problem set: 46 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/412 constraints. Problems are: Problem set: 46 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 412 constraints, problems are : Problem set: 46 solved, 169 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 171/171 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 169/215 constraints, Known Traps: 16/16 constraints]
After SMT, in 43973ms problems are : Problem set: 46 solved, 169 unsolved
Search for dead transitions found 46 dead transitions in 43975ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 171/171 places, 170/216 transitions.
Graph (complete) has 437 edges and 171 vertex of which 129 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 127 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 125 transition count 150
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 125 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 123 transition count 148
Applied a total of 29 rules in 18 ms. Remains 123 /171 variables (removed 48) and now considering 148/170 (removed 22) transitions.
// Phase 1: matrix 148 rows 123 cols
[2024-06-01 05:06:28] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:06:28] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:06:28] [INFO ] Invariant cache hit.
[2024-06-01 05:06:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 05:06:29] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 123/171 places, 148/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 44951 ms. Remains : 123/171 places, 148/216 transitions.
RANDOM walk for 40000 steps (8362 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3028 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2625597 steps, run timeout after 3001 ms. (steps per millisecond=874 ) properties seen :0 out of 1
Probabilistic random walk after 2625597 steps, saw 1130490 distinct states, run finished after 3001 ms. (steps per millisecond=874 ) properties seen :0
[2024-06-01 05:06:32] [INFO ] Invariant cache hit.
[2024-06-01 05:06:32] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 163/221 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 41/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/223 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/271 variables, 41/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 163/221 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 41/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/223 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/271 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/271 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 05:06:32] [INFO ] Invariant cache hit.
[2024-06-01 05:06:32] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 05:06:32] [INFO ] Invariant cache hit.
[2024-06-01 05:06:32] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 05:06:32] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-06-01 05:06:32] [INFO ] Redundant transitions in 4 ms returned []
Running 147 sub problems to find dead transitions.
[2024-06-01 05:06:32] [INFO ] Invariant cache hit.
[2024-06-01 05:06:32] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/271 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 48/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 172 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 148/271 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 48/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 147/319 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 319 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 10980ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 10982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11282 ms. Remains : 123/123 places, 148/148 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 123 transition count 142
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 119 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 117 transition count 140
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 14 place count 117 transition count 115
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 64 place count 92 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 88 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 87 transition count 117
Applied a total of 74 rules in 20 ms. Remains 87 /123 variables (removed 36) and now considering 117/148 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 87 cols
[2024-06-01 05:06:43] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 05:06:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:06:43] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 05:06:44] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 05:06:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:06:44] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 05:06:44] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 05:06:44] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 05:06:44] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 187 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:06:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 66 ms
[2024-06-01 05:06:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 82 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 2155 transitions.
Support contains 55 out of 437 places (down from 57) after GAL structural reductions.
Computed a total of 140 stabilizing places and 1030 stable transitions
Graph (complete) has 3034 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 1039
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 1039
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 149 place count 382 transition count 1000
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 216 place count 315 transition count 933
Iterating global reduction 1 with 67 rules applied. Total rules applied 283 place count 315 transition count 933
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 417 place count 315 transition count 799
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 501 place count 231 transition count 715
Iterating global reduction 2 with 84 rules applied. Total rules applied 585 place count 231 transition count 715
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 761 place count 231 transition count 539
Applied a total of 761 rules in 89 ms. Remains 231 /437 variables (removed 206) and now considering 539/2155 (removed 1616) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 89 ms. Remains : 231/437 places, 539/2155 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 539 transitions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 381 transition count 988
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 381 transition count 988
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 152 place count 381 transition count 948
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 220 place count 313 transition count 880
Iterating global reduction 1 with 68 rules applied. Total rules applied 288 place count 313 transition count 880
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 411 place count 313 transition count 757
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 499 place count 225 transition count 669
Iterating global reduction 2 with 88 rules applied. Total rules applied 587 place count 225 transition count 669
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 2 with 208 rules applied. Total rules applied 795 place count 225 transition count 461
Applied a total of 795 rules in 23 ms. Remains 225 /437 variables (removed 212) and now considering 461/2155 (removed 1694) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 225/437 places, 461/2155 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 461 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 376 transition count 730
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 376 transition count 730
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 142 place count 376 transition count 710
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 216 place count 302 transition count 636
Iterating global reduction 1 with 74 rules applied. Total rules applied 290 place count 302 transition count 636
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 359 place count 302 transition count 567
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 467 place count 194 transition count 459
Iterating global reduction 2 with 108 rules applied. Total rules applied 575 place count 194 transition count 459
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 703 place count 194 transition count 331
Applied a total of 703 rules in 48 ms. Remains 194 /437 variables (removed 243) and now considering 331/2155 (removed 1824) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 194/437 places, 331/2155 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 1040
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 1040
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 149 place count 382 transition count 1001
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 217 place count 314 transition count 933
Iterating global reduction 1 with 68 rules applied. Total rules applied 285 place count 314 transition count 933
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 420 place count 314 transition count 798
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 504 place count 230 transition count 714
Iterating global reduction 2 with 84 rules applied. Total rules applied 588 place count 230 transition count 714
Ensure Unique test removed 244 transitions
Reduce isomorphic transitions removed 244 transitions.
Iterating post reduction 2 with 244 rules applied. Total rules applied 832 place count 230 transition count 470
Applied a total of 832 rules in 22 ms. Remains 230 /437 variables (removed 207) and now considering 470/2155 (removed 1685) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 230/437 places, 470/2155 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 470 transitions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 375 transition count 729
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 375 transition count 729
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 146 place count 375 transition count 707
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 220 place count 301 transition count 633
Iterating global reduction 1 with 74 rules applied. Total rules applied 294 place count 301 transition count 633
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 363 place count 301 transition count 564
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 471 place count 193 transition count 456
Iterating global reduction 2 with 108 rules applied. Total rules applied 579 place count 193 transition count 456
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 711 place count 193 transition count 324
Applied a total of 711 rules in 20 ms. Remains 193 /437 variables (removed 244) and now considering 324/2155 (removed 1831) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 193/437 places, 324/2155 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:06:44] [INFO ] Input system was already deterministic with 324 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 376 transition count 781
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 376 transition count 781
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 149 place count 376 transition count 754
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 221 place count 304 transition count 682
Iterating global reduction 1 with 72 rules applied. Total rules applied 293 place count 304 transition count 682
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 372 place count 304 transition count 603
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 476 place count 200 transition count 499
Iterating global reduction 2 with 104 rules applied. Total rules applied 580 place count 200 transition count 499
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 720 place count 200 transition count 359
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 721 place count 199 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 722 place count 199 transition count 346
Applied a total of 722 rules in 43 ms. Remains 199 /437 variables (removed 238) and now considering 346/2155 (removed 1809) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 199/437 places, 346/2155 transitions.
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:06:44] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 346 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 385 transition count 1091
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 385 transition count 1091
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 145 place count 385 transition count 1050
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 210 place count 320 transition count 985
Iterating global reduction 1 with 65 rules applied. Total rules applied 275 place count 320 transition count 985
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 419 place count 320 transition count 841
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 499 place count 240 transition count 761
Iterating global reduction 2 with 80 rules applied. Total rules applied 579 place count 240 transition count 761
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 2 with 228 rules applied. Total rules applied 807 place count 240 transition count 533
Applied a total of 807 rules in 54 ms. Remains 240 /437 variables (removed 197) and now considering 533/2155 (removed 1622) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 240/437 places, 533/2155 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 533 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 374 transition count 729
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 374 transition count 729
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 150 place count 374 transition count 705
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 224 place count 300 transition count 631
Iterating global reduction 1 with 74 rules applied. Total rules applied 298 place count 300 transition count 631
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 367 place count 300 transition count 562
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 475 place count 192 transition count 454
Iterating global reduction 2 with 108 rules applied. Total rules applied 583 place count 192 transition count 454
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 719 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 720 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 721 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 722 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 723 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 727 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 731 place count 186 transition count 300
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 751 place count 186 transition count 280
Applied a total of 751 rules in 46 ms. Remains 186 /437 variables (removed 251) and now considering 280/2155 (removed 1875) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 186/437 places, 280/2155 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 838
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 838
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 138 place count 382 transition count 810
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 177 place count 343 transition count 771
Iterating global reduction 1 with 39 rules applied. Total rules applied 216 place count 343 transition count 771
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 238 place count 343 transition count 749
Discarding 125 places :
Symmetric choice reduction at 2 with 125 rule applications. Total rules 363 place count 218 transition count 624
Iterating global reduction 2 with 125 rules applied. Total rules applied 488 place count 218 transition count 624
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 688 place count 218 transition count 424
Applied a total of 688 rules in 23 ms. Remains 218 /437 variables (removed 219) and now considering 424/2155 (removed 1731) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 218/437 places, 424/2155 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 382 transition count 1088
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 382 transition count 1088
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 156 place count 382 transition count 1042
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 222 place count 316 transition count 976
Iterating global reduction 1 with 66 rules applied. Total rules applied 288 place count 316 transition count 976
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 434 place count 316 transition count 830
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 514 place count 236 transition count 750
Iterating global reduction 2 with 80 rules applied. Total rules applied 594 place count 236 transition count 750
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 2 with 168 rules applied. Total rules applied 762 place count 236 transition count 582
Applied a total of 762 rules in 23 ms. Remains 236 /437 variables (removed 201) and now considering 582/2155 (removed 1573) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 236/437 places, 582/2155 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 377 transition count 830
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 377 transition count 830
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 148 place count 377 transition count 802
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 219 place count 306 transition count 731
Iterating global reduction 1 with 71 rules applied. Total rules applied 290 place count 306 transition count 731
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 380 place count 306 transition count 641
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 480 place count 206 transition count 541
Iterating global reduction 2 with 100 rules applied. Total rules applied 580 place count 206 transition count 541
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 724 place count 206 transition count 397
Applied a total of 724 rules in 41 ms. Remains 206 /437 variables (removed 231) and now considering 397/2155 (removed 1758) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 206/437 places, 397/2155 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 2155/2155 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 377 transition count 831
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 377 transition count 831
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 147 place count 377 transition count 804
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 219 place count 305 transition count 732
Iterating global reduction 1 with 72 rules applied. Total rules applied 291 place count 305 transition count 732
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 382 place count 305 transition count 641
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 482 place count 205 transition count 541
Iterating global reduction 2 with 100 rules applied. Total rules applied 582 place count 205 transition count 541
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 730 place count 205 transition count 393
Applied a total of 730 rules in 20 ms. Remains 205 /437 variables (removed 232) and now considering 393/2155 (removed 1762) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 205/437 places, 393/2155 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:06:45] [INFO ] Input system was already deterministic with 393 transitions.
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 60 ms
[2024-06-01 05:06:45] [INFO ] Flatten gal took : 61 ms
[2024-06-01 05:06:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 05:06:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 437 places, 2155 transitions and 8578 arcs took 9 ms.
Total runtime 155403 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-00
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-01
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-02
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-05
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-06
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-07
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-08
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-09
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-11
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-12
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-13
Could not compute solution for formula : RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-14
BK_STOP 1717218406130
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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 RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/662/ctl_0_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/662/ctl_1_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/662/ctl_2_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/662/ctl_3_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/662/ctl_4_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/662/ctl_5_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/662/ctl_6_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/662/ctl_7_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/662/ctl_8_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/662/ctl_9_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/662/ctl_10_
ctl formula name RingSingleMessageInMbox-PT-d1m020-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/662/ctl_11_
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="RingSingleMessageInMbox-PT-d1m020"
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 RingSingleMessageInMbox-PT-d1m020, 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 r524-tall-171679079500074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m020.tgz
mv RingSingleMessageInMbox-PT-d1m020 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 '
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 ;