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.r544-smll-171701110500006.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 UtahNoC-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701110500006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.3K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 205K 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 UtahNoC-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717257445118

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:57:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:57:27] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-01 15:57:27] [INFO ] Transformed 216 places.
[2024-06-01 15:57:27] [INFO ] Transformed 977 transitions.
[2024-06-01 15:57:27] [INFO ] Found NUPN structural information;
[2024-06-01 15:57:27] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2514 ms. (15 steps per ms) remains 4/12 properties
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 3/4 properties
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 532 ms. (75 steps per ms) remains 3/3 properties
[2024-06-01 15:57:28] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2024-06-01 15:57:28] [INFO ] Computed 8 invariants in 19 ms
[2024-06-01 15:57:28] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 148/216 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 148/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 426/642 variables, 216/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 42/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/643 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/643 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 483 constraints, problems are : Problem set: 0 solved, 3 unsolved in 936 ms.
Refiners :[Domain max(s): 216/216 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 216/216 constraints, ReadFeed: 43/43 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/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem UtahNoC-PT-none-ReachabilityCardinality-2024-04 is UNSAT
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 148/216 variables, 8/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 148/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 15:57:30] [INFO ] Deduced a trap composed of 117 places in 243 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/225 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 426/642 variables, 216/441 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 42/483 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 2/485 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 0/485 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/643 variables, 1/486 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/643 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 486 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1280 ms.
Refiners :[Domain max(s): 216/216 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 216/216 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2388ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 374 ms.
Support contains 60 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 829/829 transitions.
Graph (trivial) has 224 edges and 216 vertex of which 46 / 216 are part of one of the 13 SCC in 8 ms
Free SCC test removed 33 places
Drop transitions (Empty/Sink Transition effects.) removed 178 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 196 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 183 transition count 631
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 181 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 181 transition count 630
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 180 transition count 630
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 33 place count 154 transition count 529
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 154 transition count 529
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 81 place count 154 transition count 507
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 150 transition count 494
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 150 transition count 494
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 92 place count 150 transition count 491
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 4 with 6 rules applied. Total rules applied 98 place count 147 transition count 488
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 102 place count 147 transition count 484
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 146 transition count 482
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 146 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 146 transition count 481
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 109 place count 144 transition count 489
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 121 place count 144 transition count 477
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 125 place count 144 transition count 473
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 129 place count 140 transition count 473
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 132 place count 140 transition count 473
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 140 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 134 place count 140 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 135 place count 139 transition count 471
Applied a total of 135 rules in 269 ms. Remains 139 /216 variables (removed 77) and now considering 471/829 (removed 358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 139/216 places, 471/829 transitions.
RANDOM walk for 40000 steps (8 resets) in 802 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 328427 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 2
Probabilistic random walk after 328427 steps, saw 205578 distinct states, run finished after 3008 ms. (steps per millisecond=109 ) properties seen :0
[2024-06-01 15:57:35] [INFO ] Flow matrix only has 278 transitions (discarded 193 similar events)
// Phase 1: matrix 278 rows 139 cols
[2024-06-01 15:57:35] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 15:57:35] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 278/417 variables, 139/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 45/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/417 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 139/139 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/139 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 278/417 variables, 139/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 45/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/417 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 194 constraints, problems are : Problem set: 0 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 139/139 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 911ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 246 ms.
Support contains 59 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 471/471 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 139 transition count 474
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 138 transition count 473
Applied a total of 3 rules in 40 ms. Remains 138 /139 variables (removed 1) and now considering 473/471 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 138/139 places, 473/471 transitions.
RANDOM walk for 40000 steps (8 resets) in 324 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 407715 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 2
Probabilistic random walk after 407715 steps, saw 253038 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-01 15:57:39] [INFO ] Flow matrix only has 280 transitions (discarded 193 similar events)
// Phase 1: matrix 280 rows 138 cols
[2024-06-01 15:57:39] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 15:57:39] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/138 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 280/418 variables, 138/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 47/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/418 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/138 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 280/418 variables, 138/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 47/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 658ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 222 ms.
Support contains 59 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 473/473 transitions.
Applied a total of 0 rules in 20 ms. Remains 138 /138 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 138/138 places, 473/473 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 473/473 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 473/473 (removed 0) transitions.
[2024-06-01 15:57:40] [INFO ] Flow matrix only has 280 transitions (discarded 193 similar events)
[2024-06-01 15:57:40] [INFO ] Invariant cache hit.
[2024-06-01 15:57:40] [INFO ] Implicit Places using invariants in 87 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 137/138 places, 473/473 transitions.
Graph (trivial) has 53 edges and 137 vertex of which 9 / 137 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 129 transition count 452
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 129 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 129 transition count 448
Applied a total of 11 rules in 20 ms. Remains 129 /137 variables (removed 8) and now considering 448/473 (removed 25) transitions.
[2024-06-01 15:57:40] [INFO ] Flow matrix only has 264 transitions (discarded 184 similar events)
// Phase 1: matrix 264 rows 129 cols
[2024-06-01 15:57:40] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 15:57:40] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 15:57:40] [INFO ] Flow matrix only has 264 transitions (discarded 184 similar events)
[2024-06-01 15:57:40] [INFO ] Invariant cache hit.
[2024-06-01 15:57:40] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 15:57:41] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 129/138 places, 448/473 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 351 ms. Remains : 129/138 places, 448/473 transitions.
RANDOM walk for 40000 steps (8 resets) in 213 ms. (186 steps per ms) remains 1/2 properties
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2024-06-01 15:57:41] [INFO ] Flow matrix only has 264 transitions (discarded 184 similar events)
[2024-06-01 15:57:41] [INFO ] Invariant cache hit.
[2024-06-01 15:57:41] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/393 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 28/28 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/393 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 28/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 44 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 448/448 transitions.
Graph (trivial) has 63 edges and 129 vertex of which 15 / 129 are part of one of the 4 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 41 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 118 transition count 406
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 117 transition count 406
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 6 rules applied. Total rules applied 9 place count 117 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 116 transition count 400
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 112 transition count 388
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 112 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 112 transition count 386
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 3 with 2 rules applied. Total rules applied 22 place count 111 transition count 385
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 111 transition count 383
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 26 place count 110 transition count 382
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 28 place count 110 transition count 380
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 32 place count 110 transition count 380
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 33 place count 110 transition count 379
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 34 place count 109 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 35 place count 108 transition count 378
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 39 place count 108 transition count 374
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 50 place count 104 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 51 place count 103 transition count 366
Applied a total of 51 rules in 70 ms. Remains 103 /129 variables (removed 26) and now considering 366/448 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 103/129 places, 366/448 transitions.
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1497470 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :0 out of 1
Probabilistic random walk after 1497470 steps, saw 786049 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
[2024-06-01 15:57:44] [INFO ] Flow matrix only has 216 transitions (discarded 150 similar events)
// Phase 1: matrix 216 rows 103 cols
[2024-06-01 15:57:44] [INFO ] Computed 6 invariants in 11 ms
[2024-06-01 15:57:44] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/319 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 23/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/319 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 23/23 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/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/319 variables, 103/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 23/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 44 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 366/366 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 103/103 places, 366/366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 366/366 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-06-01 15:57:45] [INFO ] Flow matrix only has 216 transitions (discarded 150 similar events)
[2024-06-01 15:57:45] [INFO ] Invariant cache hit.
[2024-06-01 15:57:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 15:57:45] [INFO ] Flow matrix only has 216 transitions (discarded 150 similar events)
[2024-06-01 15:57:45] [INFO ] Invariant cache hit.
[2024-06-01 15:57:45] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 15:57:45] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-01 15:57:45] [INFO ] Redundant transitions in 31 ms returned []
Running 351 sub problems to find dead transitions.
[2024-06-01 15:57:45] [INFO ] Flow matrix only has 216 transitions (discarded 150 similar events)
[2024-06-01 15:57:45] [INFO ] Invariant cache hit.
[2024-06-01 15:57:45] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-01 15:57:47] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 216/319 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 23/133 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 133 constraints, problems are : Problem set: 0 solved, 351 unsolved in 12989 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 216/319 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 23/133 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 351/484 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 484 constraints, problems are : Problem set: 0 solved, 351 unsolved in 13617 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 1/1 constraints]
After SMT, in 26837ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 26848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27113 ms. Remains : 103/103 places, 366/366 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 119 edges and 103 vertex of which 21 / 103 are part of one of the 7 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Empty/Sink Transition effects.) removed 94 transitions
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 182
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 87 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 85 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 85 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 83 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 80 transition count 175
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 80 transition count 175
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 31 place count 74 transition count 169
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 35 place count 74 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 73 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 52 place count 73 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 53 place count 73 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 54 place count 72 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 56 place count 72 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 58 place count 70 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 59 place count 70 transition count 146
Applied a total of 59 rules in 36 ms. Remains 70 /103 variables (removed 33) and now considering 146/366 (removed 220) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 70 cols
[2024-06-01 15:58:12] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 15:58:12] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 15:58:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 15:58:12] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 15:58:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 15:58:12] [INFO ] After 45ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 15:58:12] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 15:58:12] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 379 ms.
[2024-06-01 15:58:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-01 15:58:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 366 transitions and 1234 arcs took 9 ms.
[2024-06-01 15:58:13] [INFO ] Flatten gal took : 88 ms
Total runtime 46253 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 : UtahNoC-PT-none-ReachabilityCardinality-2024-12

BK_STOP 1717257493564

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name UtahNoC-PT-none-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/584/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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r544-smll-171701110500006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;