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-171654351900583.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-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351900583
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 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 548K 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-2B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717240612187

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:16:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:16:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:16:53] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-06-01 11:16:53] [INFO ] Transformed 2003 places.
[2024-06-01 11:16:53] [INFO ] Transformed 2292 transitions.
[2024-06-01 11:16:53] [INFO ] Found NUPN structural information;
[2024-06-01 11:16:53] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (64 resets) in 1833 ms. (21 steps per ms) remains 7/16 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 378 ms. (105 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 995 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
// Phase 1: matrix 2292 rows 2003 cols
[2024-06-01 11:16:55] [INFO ] Computed 66 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem NoC3x3-PT-2B-ReachabilityFireability-2024-10 is UNSAT
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1697/1859 variables, 58/220 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1859 variables, 1697/1917 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1859 variables, 0/1917 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 144/2003 variables, 8/1925 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 144/2069 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2069 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2292/4295 variables, 2003/4072 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4295/4295 variables, and 4072 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2669 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 140/140 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1719/1859 variables, 58/198 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1859 variables, 1719/1917 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 11:16:59] [INFO ] Deduced a trap composed of 34 places in 757 ms of which 86 ms to minimize.
[2024-06-01 11:16:59] [INFO ] Deduced a trap composed of 15 places in 580 ms of which 10 ms to minimize.
[2024-06-01 11:17:00] [INFO ] Deduced a trap composed of 57 places in 652 ms of which 11 ms to minimize.
[2024-06-01 11:17:01] [INFO ] Deduced a trap composed of 16 places in 601 ms of which 9 ms to minimize.
[2024-06-01 11:17:01] [INFO ] Deduced a trap composed of 23 places in 623 ms of which 10 ms to minimize.
[2024-06-01 11:17:02] [INFO ] Deduced a trap composed of 61 places in 551 ms of which 12 ms to minimize.
[2024-06-01 11:17:02] [INFO ] Deduced a trap composed of 41 places in 537 ms of which 9 ms to minimize.
SMT process timed out in 7953ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 140 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1377 edges and 2003 vertex of which 40 / 2003 are part of one of the 5 SCC in 7 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 345 rules applied. Total rules applied 346 place count 1960 transition count 1915
Reduce places removed 337 places and 0 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 1 with 383 rules applied. Total rules applied 729 place count 1623 transition count 1869
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 775 place count 1577 transition count 1869
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 775 place count 1577 transition count 1846
Deduced a syphon composed of 23 places in 7 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 821 place count 1554 transition count 1846
Discarding 317 places :
Symmetric choice reduction at 3 with 317 rule applications. Total rules 1138 place count 1237 transition count 1529
Iterating global reduction 3 with 317 rules applied. Total rules applied 1455 place count 1237 transition count 1529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 1455 place count 1237 transition count 1504
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1505 place count 1212 transition count 1504
Discarding 110 places :
Symmetric choice reduction at 3 with 110 rule applications. Total rules 1615 place count 1102 transition count 1376
Iterating global reduction 3 with 110 rules applied. Total rules applied 1725 place count 1102 transition count 1376
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 1825 place count 1002 transition count 1266
Iterating global reduction 3 with 100 rules applied. Total rules applied 1925 place count 1002 transition count 1266
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1956 place count 971 transition count 1211
Iterating global reduction 3 with 31 rules applied. Total rules applied 1987 place count 971 transition count 1211
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 11 rules applied. Total rules applied 1998 place count 969 transition count 1202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2000 place count 967 transition count 1202
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 2022 place count 945 transition count 1180
Iterating global reduction 5 with 22 rules applied. Total rules applied 2044 place count 945 transition count 1180
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 2048 place count 943 transition count 1178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2050 place count 941 transition count 1178
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2061 place count 930 transition count 1156
Iterating global reduction 7 with 11 rules applied. Total rules applied 2072 place count 930 transition count 1156
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 2081 place count 921 transition count 1147
Iterating global reduction 7 with 9 rules applied. Total rules applied 2090 place count 921 transition count 1147
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 13 rules applied. Total rules applied 2103 place count 919 transition count 1136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2105 place count 917 transition count 1136
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 260
Deduced a syphon composed of 260 places in 1 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 9 with 520 rules applied. Total rules applied 2625 place count 657 transition count 876
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 2637 place count 645 transition count 862
Iterating global reduction 9 with 12 rules applied. Total rules applied 2649 place count 645 transition count 862
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2654 place count 640 transition count 852
Iterating global reduction 9 with 5 rules applied. Total rules applied 2659 place count 640 transition count 852
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2661 place count 638 transition count 846
Iterating global reduction 9 with 2 rules applied. Total rules applied 2663 place count 638 transition count 846
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2667 place count 636 transition count 844
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 2713 place count 613 transition count 892
Free-agglomeration rule applied 34 times.
Iterating global reduction 9 with 34 rules applied. Total rules applied 2747 place count 613 transition count 858
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 37 rules applied. Total rules applied 2784 place count 579 transition count 855
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2791 place count 579 transition count 848
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2792 place count 579 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2793 place count 578 transition count 847
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2795 place count 578 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2797 place count 576 transition count 845
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 12 with 16 rules applied. Total rules applied 2813 place count 576 transition count 845
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2814 place count 576 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2815 place count 575 transition count 844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2816 place count 574 transition count 844
Applied a total of 2816 rules in 928 ms. Remains 574 /2003 variables (removed 1429) and now considering 844/2292 (removed 1448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 938 ms. Remains : 574/2003 places, 844/2292 transitions.
RANDOM walk for 40000 steps (246 resets) in 475 ms. (84 steps per ms) remains 3/6 properties
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
[2024-06-01 11:17:04] [INFO ] Flow matrix only has 831 transitions (discarded 13 similar events)
// Phase 1: matrix 831 rows 574 cols
[2024-06-01 11:17:04] [INFO ] Computed 53 invariants in 9 ms
[2024-06-01 11:17:04] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 349/431 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/509 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 816/1325 variables, 509/561 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 60/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1325 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 76/1401 variables, 61/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1401 variables, 3/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1401 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/1404 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1404 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1404 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/1405 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1405 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1405 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1405/1405 variables, and 690 constraints, problems are : Problem set: 0 solved, 3 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 574/574 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 349/431 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 78/509 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:17:05] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:17:06] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:17:06] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:17:06] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:17:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:17:06] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:17:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:17:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 816/1325 variables, 509/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 60/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 76/1401 variables, 61/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1401 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1401 variables, 3/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:17:07] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1401 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1401 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/1404 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1404 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1404 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/1405 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1405 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1405 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1405/1405 variables, and 714 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3225 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, State Equation: 574/574 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 21/21 constraints]
After SMT, in 4002ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 448 ms.
Support contains 34 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 844/844 transitions.
Graph (trivial) has 170 edges and 574 vertex of which 8 / 574 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 569 transition count 818
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 551 transition count 816
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 549 transition count 816
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 42 place count 549 transition count 803
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 68 place count 536 transition count 803
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 92 place count 512 transition count 759
Iterating global reduction 3 with 24 rules applied. Total rules applied 116 place count 512 transition count 759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 119 place count 512 transition count 756
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 119 place count 512 transition count 754
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 510 transition count 754
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 507 transition count 739
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 507 transition count 739
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 229 place count 457 transition count 689
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 250 place count 436 transition count 664
Iterating global reduction 4 with 21 rules applied. Total rules applied 271 place count 436 transition count 664
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 275 place count 436 transition count 660
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 281 place count 430 transition count 648
Iterating global reduction 5 with 6 rules applied. Total rules applied 287 place count 430 transition count 648
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 291 place count 430 transition count 644
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 429 transition count 642
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 429 transition count 642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 294 place count 429 transition count 641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 296 place count 428 transition count 640
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 308 place count 422 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 309 place count 422 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 310 place count 422 transition count 653
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 328 place count 422 transition count 635
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 352 place count 404 transition count 629
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 356 place count 404 transition count 625
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 357 place count 404 transition count 625
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 359 place count 403 transition count 624
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 364 place count 403 transition count 624
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 365 place count 402 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 366 place count 401 transition count 623
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 372 place count 398 transition count 620
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 377 place count 398 transition count 615
Applied a total of 377 rules in 159 ms. Remains 398 /574 variables (removed 176) and now considering 615/844 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 398/574 places, 615/844 transitions.
RANDOM walk for 40000 steps (463 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (30 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 510365 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 510365 steps, saw 112746 distinct states, run finished after 3005 ms. (steps per millisecond=169 ) properties seen :0
[2024-06-01 11:17:11] [INFO ] Flow matrix only has 605 transitions (discarded 10 similar events)
// Phase 1: matrix 605 rows 398 cols
[2024-06-01 11:17:11] [INFO ] Computed 51 invariants in 4 ms
[2024-06-01 11:17:11] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/201 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/326 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 568/894 variables, 326/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/894 variables, 50/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/894 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 95/989 variables, 58/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/989 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/989 variables, 10/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/989 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/994 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/994 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/994 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/1003 variables, 9/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1003 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1003 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1003 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 398/398 constraints, ReadFeed: 60/60 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/201 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/326 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 6 ms to minimize.
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:17:12] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 568/894 variables, 326/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/894 variables, 50/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/894 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 95/989 variables, 58/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/989 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/989 variables, 10/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/989 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/994 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/994 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/994 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/1003 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1003 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1003 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1003 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 398/398 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 34 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 615/615 transitions.
Applied a total of 0 rules in 14 ms. Remains 398 /398 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 398/398 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 615/615 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2024-06-01 11:17:13] [INFO ] Flow matrix only has 605 transitions (discarded 10 similar events)
[2024-06-01 11:17:13] [INFO ] Invariant cache hit.
[2024-06-01 11:17:13] [INFO ] Implicit Places using invariants in 223 ms returned [10, 43, 83, 115, 271, 309]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 232 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 392/398 places, 615/615 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 381 transition count 604
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 381 transition count 594
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 381 transition count 593
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 381 transition count 593
Applied a total of 34 rules in 30 ms. Remains 381 /392 variables (removed 11) and now considering 593/615 (removed 22) transitions.
[2024-06-01 11:17:13] [INFO ] Flow matrix only has 584 transitions (discarded 9 similar events)
// Phase 1: matrix 584 rows 381 cols
[2024-06-01 11:17:13] [INFO ] Computed 45 invariants in 6 ms
[2024-06-01 11:17:13] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 11:17:13] [INFO ] Flow matrix only has 584 transitions (discarded 9 similar events)
[2024-06-01 11:17:13] [INFO ] Invariant cache hit.
[2024-06-01 11:17:13] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 11:17:14] [INFO ] Implicit Places using invariants and state equation in 460 ms returned [5, 9, 30, 31, 34, 35, 39, 40, 73, 76, 77, 95, 96, 103, 104, 107, 137, 138, 139, 140, 144, 145, 149, 150, 151, 157, 161, 248, 249, 252, 253, 254, 257, 258, 259, 290, 294, 311, 312, 313, 317, 318, 322, 323, 360, 361, 364, 365]
Discarding 48 places :
Implicit Place search using SMT with State Equation took 651 ms to find 48 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 333/398 places, 593/615 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 333 transition count 587
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 327 transition count 586
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 326 transition count 586
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 92 place count 287 transition count 547
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 285 transition count 543
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 285 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 285 transition count 542
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 107 place count 280 transition count 542
Free-agglomeration rule (complex) applied 47 times.
Iterating global reduction 4 with 47 rules applied. Total rules applied 154 place count 280 transition count 502
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 211 place count 232 transition count 493
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 212 place count 231 transition count 490
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 231 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 231 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 216 place count 231 transition count 487
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 221 place count 231 transition count 487
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 231 transition count 487
Applied a total of 222 rules in 51 ms. Remains 231 /333 variables (removed 102) and now considering 487/593 (removed 106) transitions.
[2024-06-01 11:17:14] [INFO ] Flow matrix only has 476 transitions (discarded 11 similar events)
// Phase 1: matrix 476 rows 231 cols
[2024-06-01 11:17:14] [INFO ] Computed 33 invariants in 4 ms
[2024-06-01 11:17:14] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 11:17:14] [INFO ] Flow matrix only has 476 transitions (discarded 11 similar events)
[2024-06-01 11:17:14] [INFO ] Invariant cache hit.
[2024-06-01 11:17:14] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-06-01 11:17:14] [INFO ] Implicit Places using invariants and state equation in 365 ms returned [42, 84]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 490 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/398 places, 483/615 transitions.
Applied a total of 0 rules in 8 ms. Remains 229 /229 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1473 ms. Remains : 229/398 places, 483/615 transitions.
RANDOM walk for 40000 steps (9 resets) in 756 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1187968 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 1
Probabilistic random walk after 1187968 steps, saw 160549 distinct states, run finished after 3002 ms. (steps per millisecond=395 ) properties seen :0
[2024-06-01 11:17:18] [INFO ] Flow matrix only has 472 transitions (discarded 11 similar events)
// Phase 1: matrix 472 rows 229 cols
[2024-06-01 11:17:18] [INFO ] Computed 31 invariants in 6 ms
[2024-06-01 11:17:18] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/117 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/156 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 384/540 variables, 156/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 158/698 variables, 70/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 74/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/701 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/701 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/701 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/701 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 346 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/117 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/156 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 384/540 variables, 156/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 158/698 variables, 70/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 74/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:17:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/698 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/701 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/701 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/701 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/701 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 701/701 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 676ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 34 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 483/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 229/229 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 483/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-06-01 11:17:18] [INFO ] Flow matrix only has 472 transitions (discarded 11 similar events)
[2024-06-01 11:17:18] [INFO ] Invariant cache hit.
[2024-06-01 11:17:18] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 11:17:18] [INFO ] Flow matrix only has 472 transitions (discarded 11 similar events)
[2024-06-01 11:17:18] [INFO ] Invariant cache hit.
[2024-06-01 11:17:19] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 11:17:19] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-06-01 11:17:19] [INFO ] Redundant transitions in 89 ms returned [198]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 474 sub problems to find dead transitions.
[2024-06-01 11:17:19] [INFO ] Flow matrix only has 471 transitions (discarded 11 similar events)
// Phase 1: matrix 471 rows 229 cols
[2024-06-01 11:17:19] [INFO ] Computed 31 invariants in 2 ms
[2024-06-01 11:17:19] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
At refinement iteration 4 (OVERLAPS) 471/700 variables, 229/260 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 86/346 constraints. Problems are: Problem set: 6 solved, 468 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/346 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 7 (OVERLAPS) 0/700 variables, 0/346 constraints. Problems are: Problem set: 6 solved, 468 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 346 constraints, problems are : Problem set: 6 solved, 468 unsolved in 17258 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 25/31 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/31 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 471/700 variables, 229/260 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 86/346 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 468/814 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/700 variables, 0/814 constraints. Problems are: Problem set: 6 solved, 468 unsolved
At refinement iteration 8 (OVERLAPS) 0/700 variables, 0/814 constraints. Problems are: Problem set: 6 solved, 468 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 814 constraints, problems are : Problem set: 6 solved, 468 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 468/474 constraints, Known Traps: 0/0 constraints]
After SMT, in 47523ms problems are : Problem set: 6 solved, 468 unsolved
Search for dead transitions found 6 dead transitions in 47530ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 476/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 229 /229 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2024-06-01 11:18:06] [INFO ] Redundant transitions in 39 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48137 ms. Remains : 229/229 places, 476/483 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1217826 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :0 out of 1
Probabilistic random walk after 1217826 steps, saw 165084 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
[2024-06-01 11:18:09] [INFO ] Flow matrix only has 465 transitions (discarded 11 similar events)
// Phase 1: matrix 465 rows 229 cols
[2024-06-01 11:18:10] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 11:18:10] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/117 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/156 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 377/533 variables, 156/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 158/691 variables, 70/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 74/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/691 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/694 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/694 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/694 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 346 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/117 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/156 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 377/533 variables, 156/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 158/691 variables, 70/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 74/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/691 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/691 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/694 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/694 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/694 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:18:10] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/694 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/694 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/694 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 694/694 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 34 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 476/476 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 229/229 places, 476/476 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 476/476 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 476/476 (removed 0) transitions.
[2024-06-01 11:18:10] [INFO ] Flow matrix only has 465 transitions (discarded 11 similar events)
[2024-06-01 11:18:10] [INFO ] Invariant cache hit.
[2024-06-01 11:18:10] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 11:18:10] [INFO ] Flow matrix only has 465 transitions (discarded 11 similar events)
[2024-06-01 11:18:10] [INFO ] Invariant cache hit.
[2024-06-01 11:18:11] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 11:18:11] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-06-01 11:18:11] [INFO ] Redundant transitions in 49 ms returned []
Running 468 sub problems to find dead transitions.
[2024-06-01 11:18:11] [INFO ] Flow matrix only has 465 transitions (discarded 11 similar events)
[2024-06-01 11:18:11] [INFO ] Invariant cache hit.
[2024-06-01 11:18:11] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 465/694 variables, 229/260 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 86/346 constraints. Problems are: Problem set: 0 solved, 468 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 7 (OVERLAPS) 0/694 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 468 unsolved
No progress, stopping.
After SMT solving in domain Real declared 694/694 variables, and 346 constraints, problems are : Problem set: 0 solved, 468 unsolved in 17610 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 465/694 variables, 229/260 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 86/346 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 468/814 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/694 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 8 (OVERLAPS) 0/694 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 468 unsolved
No progress, stopping.
After SMT solving in domain Int declared 694/694 variables, and 814 constraints, problems are : Problem set: 0 solved, 468 unsolved in 28433 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 229/229 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 0/0 constraints]
After SMT, in 46266ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 46270ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46776 ms. Remains : 229/229 places, 476/476 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 65 edges and 229 vertex of which 32 / 229 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 693 edges and 213 vertex of which 203 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 203 transition count 404
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 200 transition count 401
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 200 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 200 transition count 388
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 50 place count 200 transition count 388
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 200 transition count 387
Applied a total of 51 rules in 22 ms. Remains 200 /229 variables (removed 29) and now considering 387/476 (removed 89) transitions.
Running SMT prover for 1 properties.
[2024-06-01 11:18:57] [INFO ] Flow matrix only has 384 transitions (discarded 3 similar events)
// Phase 1: matrix 384 rows 200 cols
[2024-06-01 11:18:57] [INFO ] Computed 29 invariants in 1 ms
[2024-06-01 11:18:57] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 11:18:57] [INFO ] [Nat]Absence check using 29 positive place invariants in 5 ms returned sat
[2024-06-01 11:18:57] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 11:18:57] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-01 11:18:57] [INFO ] After 44ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 11:18:58] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 11:18:58] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 504 ms.
[2024-06-01 11:18:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 11:18:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 476 transitions and 1918 arcs took 8 ms.
[2024-06-01 11:18:58] [INFO ] Flatten gal took : 73 ms
Total runtime 125202 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : NoC3x3-PT-2B-ReachabilityFireability-2024-02

BK_STOP 1717240738798

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name NoC3x3-PT-2B-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/724/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-2B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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