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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 247K 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-20-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717358687175

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:04:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:04:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:04:48] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-02 20:04:48] [INFO ] Transformed 626 places.
[2024-06-02 20:04:48] [INFO ] Transformed 1031 transitions.
[2024-06-02 20:04:48] [INFO ] Found NUPN structural information;
[2024-06-02 20:04:48] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 215 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 (22 resets) in 1934 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 385905 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :6 out of 16
Probabilistic random walk after 385905 steps, saw 105271 distinct states, run finished after 3005 ms. (steps per millisecond=128 ) properties seen :6
FORMULA FireWire-PT-20-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1031 rows 626 cols
[2024-06-02 20:04:52] [INFO ] Computed 13 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FireWire-PT-20-ReachabilityFireability-2024-08 is UNSAT
FORMULA FireWire-PT-20-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-20-ReachabilityFireability-2024-14 is UNSAT
FORMULA FireWire-PT-20-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 476/592 variables, 11/127 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 476/603 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 0/603 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 34/626 variables, 2/605 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 34/639 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/639 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1031/1657 variables, 626/1265 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1657 variables, 0/1265 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1657 variables, 0/1265 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1657/1657 variables, and 1265 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1319 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 493/546 variables, 8/61 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 493/554 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-02 20:04:54] [INFO ] Deduced a trap composed of 114 places in 300 ms of which 26 ms to minimize.
[2024-06-02 20:04:54] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:04:55] [INFO ] Deduced a trap composed of 87 places in 285 ms of which 4 ms to minimize.
[2024-06-02 20:04:55] [INFO ] Deduced a trap composed of 308 places in 292 ms of which 14 ms to minimize.
[2024-06-02 20:04:56] [INFO ] Deduced a trap composed of 98 places in 528 ms of which 4 ms to minimize.
[2024-06-02 20:04:56] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:04:56] [INFO ] Deduced a trap composed of 141 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 7/561 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 0/561 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 80/626 variables, 5/566 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 80/646 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-02 20:04:57] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-06-02 20:04:57] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:04:57] [INFO ] Deduced a trap composed of 140 places in 132 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 3/649 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/649 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1031/1657 variables, 626/1275 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1657 variables, 8/1283 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-06-02 20:04:59] [INFO ] Deduced a trap composed of 113 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1657/1657 variables, and 1284 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5011 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 11/11 constraints]
After SMT, in 6577ms problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 382 edges and 626 vertex of which 3 / 626 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1881 edges and 624 vertex of which 609 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 609 transition count 927
Reduce places removed 98 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 105 rules applied. Total rules applied 208 place count 511 transition count 920
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 215 place count 504 transition count 920
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 215 place count 504 transition count 905
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 245 place count 489 transition count 905
Discarding 93 places :
Symmetric choice reduction at 3 with 93 rule applications. Total rules 338 place count 396 transition count 810
Iterating global reduction 3 with 93 rules applied. Total rules applied 431 place count 396 transition count 810
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 436 place count 396 transition count 805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 437 place count 395 transition count 805
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 437 place count 395 transition count 799
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 449 place count 389 transition count 799
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 474 place count 364 transition count 733
Iterating global reduction 5 with 25 rules applied. Total rules applied 499 place count 364 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 500 place count 364 transition count 732
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 507 place count 357 transition count 721
Iterating global reduction 6 with 7 rules applied. Total rules applied 514 place count 357 transition count 721
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 5 rules applied. Total rules applied 519 place count 357 transition count 716
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 522 place count 355 transition count 715
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 523 place count 354 transition count 715
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 9 with 92 rules applied. Total rules applied 615 place count 308 transition count 669
Performed 38 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 9 with 76 rules applied. Total rules applied 691 place count 270 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 692 place count 270 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 698 place count 270 transition count 840
Free-agglomeration rule applied 17 times.
Iterating global reduction 10 with 17 rules applied. Total rules applied 715 place count 270 transition count 823
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 732 place count 253 transition count 823
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 735 place count 250 transition count 820
Iterating global reduction 11 with 3 rules applied. Total rules applied 738 place count 250 transition count 820
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 748 place count 250 transition count 810
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 12 with 33 rules applied. Total rules applied 781 place count 250 transition count 777
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 784 place count 250 transition count 777
Applied a total of 784 rules in 289 ms. Remains 250 /626 variables (removed 376) and now considering 777/1031 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 250/626 places, 777/1031 transitions.
RANDOM walk for 40000 steps (43 resets) in 613 ms. (65 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (42 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (24 resets) in 273 ms. (145 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (91 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (69 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (95 resets) in 125 ms. (317 steps per ms) remains 7/8 properties
FORMULA FireWire-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (99 resets) in 250 ms. (159 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (60 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
[2024-06-02 20:05:00] [INFO ] Flow matrix only has 757 transitions (discarded 20 similar events)
// Phase 1: matrix 757 rows 250 cols
[2024-06-02 20:05:00] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 20:05:00] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 176/228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 10/238 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 757/995 variables, 238/248 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/995 variables, 11/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/995 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/1007 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1007 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1007 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 271 constraints, problems are : Problem set: 0 solved, 7 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 250/250 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 176/228 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/238 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 757/995 variables, 238/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 11/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/995 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 12/1007 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1007 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:05:02] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1007 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1007 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1007 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 284 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3077 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 250/250 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 3773ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 32989 ms.
Support contains 52 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 777/777 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 249 transition count 788
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 249 transition count 785
Applied a total of 5 rules in 34 ms. Remains 249 /250 variables (removed 1) and now considering 785/777 (removed -8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 249/250 places, 785/777 transitions.
RANDOM walk for 40000 steps (66 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (65 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (60 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (75 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (36 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (85 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (66 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (66 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 406025 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :2 out of 7
Probabilistic random walk after 406025 steps, saw 122025 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :2
FORMULA FireWire-PT-20-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 20:05:40] [INFO ] Flow matrix only has 765 transitions (discarded 20 similar events)
// Phase 1: matrix 765 rows 249 cols
[2024-06-02 20:05:40] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 20:05:40] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 198/208 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/236 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 765/1001 variables, 236/246 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 11/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 13/1014 variables, 13/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1014 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 270 constraints, problems are : Problem set: 0 solved, 5 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 11/11 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 198/208 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/236 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 765/1001 variables, 236/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1001 variables, 11/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 13/1014 variables, 13/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1014 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 279 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1527 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 249/249 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 1945ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 9192 ms.
Support contains 10 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 785/785 transitions.
Graph (trivial) has 56 edges and 249 vertex of which 4 / 249 are part of one of the 2 SCC in 0 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 247 transition count 780
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 246 transition count 780
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 3 place count 246 transition count 774
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 15 place count 240 transition count 774
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 234 transition count 761
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 234 transition count 761
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 234 transition count 759
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 232 transition count 759
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 230 transition count 756
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 230 transition count 756
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 229 transition count 753
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 229 transition count 753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 228 transition count 751
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 228 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 227 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 227 transition count 748
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 226 transition count 746
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 226 transition count 746
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 225 transition count 743
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 225 transition count 743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 224 transition count 741
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 224 transition count 741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 223 transition count 738
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 223 transition count 738
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 222 transition count 736
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 222 transition count 736
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 221 transition count 734
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 221 transition count 734
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 220 transition count 732
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 220 transition count 732
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 71 place count 212 transition count 724
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 212 transition count 723
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 208 transition count 719
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 208 transition count 719
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 85 place count 208 transition count 714
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 97 place count 202 transition count 741
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 202 transition count 739
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 153 place count 202 transition count 685
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 160 place count 202 transition count 678
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 5 with 53 rules applied. Total rules applied 213 place count 195 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 263 place count 195 transition count 582
Applied a total of 263 rules in 130 ms. Remains 195 /249 variables (removed 54) and now considering 582/785 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 195/249 places, 582/785 transitions.
RANDOM walk for 40000 steps (1338 resets) in 1099 ms. (36 steps per ms) remains 4/5 properties
FORMULA FireWire-PT-20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (277 resets) in 46 ms. (851 steps per ms) remains 3/4 properties
FORMULA FireWire-PT-20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (260 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (86 resets) in 46 ms. (851 steps per ms) remains 2/3 properties
FORMULA FireWire-PT-20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 20:05:52] [INFO ] Flow matrix only has 535 transitions (discarded 47 similar events)
// Phase 1: matrix 535 rows 195 cols
[2024-06-02 20:05:52] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:05:52] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/183 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 535/718 variables, 183/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 105/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/730 variables, 12/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/730 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/730 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 730/730 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 105/105 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 73/183 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:05:52] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:05:52] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 535/718 variables, 183/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 105/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/718 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/730 variables, 12/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/730 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/730 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 730/730 variables, and 314 constraints, problems are : Problem set: 0 solved, 2 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 664ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 582/582 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 195 transition count 581
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 194 transition count 581
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 193 transition count 575
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 193 transition count 575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 192 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 192 transition count 573
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 191 transition count 570
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 191 transition count 570
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 190 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 190 transition count 568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 189 transition count 565
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 189 transition count 565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 188 transition count 563
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 188 transition count 563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 187 transition count 560
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 187 transition count 560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 186 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 186 transition count 558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 185 transition count 555
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 185 transition count 555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 184 transition count 553
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 184 transition count 553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 183 transition count 551
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 183 transition count 551
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 182 transition count 549
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 182 transition count 549
Applied a total of 26 rules in 43 ms. Remains 182 /195 variables (removed 13) and now considering 549/582 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 182/195 places, 549/582 transitions.
RANDOM walk for 40000 steps (1332 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (273 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (265 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 512556 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 2
Probabilistic random walk after 512556 steps, saw 162995 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-06-02 20:05:56] [INFO ] Flow matrix only has 502 transitions (discarded 47 similar events)
// Phase 1: matrix 502 rows 182 cols
[2024-06-02 20:05:56] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 20:05:56] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/109 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/170 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 502/672 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 99/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/684 variables, 12/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/684 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 684/684 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 99/99 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/109 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/170 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:05:56] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:05:56] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 502/672 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 99/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/684 variables, 12/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/684 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 684/684 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 549/549 transitions.
Applied a total of 0 rules in 17 ms. Remains 182 /182 variables (removed 0) and now considering 549/549 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 182/182 places, 549/549 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 549/549 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2024-06-02 20:05:57] [INFO ] Flow matrix only has 502 transitions (discarded 47 similar events)
[2024-06-02 20:05:57] [INFO ] Invariant cache hit.
[2024-06-02 20:05:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 20:05:57] [INFO ] Flow matrix only has 502 transitions (discarded 47 similar events)
[2024-06-02 20:05:57] [INFO ] Invariant cache hit.
[2024-06-02 20:05:57] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-06-02 20:05:57] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-02 20:05:57] [INFO ] Redundant transitions in 25 ms returned []
Running 541 sub problems to find dead transitions.
[2024-06-02 20:05:57] [INFO ] Flow matrix only has 502 transitions (discarded 47 similar events)
[2024-06-02 20:05:57] [INFO ] Invariant cache hit.
[2024-06-02 20:05:57] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-02 20:06:01] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:06:01] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:06:01] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-02 20:06:02] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:06:02] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:06:02] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:06:02] [INFO ] Deduced a trap composed of 135 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 502/684 variables, 182/199 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 99/298 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 7 (OVERLAPS) 0/684 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 541 unsolved
No progress, stopping.
After SMT solving in domain Real declared 684/684 variables, and 298 constraints, problems are : Problem set: 0 solved, 541 unsolved in 22225 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 502/684 variables, 182/199 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 99/298 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 541/839 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-06-02 20:06:35] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 684/684 variables, and 840 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 8/8 constraints]
After SMT, in 53022ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 53028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53587 ms. Remains : 182/182 places, 549/549 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 156 edges and 182 vertex of which 29 / 182 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 188 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 154 transition count 358
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 154 transition count 358
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 19 place count 154 transition count 346
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 153 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 49 place count 153 transition count 317
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 153 transition count 312
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 61 place count 148 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 148 transition count 308
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 65 place count 146 transition count 308
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 69 place count 144 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 144 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 143 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 143 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 142 transition count 304
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 142 transition count 300
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 83 place count 138 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 89 place count 138 transition count 294
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 92 place count 138 transition count 291
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 95 place count 135 transition count 291
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 101 place count 135 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 102 place count 135 transition count 290
Applied a total of 102 rules in 43 ms. Remains 135 /182 variables (removed 47) and now considering 290/549 (removed 259) transitions.
Running SMT prover for 2 properties.
[2024-06-02 20:06:50] [INFO ] Flow matrix only has 286 transitions (discarded 4 similar events)
// Phase 1: matrix 286 rows 135 cols
[2024-06-02 20:06:50] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 20:06:50] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:06:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 20:06:50] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:06:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 20:06:50] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 20:06:50] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:06:50] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
[2024-06-02 20:06:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-02 20:06:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 182 places, 549 transitions and 2245 arcs took 6 ms.
[2024-06-02 20:06:51] [INFO ] Flatten gal took : 66 ms
Total runtime 122834 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-20-ReachabilityFireability-2024-01
Could not compute solution for formula : FireWire-PT-20-ReachabilityFireability-2024-06

BK_STOP 1717358811388

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FireWire-PT-20-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/670/inv_0_
rfs formula name FireWire-PT-20-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/670/inv_1_
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-20"
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-20, 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-171734901400327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 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 ;