About the Execution of GreatSPN+red for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7522.756 | 406550.00 | 791330.00 | 1120.20 | FTF?FFFTTTTFFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898200279.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 greatspnxred
Input is FireWire-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200279
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 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 FireWire-PT-14-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-14-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717370894166
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:28:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:28:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:28:15] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 23:28:15] [INFO ] Transformed 205 places.
[2024-06-02 23:28:15] [INFO ] Transformed 610 transitions.
[2024-06-02 23:28:15] [INFO ] Found NUPN structural information;
[2024-06-02 23:28:15] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
RANDOM walk for 40000 steps (1150 resets) in 1950 ms. (20 steps per ms) remains 11/16 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 499 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (247 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 901 ms. (44 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (244 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (140 resets) in 108 ms. (367 steps per ms) remains 9/11 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-14-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (265 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (201 resets) in 92 ms. (430 steps per ms) remains 8/9 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (376 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
[2024-06-02 23:28:17] [INFO ] Flow matrix only has 501 transitions (discarded 38 similar events)
// Phase 1: matrix 501 rows 205 cols
[2024-06-02 23:28:17] [INFO ] Computed 10 invariants in 28 ms
[2024-06-02 23:28:17] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FireWire-PT-14-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-14-ReachabilityFireability-2024-04 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-14-ReachabilityFireability-2024-12 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-14-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 85/199 variables, 9/123 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 85/208 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/208 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/202 variables, 1/209 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 3/212 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 500/702 variables, 202/414 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 72/486 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/486 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/705 variables, 3/489 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/705 variables, 3/492 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/705 variables, 0/492 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/706 variables, 1/493 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/706 variables, 0/493 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/706 variables, 0/493 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 493 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1041 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem FireWire-PT-14-ReachabilityFireability-2024-08 is UNSAT
FORMULA FireWire-PT-14-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 141/199 variables, 9/67 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 141/208 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-02 23:28:18] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 17 ms to minimize.
[2024-06-02 23:28:19] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 2/210 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/210 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/202 variables, 1/211 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/214 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-02 23:28:19] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:28:19] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/216 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/216 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 500/702 variables, 202/418 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 72/490 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 2/492 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/702 variables, 0/492 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/705 variables, 3/495 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/705 variables, 3/498 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 1/499 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/499 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/706 variables, 1/500 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/706 variables, 0/500 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/706 variables, 0/500 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 706/706 variables, and 500 constraints, problems are : Problem set: 5 solved, 3 unsolved in 1982 ms.
Refiners :[Domain max(s): 205/205 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 205/205 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 3467ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 1207 ms.
Support contains 54 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 539/539 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 205 transition count 533
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 202 transition count 533
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 197 transition count 523
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 197 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 197 transition count 521
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 195 transition count 515
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 195 transition count 515
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 194 transition count 513
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 194 transition count 513
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 193 transition count 510
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 193 transition count 510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 192 transition count 508
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 192 transition count 508
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 191 transition count 505
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 191 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 190 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 190 transition count 503
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 189 transition count 500
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 189 transition count 500
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 188 transition count 498
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 188 transition count 498
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 187 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 186 transition count 493
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 186 transition count 493
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 185 transition count 491
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 185 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 2 with 6 rules applied. Total rules applied 51 place count 182 transition count 488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 181 transition count 490
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 181 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 181 transition count 481
Applied a total of 62 rules in 148 ms. Remains 181 /205 variables (removed 24) and now considering 481/539 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 181/205 places, 481/539 transitions.
RANDOM walk for 40000 steps (1254 resets) in 358 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (289 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (298 resets) in 121 ms. (327 steps per ms) remains 2/3 properties
FORMULA FireWire-PT-14-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (44 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
[2024-06-02 23:28:22] [INFO ] Flow matrix only has 451 transitions (discarded 30 similar events)
// Phase 1: matrix 451 rows 181 cols
[2024-06-02 23:28:22] [INFO ] Computed 10 invariants in 9 ms
[2024-06-02 23:28:22] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/175 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/178 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 451/629 variables, 178/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 68/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/632 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/632 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 259 constraints, problems are : Problem set: 0 solved, 2 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 68/68 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/175 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/178 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:28:22] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:28:22] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 451/629 variables, 178/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 68/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/632 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/632 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:28:23] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/632 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/632 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/632 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 632/632 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1550ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 586 ms.
Support contains 52 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 481/481 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 180 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 180 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 180 transition count 478
Applied a total of 3 rules in 26 ms. Remains 180 /181 variables (removed 1) and now considering 478/481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 180/181 places, 478/481 transitions.
RANDOM walk for 40000 steps (1232 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (298 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 702082 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 2
Probabilistic random walk after 702082 steps, saw 195924 distinct states, run finished after 3020 ms. (steps per millisecond=232 ) properties seen :0
[2024-06-02 23:28:27] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
// Phase 1: matrix 448 rows 180 cols
[2024-06-02 23:28:27] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:28:27] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/177 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 448/625 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 68/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/628 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 258 constraints, problems are : Problem set: 0 solved, 2 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:28:27] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:28:28] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:28:28] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/177 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 448/625 variables, 177/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 68/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/628 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:28:28] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/628 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/628 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1366ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 52 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 478/478 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 180/180 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 478/478 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-06-02 23:28:29] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 23:28:29] [INFO ] Invariant cache hit.
[2024-06-02 23:28:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 23:28:29] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 23:28:29] [INFO ] Invariant cache hit.
[2024-06-02 23:28:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:28:29] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [19, 68, 126]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 433 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/180 places, 478/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 177 /177 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 450 ms. Remains : 177/180 places, 478/478 transitions.
RANDOM walk for 40000 steps (1293 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (278 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (25 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 774832 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 2
Probabilistic random walk after 774832 steps, saw 213102 distinct states, run finished after 3002 ms. (steps per millisecond=258 ) properties seen :0
[2024-06-02 23:28:32] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
// Phase 1: matrix 448 rows 177 cols
[2024-06-02 23:28:32] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:28:32] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 116/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/171 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 445/616 variables, 171/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 68/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/625 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/625 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 116/168 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/171 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 445/616 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 68/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/625 variables, 6/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/625 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/625 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/625 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 257 constraints, problems are : Problem set: 0 solved, 2 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1278ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 276 ms.
Support contains 52 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 478/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 177 /177 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 177/177 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 478/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 177 /177 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-06-02 23:28:34] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 23:28:34] [INFO ] Invariant cache hit.
[2024-06-02 23:28:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:28:34] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 23:28:34] [INFO ] Invariant cache hit.
[2024-06-02 23:28:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:28:34] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-02 23:28:34] [INFO ] Redundant transitions in 33 ms returned []
Running 477 sub problems to find dead transitions.
[2024-06-02 23:28:34] [INFO ] Flow matrix only has 448 transitions (discarded 30 similar events)
[2024-06-02 23:28:34] [INFO ] Invariant cache hit.
[2024-06-02 23:28:34] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 23:28:38] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:28:38] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:28:38] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-02 23:28:38] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:28:38] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:28:40] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:28:40] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 448/625 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 68/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 7 (OVERLAPS) 0/625 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 259 constraints, problems are : Problem set: 0 solved, 477 unsolved in 22075 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 448/625 variables, 177/191 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 68/259 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 477/736 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 23:29:06] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:29:10] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 4/740 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-06-02 23:29:19] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:29:23] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/625 variables, and 742 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 13/13 constraints]
After SMT, in 52569ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 52575ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53000 ms. Remains : 177/177 places, 478/478 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 55 edges and 177 vertex of which 5 / 177 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 26 place count 174 transition count 415
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 0 with 2 rules applied. Total rules applied 28 place count 173 transition count 414
Applied a total of 28 rules in 24 ms. Remains 173 /177 variables (removed 4) and now considering 414/478 (removed 64) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 414 rows 173 cols
[2024-06-02 23:29:27] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:29:27] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:29:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:29:27] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-06-02 23:29:28] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:29:28] [INFO ] After 1010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1143 ms.
[2024-06-02 23:29:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-02 23:29:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 478 transitions and 1798 arcs took 5 ms.
[2024-06-02 23:29:28] [INFO ] Flatten gal took : 64 ms
Total runtime 73308 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-14
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 177
TRANSITIONS: 478
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 694
MODEL NAME: /home/mcc/execution/413/model
177 places, 478 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-14-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA FireWire-PT-14-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717371300716
--------------------
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
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="FireWire-PT-14"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-14, 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 r549-tall-171734898200279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 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 '
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 ;