About the Execution of LTSMin+red for NoC3x3-PT-6B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 862.668 | 87893.00 | 130074.00 | 250.80 | TFFTTFFTFTTFFF?F | 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.r508-tall-171654352100646.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 NoC3x3-PT-6B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352100646
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 552K 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 NoC3x3-PT-6B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2023-13
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-6B-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717243648031
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:07:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:07:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:07:29] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-06-01 12:07:29] [INFO ] Transformed 1544 places.
[2024-06-01 12:07:29] [INFO ] Transformed 2229 transitions.
[2024-06-01 12:07:29] [INFO ] Found NUPN structural information;
[2024-06-01 12:07:29] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (87 resets) in 2176 ms. (18 steps per ms) remains 4/13 properties
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (13 resets) in 724 ms. (55 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 924 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (12 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
// Phase 1: matrix 2229 rows 1544 cols
[2024-06-01 12:07:31] [INFO ] Computed 66 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem NoC3x3-PT-6B-ReachabilityCardinality-2023-13 is UNSAT
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2023-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1288/1405 variables, 54/171 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1405 variables, 1288/1459 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1405 variables, 0/1459 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 139/1544 variables, 12/1471 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1544 variables, 139/1610 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 0/1610 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2229/3773 variables, 1544/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3773 variables, 0/3154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3773/3773 variables, and 3154 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1694 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1275/1365 variables, 50/140 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1365 variables, 1275/1415 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 12:07:33] [INFO ] Deduced a trap composed of 76 places in 367 ms of which 49 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 131 places in 388 ms of which 7 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 124 places in 287 ms of which 5 ms to minimize.
[2024-06-01 12:07:34] [INFO ] Deduced a trap composed of 130 places in 223 ms of which 4 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 4 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 172 places in 196 ms of which 4 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 5 ms to minimize.
[2024-06-01 12:07:35] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 3 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 133 places in 228 ms of which 4 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
[2024-06-01 12:07:36] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 11/1426 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1365 variables, 0/1426 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 179/1544 variables, 16/1442 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1544 variables, 179/1621 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 12:07:37] [INFO ] Deduced a trap composed of 95 places in 304 ms of which 5 ms to minimize.
[2024-06-01 12:07:37] [INFO ] Deduced a trap composed of 85 places in 298 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1544 variables, 2/1623 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1544 variables, 0/1623 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3773/3773 variables, and 3167 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5014 ms.
Refiners :[Domain max(s): 1544/1544 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1544/1544 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 6982ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 out of 1544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1544 transition count 2043
Reduce places removed 186 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 199 rules applied. Total rules applied 385 place count 1358 transition count 2030
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 398 place count 1345 transition count 2030
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 398 place count 1345 transition count 1972
Deduced a syphon composed of 58 places in 4 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 514 place count 1287 transition count 1972
Discarding 258 places :
Symmetric choice reduction at 3 with 258 rule applications. Total rules 772 place count 1029 transition count 1714
Iterating global reduction 3 with 258 rules applied. Total rules applied 1030 place count 1029 transition count 1714
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 1030 place count 1029 transition count 1690
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1078 place count 1005 transition count 1690
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 1167 place count 916 transition count 1433
Iterating global reduction 3 with 89 rules applied. Total rules applied 1256 place count 916 transition count 1433
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1292 place count 880 transition count 1357
Iterating global reduction 3 with 36 rules applied. Total rules applied 1328 place count 880 transition count 1357
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1340 place count 868 transition count 1333
Iterating global reduction 3 with 12 rules applied. Total rules applied 1352 place count 868 transition count 1333
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1358 place count 862 transition count 1321
Iterating global reduction 3 with 6 rules applied. Total rules applied 1364 place count 862 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1365 place count 861 transition count 1319
Iterating global reduction 3 with 1 rules applied. Total rules applied 1366 place count 861 transition count 1319
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 1666 place count 711 transition count 1169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1668 place count 709 transition count 1149
Iterating global reduction 3 with 2 rules applied. Total rules applied 1670 place count 709 transition count 1149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1872 place count 608 transition count 1199
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1922 place count 583 transition count 1211
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 1939 place count 583 transition count 1194
Free-agglomeration rule applied 28 times.
Iterating global reduction 3 with 28 rules applied. Total rules applied 1967 place count 583 transition count 1166
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 2003 place count 555 transition count 1158
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2006 place count 555 transition count 1155
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2008 place count 555 transition count 1155
Applied a total of 2008 rules in 794 ms. Remains 555 /1544 variables (removed 989) and now considering 1155/2229 (removed 1074) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 807 ms. Remains : 555/1544 places, 1155/2229 transitions.
RANDOM walk for 40000 steps (228 resets) in 1056 ms. (37 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 192 ms. (207 steps per ms) remains 1/2 properties
FORMULA NoC3x3-PT-6B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
[2024-06-01 12:07:39] [INFO ] Flow matrix only has 1150 transitions (discarded 5 similar events)
// Phase 1: matrix 1150 rows 555 cols
[2024-06-01 12:07:39] [INFO ] Computed 66 invariants in 8 ms
[2024-06-01 12:07:39] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/437 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 118/555 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1150/1705 variables, 555/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1705 variables, 56/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1705 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1705 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1705/1705 variables, and 677 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 555/555 constraints, ReadFeed: 56/56 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 377/437 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:07:40] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/555 variables, 23/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1150/1705 variables, 555/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1705 variables, 56/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1705 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1705 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1705 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 679 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2040 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 555/555 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2514ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 202 ms.
Support contains 60 out of 555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 555/555 places, 1155/1155 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 4 rules applied. Total rules applied 4 place count 555 transition count 1151
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 551 transition count 1151
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 551 transition count 1145
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 545 transition count 1145
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 28 place count 537 transition count 1123
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 537 transition count 1123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 537 transition count 1122
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 53 place count 529 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 56 place count 526 transition count 1108
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 526 transition count 1108
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 77 place count 517 transition count 1111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 514 transition count 1099
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 514 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 512 transition count 1091
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 512 transition count 1091
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 90 place count 512 transition count 1088
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 98 place count 512 transition count 1080
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 102 place count 508 transition count 1051
Iterating global reduction 4 with 4 rules applied. Total rules applied 106 place count 508 transition count 1051
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 508 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 507 transition count 1050
Applied a total of 108 rules in 121 ms. Remains 507 /555 variables (removed 48) and now considering 1050/1155 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 507/555 places, 1050/1155 transitions.
RANDOM walk for 40000 steps (228 resets) in 332 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (15 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 372351 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 372351 steps, saw 108710 distinct states, run finished after 3005 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 12:07:45] [INFO ] Flow matrix only has 1047 transitions (discarded 3 similar events)
// Phase 1: matrix 1047 rows 507 cols
[2024-06-01 12:07:45] [INFO ] Computed 66 invariants in 11 ms
[2024-06-01 12:07:45] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 340/400 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/507 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1047/1554 variables, 507/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1554 variables, 55/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1554 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1554 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 628 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 507/507 constraints, ReadFeed: 55/55 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 340/400 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 107/507 variables, 23/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:07:46] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1047/1554 variables, 507/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1554 variables, 55/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1554 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1554 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1554 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1554/1554 variables, and 631 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 507/507 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 60 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1050/1050 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 507/507 places, 1050/1050 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1050/1050 transitions.
Applied a total of 0 rules in 13 ms. Remains 507 /507 variables (removed 0) and now considering 1050/1050 (removed 0) transitions.
[2024-06-01 12:07:47] [INFO ] Flow matrix only has 1047 transitions (discarded 3 similar events)
[2024-06-01 12:07:47] [INFO ] Invariant cache hit.
[2024-06-01 12:07:47] [INFO ] Implicit Places using invariants in 266 ms returned [19, 57, 115, 157, 231, 338, 393, 434, 485]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 274 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/507 places, 1050/1050 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 476 transition count 1028
Applied a total of 44 rules in 19 ms. Remains 476 /498 variables (removed 22) and now considering 1028/1050 (removed 22) transitions.
[2024-06-01 12:07:47] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
// Phase 1: matrix 1025 rows 476 cols
[2024-06-01 12:07:47] [INFO ] Computed 57 invariants in 10 ms
[2024-06-01 12:07:47] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 12:07:47] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-06-01 12:07:47] [INFO ] Invariant cache hit.
[2024-06-01 12:07:47] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-01 12:07:48] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 476/507 places, 1028/1050 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1170 ms. Remains : 476/507 places, 1028/1050 transitions.
RANDOM walk for 40000 steps (226 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 255864 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 255864 steps, saw 114475 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 12:07:51] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-06-01 12:07:51] [INFO ] Invariant cache hit.
[2024-06-01 12:07:51] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/379 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/476 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1025/1501 variables, 476/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 59/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1501 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1501 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1501/1501 variables, and 592 constraints, problems are : Problem set: 0 solved, 1 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 59/59 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/379 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/476 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1025/1501 variables, 476/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 59/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1501 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1501 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1501 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1501/1501 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 60 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1028/1028 transitions.
Applied a total of 0 rules in 15 ms. Remains 476 /476 variables (removed 0) and now considering 1028/1028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 476/476 places, 1028/1028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1028/1028 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 1028/1028 (removed 0) transitions.
[2024-06-01 12:07:52] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-06-01 12:07:52] [INFO ] Invariant cache hit.
[2024-06-01 12:07:52] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 12:07:53] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-06-01 12:07:53] [INFO ] Invariant cache hit.
[2024-06-01 12:07:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-01 12:07:53] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2024-06-01 12:07:53] [INFO ] Redundant transitions in 61 ms returned []
Running 1024 sub problems to find dead transitions.
[2024-06-01 12:07:53] [INFO ] Flow matrix only has 1025 transitions (discarded 3 similar events)
[2024-06-01 12:07:53] [INFO ] Invariant cache hit.
[2024-06-01 12:07:53] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:08:08] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:08:11] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:08:12] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-06-01 12:08:13] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:08:14] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-06-01 12:08:15] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-06-01 12:08:17] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:08:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
[2024-06-01 12:08:22] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/1501 variables, and 75 constraints, problems are : Problem set: 0 solved, 1024 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/476 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1024/1024 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1024 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 4 (OVERLAPS) 1025/1501 variables, 476/551 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1501 variables, 59/610 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 1024/1634 constraints. Problems are: Problem set: 0 solved, 1024 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1501/1501 variables, and 1634 constraints, problems are : Problem set: 0 solved, 1024 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 476/476 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1024/1024 constraints, Known Traps: 18/18 constraints]
After SMT, in 60643ms problems are : Problem set: 0 solved, 1024 unsolved
Search for dead transitions found 0 dead transitions in 60656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61613 ms. Remains : 476/476 places, 1028/1028 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 1025
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 20 place count 476 transition count 1008
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 476 transition count 1008
Applied a total of 25 rules in 31 ms. Remains 476 /476 variables (removed 0) and now considering 1008/1028 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1008 rows 476 cols
[2024-06-01 12:08:54] [INFO ] Computed 57 invariants in 10 ms
[2024-06-01 12:08:54] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:08:54] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2024-06-01 12:08:54] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:08:55] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:08:55] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 879 ms.
[2024-06-01 12:08:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-06-01 12:08:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 476 places, 1028 transitions and 4084 arcs took 14 ms.
[2024-06-01 12:08:55] [INFO ] Flatten gal took : 124 ms
Total runtime 86332 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 : NoC3x3-PT-6B-ReachabilityCardinality-2024-14
BK_STOP 1717243735924
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name NoC3x3-PT-6B-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/677/inv_0_
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="NoC3x3-PT-6B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-6B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654352100646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;