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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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-17-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-17-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717371855028

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:44:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:44:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:44:16] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 23:44:16] [INFO ] Transformed 428 places.
[2024-06-02 23:44:16] [INFO ] Transformed 656 transitions.
[2024-06-02 23:44:16] [INFO ] Found NUPN structural information;
[2024-06-02 23:44:16] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (17 resets) in 2104 ms. (19 steps per ms) remains 14/16 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (10 resets) in 519 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (20 resets) in 321 ms. (124 steps per ms) remains 13/14 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (11 resets) in 304 ms. (131 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (16 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (15 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (11 resets) in 624 ms. (64 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (12 resets) in 278 ms. (143 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (14 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (9 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (13 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
// Phase 1: matrix 656 rows 428 cols
[2024-06-02 23:44:18] [INFO ] Computed 9 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 297/428 variables, 9/140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 297/437 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 656/1084 variables, 428/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 865 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1558 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem FireWire-PT-17-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-17-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 297/428 variables, 9/140 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 297/437 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 23:44:20] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 18 ms to minimize.
[2024-06-02 23:44:20] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:44:20] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 4 ms to minimize.
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 4/441 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 108 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 119 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 3/444 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 656/1084 variables, 428/872 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1084 variables, 12/884 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 23:44:23] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:44:23] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1084 variables, 2/886 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1084 variables, 0/886 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 886 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5010 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 9/9 constraints]
After SMT, in 6798ms problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 193 edges and 428 vertex of which 6 / 428 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1097 edges and 423 vertex of which 417 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 417 transition count 589
Reduce places removed 59 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 358 transition count 576
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 148 place count 345 transition count 576
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 148 place count 345 transition count 564
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 172 place count 333 transition count 564
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 228 place count 277 transition count 508
Iterating global reduction 3 with 56 rules applied. Total rules applied 284 place count 277 transition count 508
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 284 place count 277 transition count 505
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 290 place count 274 transition count 505
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 293 place count 271 transition count 499
Iterating global reduction 3 with 3 rules applied. Total rules applied 296 place count 271 transition count 499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 298 place count 271 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 270 transition count 497
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 359 place count 240 transition count 467
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 381 place count 229 transition count 522
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 229 transition count 521
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 396 place count 229 transition count 507
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 410 place count 215 transition count 507
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 419 place count 215 transition count 507
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 420 place count 214 transition count 506
Applied a total of 420 rules in 202 ms. Remains 214 /428 variables (removed 214) and now considering 506/656 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 214/428 places, 506/656 transitions.
RANDOM walk for 40000 steps (15 resets) in 503 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 324 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (30 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (18 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (16 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (12 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (9 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (14 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (16 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (17 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (10 resets) in 224 ms. (177 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (14 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (11 resets) in 210 ms. (189 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 628066 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :7 out of 12
Probabilistic random walk after 628066 steps, saw 138448 distinct states, run finished after 3018 ms. (steps per millisecond=208 ) properties seen :7
FORMULA FireWire-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 506 rows 214 cols
[2024-06-02 23:44:29] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 23:44:29] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 501/704 variables, 203/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/714 variables, 7/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5/719 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/720 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/720 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/720 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 720/720 variables, and 224 constraints, problems are : Problem set: 0 solved, 5 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 214/214 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 501/704 variables, 203/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/714 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/714 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/719 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/719 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:44:30] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/720 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/720 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/720 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 720/720 variables, and 230 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 214/214 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1679ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 8374 ms.
Support contains 33 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 506/506 transitions.
Graph (trivial) has 93 edges and 214 vertex of which 4 / 214 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 212 transition count 491
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 201 transition count 491
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 23 place count 201 transition count 484
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 194 transition count 484
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 190 transition count 449
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 190 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 190 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 46 place count 190 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 189 transition count 447
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 188 transition count 446
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 188 transition count 446
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 72 place count 177 transition count 435
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 176 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 176 transition count 432
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 79 place count 176 transition count 427
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 101 place count 165 transition count 468
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 110 place count 165 transition count 459
Free-agglomeration rule applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 128 place count 165 transition count 441
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 150 place count 147 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 174 place count 147 transition count 413
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 145 transition count 411
Applied a total of 176 rules in 95 ms. Remains 145 /214 variables (removed 69) and now considering 411/506 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 145/214 places, 411/506 transitions.
RANDOM walk for 40000 steps (1345 resets) in 270 ms. (147 steps per ms) remains 3/5 properties
FORMULA FireWire-PT-17-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (307 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (126 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (301 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
[2024-06-02 23:44:39] [INFO ] Flow matrix only has 404 transitions (discarded 7 similar events)
// Phase 1: matrix 404 rows 145 cols
[2024-06-02 23:44:39] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:44:39] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/138 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 403/541 variables, 138/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 34/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/548 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/549 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/549 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 187 constraints, problems are : Problem set: 0 solved, 3 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/138 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 403/541 variables, 138/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 34/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/548 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/549 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 23:44:40] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/549 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 191 constraints, problems are : Problem set: 0 solved, 3 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 872 ms.
Support contains 29 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 411/411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 144 transition count 411
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 144 transition count 409
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 35 place count 142 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 142 transition count 379
Applied a total of 36 rules in 24 ms. Remains 142 /145 variables (removed 3) and now considering 379/411 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 142/145 places, 379/411 transitions.
RANDOM walk for 40000 steps (1348 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (326 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (122 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (312 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 724926 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :1 out of 3
Probabilistic random walk after 724926 steps, saw 205431 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :1
FORMULA FireWire-PT-17-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 23:44:45] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 142 cols
[2024-06-02 23:44:45] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:44:45] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 371/506 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 50/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/513 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/514 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/514 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 200 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 51/51 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 371/506 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 50/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/513 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/514 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 672 ms.
Support contains 28 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 379/379 transitions.
Applied a total of 0 rules in 11 ms. Remains 142 /142 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 142/142 places, 379/379 transitions.
RANDOM walk for 40000 steps (1350 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (317 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (300 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 728706 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 2
Probabilistic random walk after 728706 steps, saw 206605 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2024-06-02 23:44:49] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 23:44:49] [INFO ] Invariant cache hit.
[2024-06-02 23:44:49] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 371/506 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 50/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/513 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/514 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/514 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 200 constraints, problems are : Problem set: 0 solved, 2 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 51/51 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 371/506 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 50/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/513 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/514 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 605 ms.
Support contains 28 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 379/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 142/142 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 379/379 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2024-06-02 23:44:50] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 23:44:50] [INFO ] Invariant cache hit.
[2024-06-02 23:44:50] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 23:44:50] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 23:44:50] [INFO ] Invariant cache hit.
[2024-06-02 23:44:51] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-06-02 23:44:51] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 23:44:51] [INFO ] Redundant transitions in 26 ms returned []
Running 370 sub problems to find dead transitions.
[2024-06-02 23:44:51] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 23:44:51] [INFO ] Invariant cache hit.
[2024-06-02 23:44:51] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-02 23:44:52] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:44:52] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:44:52] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:44:53] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-02 23:44:54] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:44:55] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:44:55] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-02 23:44:56] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:44:56] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:44:57] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:44:57] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:44:57] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 2/140 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-02 23:45:00] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:45:00] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:45:01] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 8 (OVERLAPS) 372/512 variables, 140/167 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 51/218 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 11 (OVERLAPS) 2/514 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 220 constraints, problems are : Problem set: 0 solved, 370 unsolved in 24084 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 2/140 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 372/512 variables, 140/167 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 51/218 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 370/588 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 10 (OVERLAPS) 2/514 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 590 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 20/20 constraints]
After SMT, in 54350ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 54355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54741 ms. Remains : 142/142 places, 379/379 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 58 edges and 142 vertex of which 12 / 142 are part of one of the 2 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 539 edges and 132 vertex of which 130 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 130 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 129 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 129 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 22 place count 129 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 128 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 128 transition count 293
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 128 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 127 transition count 292
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 127 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 127 transition count 291
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 126 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 126 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 126 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 125 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 125 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 44 place count 125 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 125 transition count 282
Applied a total of 46 rules in 32 ms. Remains 125 /142 variables (removed 17) and now considering 282/379 (removed 97) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 282 rows 125 cols
[2024-06-02 23:45:45] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:45:45] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:45:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:45:45] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 23:45:45] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:45:45] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 466 ms.
[2024-06-02 23:45:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-02 23:45:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 142 places, 379 transitions and 1411 arcs took 5 ms.
[2024-06-02 23:45:46] [INFO ] Flatten gal took : 55 ms
Total runtime 90063 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-17

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 142
TRANSITIONS: 379
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/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: 695
MODEL NAME: /home/mcc/execution/412/model
142 places, 379 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-17-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-ReachabilityFireability-2024-00 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717372380198

--------------------
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
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-17"
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-17, 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-171734898300303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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