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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 90K 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-06-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717354278116

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:51:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:51:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:51:19] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-02 18:51:19] [INFO ] Transformed 116 places.
[2024-06-02 18:51:19] [INFO ] Transformed 368 transitions.
[2024-06-02 18:51:19] [INFO ] Found NUPN structural information;
[2024-06-02 18:51:19] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2001 resets) in 1253 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (14 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (78 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (121 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/16 properties
FORMULA FireWire-PT-06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 207 ms. (19 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 196 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (89 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 829162 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :5 out of 15
Probabilistic random walk after 829162 steps, saw 133736 distinct states, run finished after 3015 ms. (steps per millisecond=275 ) properties seen :5
FORMULA FireWire-PT-06-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-06-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 18:51:23] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 18:51:23] [INFO ] Computed 9 invariants in 15 ms
[2024-06-02 18:51:23] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FireWire-PT-06-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-06-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-06-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-06-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-06-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-06-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 31/116 variables, 9/94 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 31/125 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 279/395 variables, 116/241 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 40/281 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/281 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/396 variables, 1/282 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 282 constraints, problems are : Problem set: 3 solved, 7 unsolved in 696 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem FireWire-PT-06-ReachabilityFireability-2024-05 is UNSAT
FORMULA FireWire-PT-06-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-06-ReachabilityFireability-2024-09 is UNSAT
FORMULA FireWire-PT-06-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 49/114 variables, 8/73 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 49/122 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 11 ms to minimize.
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/124 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/116 variables, 1/125 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 2/127 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-02 18:51:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/128 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 279/395 variables, 116/244 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 40/284 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 5/289 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/289 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/396 variables, 1/290 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/290 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/396 variables, 0/290 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 290 constraints, problems are : Problem set: 5 solved, 5 unsolved in 1156 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 2100ms problems are : Problem set: 5 solved, 5 unsolved
Parikh walk visited 0 properties in 641 ms.
Support contains 54 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 115 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 113 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 113 transition count 297
Applied a total of 17 rules in 46 ms. Remains 113 /116 variables (removed 3) and now considering 297/312 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 113/116 places, 297/312 transitions.
RANDOM walk for 40000 steps (2130 resets) in 275 ms. (144 steps per ms) remains 3/5 properties
FORMULA FireWire-PT-06-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-06-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (957 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (526 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
[2024-06-02 18:51:26] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
// Phase 1: matrix 274 rows 113 cols
[2024-06-02 18:51:26] [INFO ] Computed 9 invariants in 7 ms
[2024-06-02 18:51:26] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 274/387 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 161 constraints, problems are : Problem set: 0 solved, 3 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:51:26] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 7 ms to minimize.
[2024-06-02 18:51:26] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:51:26] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:51:26] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:51:26] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:51:27] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 274/387 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 39/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/387 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 1220ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 444 ms.
Support contains 53 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 113/113 places, 297/297 transitions.
RANDOM walk for 40000 steps (2103 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (935 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (502 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1049380 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 3
Probabilistic random walk after 1049380 steps, saw 193985 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
[2024-06-02 18:51:31] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
[2024-06-02 18:51:31] [INFO ] Invariant cache hit.
[2024-06-02 18:51:31] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 274/387 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 161 constraints, problems are : Problem set: 0 solved, 3 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:51:31] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:51:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:51:31] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:51:31] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/113 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 274/387 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 168 constraints, problems are : Problem set: 0 solved, 3 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 973ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 400 ms.
Support contains 53 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 297/297 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 113/113 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 297/297 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 18:51:32] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
[2024-06-02 18:51:32] [INFO ] Invariant cache hit.
[2024-06-02 18:51:32] [INFO ] Implicit Places using invariants in 55 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 112/113 places, 297/297 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78 ms. Remains : 112/113 places, 297/297 transitions.
RANDOM walk for 40000 steps (2094 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (933 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (618 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1037236 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 3
Probabilistic random walk after 1037236 steps, saw 191290 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2024-06-02 18:51:35] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
// Phase 1: matrix 274 rows 112 cols
[2024-06-02 18:51:35] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:51:35] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 274/386 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 158 constraints, problems are : Problem set: 0 solved, 3 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 38/38 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:51:36] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:51:36] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:51:36] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:51:36] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:51:36] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 274/386 variables, 112/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 38/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 303 ms.
Support contains 53 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 transitions.
Applied a total of 0 rules in 16 ms. Remains 112 /112 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 112/112 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 18:51:37] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
[2024-06-02 18:51:37] [INFO ] Invariant cache hit.
[2024-06-02 18:51:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:51:37] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
[2024-06-02 18:51:37] [INFO ] Invariant cache hit.
[2024-06-02 18:51:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:51:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 179 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 110/112 places, 297/297 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 194 ms. Remains : 110/112 places, 297/297 transitions.
RANDOM walk for 40000 steps (2111 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (955 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (506 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1172045 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 3
Probabilistic random walk after 1172045 steps, saw 216521 distinct states, run finished after 3001 ms. (steps per millisecond=390 ) properties seen :0
[2024-06-02 18:51:40] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
// Phase 1: matrix 274 rows 110 cols
[2024-06-02 18:51:40] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:51:40] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 274/384 variables, 110/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/384 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 154 constraints, problems are : Problem set: 0 solved, 3 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:51:40] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 274/384 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 158 constraints, problems are : Problem set: 0 solved, 3 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 765ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 509 ms.
Support contains 53 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 110/110 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 18:51:41] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
[2024-06-02 18:51:41] [INFO ] Invariant cache hit.
[2024-06-02 18:51:41] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 18:51:41] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
[2024-06-02 18:51:41] [INFO ] Invariant cache hit.
[2024-06-02 18:51:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:51:42] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 18:51:42] [INFO ] Redundant transitions in 17 ms returned []
Running 296 sub problems to find dead transitions.
[2024-06-02 18:51:42] [INFO ] Flow matrix only has 274 transitions (discarded 23 similar events)
[2024-06-02 18:51:42] [INFO ] Invariant cache hit.
[2024-06-02 18:51:42] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 18:51:43] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:51:43] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:51:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:51:44] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:51:44] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 274/384 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 0/384 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 159 constraints, problems are : Problem set: 0 solved, 296 unsolved in 8765 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 274/384 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 296/455 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 18:51:54] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:51:55] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 457 constraints, problems are : Problem set: 0 solved, 296 unsolved in 17677 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 7/7 constraints]
After SMT, in 26640ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 26644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26874 ms. Remains : 110/110 places, 297/297 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 22 edges and 110 vertex of which 4 / 110 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 16 place count 108 transition count 255
Applied a total of 16 rules in 22 ms. Remains 108 /110 variables (removed 2) and now considering 255/297 (removed 42) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 255 rows 108 cols
[2024-06-02 18:52:08] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 18:52:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 18:52:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 18:52:08] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 18:52:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:52:09] [INFO ] After 131ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 18:52:09] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 18:52:09] [INFO ] After 634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 734 ms.
[2024-06-02 18:52:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-06-02 18:52:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 297 transitions and 1087 arcs took 7 ms.
[2024-06-02 18:52:09] [INFO ] Flatten gal took : 50 ms
Total runtime 50460 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-06-ReachabilityFireability-2024-01
Could not compute solution for formula : FireWire-PT-06-ReachabilityFireability-2024-07
Could not compute solution for formula : FireWire-PT-06-ReachabilityFireability-2024-08

BK_STOP 1717354329974

--------------------
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-06-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/657/inv_0_
rfs formula name FireWire-PT-06-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/657/inv_1_
rfs formula name FireWire-PT-06-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/657/inv_2_
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-06"
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-06, 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-171734901200215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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