About the Execution of LTSMin+red for FireWire-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1013.876 | 185064.00 | 349454.00 | 378.10 | ?F?F?FTFFF????F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901400319.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 FireWire-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400319
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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-19-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-19-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717358003202
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:53:24] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-02 19:53:24] [INFO ] Transformed 602 places.
[2024-06-02 19:53:24] [INFO ] Transformed 944 transitions.
[2024-06-02 19:53:24] [INFO ] Found NUPN structural information;
[2024-06-02 19:53:24] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 1652 ms. (24 steps per ms) remains 14/16 properties
FORMULA FireWire-PT-19-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-19-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (13 resets) in 326 ms. (122 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 703 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (13 resets) in 217 ms. (183 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (17 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (14 resets) in 209 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (18 resets) in 183 ms. (217 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 159 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (13 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (24 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (31 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (20 resets) in 145 ms. (273 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (19 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (10 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (21 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
// Phase 1: matrix 944 rows 602 cols
[2024-06-02 19:53:26] [INFO ] Computed 13 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 204/204 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem FireWire-PT-19-ReachabilityFireability-2024-03 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-19-ReachabilityFireability-2024-07 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-19-ReachabilityFireability-2024-09 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 398/602 variables, 13/217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 398/615 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/615 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 944/1546 variables, 602/1217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1546 variables, 0/1217 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1546/1546 variables, and 1217 constraints, problems are : Problem set: 3 solved, 11 unsolved in 1683 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 464/602 variables, 13/151 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 464/615 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 37 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
Problem FireWire-PT-19-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-19-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 3 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 115 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 119 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 8/623 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 3 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 121 places in 186 ms of which 4 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 3/626 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 1/627 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/627 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 944/1546 variables, 602/1229 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1546 variables, 10/1239 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-06-02 19:53:32] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1546/1546 variables, and 1240 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5014 ms.
Refiners :[Domain max(s): 602/602 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 10/14 constraints, Known Traps: 13/13 constraints]
After SMT, in 6994ms problems are : Problem set: 4 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 120 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 274 edges and 602 vertex of which 5 / 602 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1600 edges and 598 vertex of which 589 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 589 transition count 857
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 106 rules applied. Total rules applied 190 place count 509 transition count 831
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 215 place count 484 transition count 831
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 215 place count 484 transition count 814
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 249 place count 467 transition count 814
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 327 place count 389 transition count 736
Iterating global reduction 3 with 78 rules applied. Total rules applied 405 place count 389 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 406 place count 389 transition count 735
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 406 place count 389 transition count 727
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 422 place count 381 transition count 727
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 430 place count 373 transition count 710
Iterating global reduction 4 with 8 rules applied. Total rules applied 438 place count 373 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 440 place count 373 transition count 708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 441 place count 372 transition count 708
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 509 place count 338 transition count 674
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 549 place count 318 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 552 place count 318 transition count 729
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 573 place count 318 transition count 708
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 594 place count 297 transition count 708
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 603 place count 297 transition count 708
Applied a total of 603 rules in 201 ms. Remains 297 /602 variables (removed 305) and now considering 708/944 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 297/602 places, 708/944 transitions.
RANDOM walk for 40000 steps (40 resets) in 396 ms. (100 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (16 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (28 resets) in 258 ms. (154 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (31 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (45 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (27 resets) in 121 ms. (327 steps per ms) remains 9/10 properties
FORMULA FireWire-PT-19-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (108 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (27 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (41 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (13 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (10 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
[2024-06-02 19:53:34] [INFO ] Flow matrix only has 703 transitions (discarded 5 similar events)
// Phase 1: matrix 703 rows 297 cols
[2024-06-02 19:53:34] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:53:34] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 177/281 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 698/979 variables, 281/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/979 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/996 variables, 13/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/996 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 3/999 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/999 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/1000 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1000 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/1000 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 317 constraints, problems are : Problem set: 0 solved, 9 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 297/297 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 177/281 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:53:35] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:53:35] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 698/979 variables, 281/293 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 17/996 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/996 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:53:36] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/996 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/996 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 3/999 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/999 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/999 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 1/1000 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1000 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:53:39] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1000 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1000 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/1000 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 332 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5109 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 297/297 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 6188ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 30319 ms.
Support contains 104 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 708/708 transitions.
Graph (trivial) has 23 edges and 297 vertex of which 2 / 297 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 296 transition count 702
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 292 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 291 transition count 701
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 291 transition count 699
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 15 place count 289 transition count 699
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 17 place count 287 transition count 697
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 287 transition count 697
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 3 with 6 rules applied. Total rules applied 25 place count 284 transition count 694
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 283 transition count 708
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 283 transition count 707
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 31 place count 282 transition count 705
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 282 transition count 705
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 282 transition count 705
Applied a total of 34 rules in 81 ms. Remains 282 /297 variables (removed 15) and now considering 705/708 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 282/297 places, 705/708 transitions.
RANDOM walk for 40000 steps (805 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (125 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (141 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (138 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (143 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (149 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (136 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (138 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (138 resets) in 34 ms. (1142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (123 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 371292 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :1 out of 9
Probabilistic random walk after 371292 steps, saw 104478 distinct states, run finished after 3010 ms. (steps per millisecond=123 ) properties seen :1
FORMULA FireWire-PT-19-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:54:14] [INFO ] Flow matrix only has 700 transitions (discarded 5 similar events)
// Phase 1: matrix 700 rows 282 cols
[2024-06-02 19:54:14] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:54:14] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 167/271 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 700/971 variables, 271/281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 10/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 11/982 variables, 11/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/982 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/982 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 302 constraints, problems are : Problem set: 0 solved, 8 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 167/271 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:54:14] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:54:15] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:54:15] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:54:15] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 700/971 variables, 271/285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 10/295 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 11/982 variables, 11/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/982 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 982/982 variables, and 314 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 3226ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 25492 ms.
Support contains 104 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 705/705 transitions.
Applied a total of 0 rules in 23 ms. Remains 282 /282 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 282/282 places, 705/705 transitions.
RANDOM walk for 40000 steps (802 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (128 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (139 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (141 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (140 resets) in 42 ms. (930 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (146 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (138 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (137 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 369014 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 8
Probabilistic random walk after 369014 steps, saw 103911 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-06-02 19:54:46] [INFO ] Flow matrix only has 700 transitions (discarded 5 similar events)
[2024-06-02 19:54:46] [INFO ] Invariant cache hit.
[2024-06-02 19:54:46] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 167/271 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 700/971 variables, 271/281 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 10/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 11/982 variables, 11/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/982 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/982 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 302 constraints, problems are : Problem set: 0 solved, 8 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 167/271 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:54:47] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:54:47] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 700/971 variables, 271/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/971 variables, 10/293 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:54:47] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:54:47] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 11/982 variables, 11/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/982 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 982/982 variables, and 314 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2626 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 3447ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 34002 ms.
Support contains 104 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 705/705 transitions.
Applied a total of 0 rules in 10 ms. Remains 282 /282 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 282/282 places, 705/705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 705/705 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2024-06-02 19:55:23] [INFO ] Flow matrix only has 700 transitions (discarded 5 similar events)
[2024-06-02 19:55:23] [INFO ] Invariant cache hit.
[2024-06-02 19:55:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 19:55:23] [INFO ] Flow matrix only has 700 transitions (discarded 5 similar events)
[2024-06-02 19:55:23] [INFO ] Invariant cache hit.
[2024-06-02 19:55:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 19:55:24] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-06-02 19:55:24] [INFO ] Redundant transitions in 36 ms returned []
Running 703 sub problems to find dead transitions.
[2024-06-02 19:55:24] [INFO ] Flow matrix only has 700 transitions (discarded 5 similar events)
[2024-06-02 19:55:24] [INFO ] Invariant cache hit.
[2024-06-02 19:55:24] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-02 19:55:30] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:55:30] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:55:32] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:55:32] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 2 ms to minimize.
[2024-06-02 19:55:33] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:55:33] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:55:35] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:55:36] [INFO ] Deduced a trap composed of 181 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:55:37] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 1 ms to minimize.
[2024-06-02 19:55:37] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-02 19:55:42] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:55:42] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (OVERLAPS) 700/982 variables, 282/311 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 982/982 variables, and 321 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (OVERLAPS) 700/982 variables, 282/311 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/982 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 703/1024 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-02 19:56:11] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:56:18] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:56:23] [INFO ] Deduced a trap composed of 165 places in 125 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 1027 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 282/282 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 22/22 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60996 ms. Remains : 282/282 places, 705/705 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1229 edges and 282 vertex of which 281 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 281 transition count 700
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 281 transition count 694
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 281 transition count 694
Applied a total of 14 rules in 24 ms. Remains 281 /282 variables (removed 1) and now considering 694/705 (removed 11) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 694 rows 281 cols
[2024-06-02 19:56:24] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:56:24] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 19:56:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 19:56:25] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-02 19:56:26] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-06-02 19:56:26] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
TRAPS : Iteration 1
[2024-06-02 19:56:27] [INFO ] After 2116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-02 19:56:27] [INFO ] After 2712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 3016 ms.
[2024-06-02 19:56:27] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-02 19:56:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 705 transitions and 2494 arcs took 7 ms.
[2024-06-02 19:56:27] [INFO ] Flatten gal took : 89 ms
Total runtime 183581 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-00
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-02
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-04
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-10
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-11
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-12
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-13
Could not compute solution for formula : FireWire-PT-19-ReachabilityFireability-2024-15
BK_STOP 1717358188266
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/716/inv_0_
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/716/inv_1_
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/716/inv_2_
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/716/inv_3_
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/716/inv_4_
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/716/inv_5_
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/716/inv_6_
rfs formula name FireWire-PT-19-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/716/inv_7_
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="FireWire-PT-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-19, 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 r553-tall-171734901400319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 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 ;