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.r492-smll-171636266300167.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 EisenbergMcGuire-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K May 18 16:42 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 EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717223446199

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:30:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:30:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:30:49] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2024-06-01 06:30:49] [INFO ] Transformed 295 places.
[2024-06-01 06:30:49] [INFO ] Transformed 800 transitions.
[2024-06-01 06:30:49] [INFO ] Found NUPN structural information;
[2024-06-01 06:30:49] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 636 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3252 ms. (12 steps per ms) remains 15/16 properties
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/15 properties
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 159 ms. (25 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
[2024-06-01 06:30:51] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2024-06-01 06:30:51] [INFO ] Computed 16 invariants in 30 ms
[2024-06-01 06:30:51] [INFO ] State equation strengthened by 196 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 156/295 variables, 10/150 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 156/306 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 465/760 variables, 295/606 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 196/802 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/802 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/760 variables, 0/802 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/760 variables, and 802 constraints, problems are : Problem set: 3 solved, 11 unsolved in 2416 ms.
Refiners :[Domain max(s): 295/295 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 295/295 constraints, ReadFeed: 196/196 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/111 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/111 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 185/295 variables, 10/121 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 185/306 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 5/311 constraints. Problems are: Problem set: 5 solved, 9 unsolved
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 53 ms to minimize.
[2024-06-01 06:30:54] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 3 places in 292 ms of which 5 ms to minimize.
[2024-06-01 06:30:55] [INFO ] Deduced a trap composed of 21 places in 304 ms of which 5 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 46 places in 229 ms of which 4 ms to minimize.
Problem EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10 is UNSAT
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:30:56] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 4 ms to minimize.
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 5 ms to minimize.
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 13/324 constraints. Problems are: Problem set: 6 solved, 8 unsolved
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 85 places in 218 ms of which 4 ms to minimize.
[2024-06-01 06:30:57] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2024-06-01 06:30:58] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 9 ms to minimize.
[2024-06-01 06:30:58] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 5 ms to minimize.
[2024-06-01 06:30:58] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 4 ms to minimize.
[2024-06-01 06:30:58] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:30:59] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
SMT process timed out in 7893ms, After SMT, problems are : Problem set: 6 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 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 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 798
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 293 transition count 798
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 4 place count 293 transition count 737
Deduced a syphon composed of 61 places in 4 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 126 place count 232 transition count 737
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 140 place count 218 transition count 667
Iterating global reduction 2 with 14 rules applied. Total rules applied 154 place count 218 transition count 667
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 186 place count 202 transition count 651
Applied a total of 186 rules in 237 ms. Remains 202 /295 variables (removed 93) and now considering 651/800 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 202/295 places, 651/800 transitions.
RANDOM walk for 40000 steps (8 resets) in 607 ms. (65 steps per ms) remains 7/8 properties
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
[2024-06-01 06:31:00] [INFO ] Flow matrix only has 316 transitions (discarded 335 similar events)
// Phase 1: matrix 316 rows 202 cols
[2024-06-01 06:31:00] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 06:31:00] [INFO ] State equation strengthened by 140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 160/199 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/202 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 316/518 variables, 202/218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 140/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/518 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 358 constraints, problems are : Problem set: 0 solved, 7 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 202/202 constraints, ReadFeed: 140/140 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/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 160/199 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:31:01] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/202 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 3 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:31:02] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:31:03] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 316/518 variables, 202/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 140/376 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 7/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/518 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 518/518 variables, and 383 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3691 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 202/202 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 18/18 constraints]
After SMT, in 4410ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 3254 ms.
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 651/651 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 202 transition count 630
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 181 transition count 630
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 175 transition count 600
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 175 transition count 600
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 171 transition count 596
Applied a total of 62 rules in 77 ms. Remains 171 /202 variables (removed 31) and now considering 596/651 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 171/202 places, 596/651 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 564690 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :1 out of 2
Probabilistic random walk after 564690 steps, saw 113010 distinct states, run finished after 3020 ms. (steps per millisecond=186 ) properties seen :1
FORMULA EisenbergMcGuire-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 06:31:10] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:31:10] [INFO ] Computed 16 invariants in 14 ms
[2024-06-01 06:31:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/72 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 129/201 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 24/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 48/249 variables, 21/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/321 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/327 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 105/432 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/432 variables, 80/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/432 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/72 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 129/201 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 24/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/249 variables, 21/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/321 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/327 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:31:11] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:31:12] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/327 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/327 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/432 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/432 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/432 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 171/171 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1420ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 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 171 transition count 595
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 170 transition count 595
Applied a total of 2 rules in 37 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 170/171 places, 595/596 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 778674 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :0 out of 1
Probabilistic random walk after 778674 steps, saw 149956 distinct states, run finished after 3001 ms. (steps per millisecond=259 ) properties seen :0
[2024-06-01 06:31:15] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
// Phase 1: matrix 260 rows 170 cols
[2024-06-01 06:31:15] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 06:31:15] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/71 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 128/199 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/247 variables, 21/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/319 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/325 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 105/430 variables, 78/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 80/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/430 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/430 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/64 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/71 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:15] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 128/199 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 48/247 variables, 21/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 72/319 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/319 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/325 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:31:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/325 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/325 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/430 variables, 78/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 80/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/430 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/430 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 879ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 27 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 170/170 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 595/595 transitions.
Applied a total of 0 rules in 24 ms. Remains 170 /170 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-01 06:31:16] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:31:16] [INFO ] Invariant cache hit.
[2024-06-01 06:31:16] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-06-01 06:31:16] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:31:16] [INFO ] Invariant cache hit.
[2024-06-01 06:31:16] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:31:17] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2024-06-01 06:31:17] [INFO ] Redundant transitions in 61 ms returned []
Running 590 sub problems to find dead transitions.
[2024-06-01 06:31:17] [INFO ] Flow matrix only has 260 transitions (discarded 335 similar events)
[2024-06-01 06:31:17] [INFO ] Invariant cache hit.
[2024-06-01 06:31:17] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 4 ms to minimize.
[2024-06-01 06:31:22] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-06-01 06:31:23] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:31:23] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:31:23] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 3 ms to minimize.
[2024-06-01 06:31:23] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 13 ms to minimize.
[2024-06-01 06:31:23] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:31:25] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:31:25] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 3 ms to minimize.
[2024-06-01 06:31:25] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:31:25] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 3 ms to minimize.
[2024-06-01 06:31:25] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:31:26] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:31:27] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:31:27] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:31:28] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-06-01 06:31:28] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:31:28] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:31:28] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:31:29] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:31:29] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:31:29] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:31:29] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:31:29] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-06-01 06:31:31] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:31:31] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:31:31] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:31:31] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:31:38] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:31:39] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 4 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:31:40] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:31:41] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 2 ms to minimize.
[2024-06-01 06:31:42] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:31:43] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-06-01 06:31:46] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:31:47] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
SMT process timed out in 30567ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 30584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31759 ms. Remains : 170/170 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 522 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 6 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 167
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 117 transition count 156
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 94 place count 101 transition count 156
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 174 place count 61 transition count 116
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 193 place count 61 transition count 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 211 place count 52 transition count 172
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 215 place count 52 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 220 place count 52 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 52 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 51 transition count 162
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 247 place count 51 transition count 162
Applied a total of 247 rules in 64 ms. Remains 51 /170 variables (removed 119) and now considering 162/595 (removed 433) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 162 rows 51 cols
[2024-06-01 06:31:48] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 06:31:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 06:31:48] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:31:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:31:48] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 06:31:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:31:48] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:31:48] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-06-01 06:31:48] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:31:48] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 549 ms.
[2024-06-01 06:31:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 19 ms.
[2024-06-01 06:31:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 595 transitions and 2990 arcs took 22 ms.
[2024-06-01 06:31:49] [INFO ] Flatten gal took : 179 ms
Total runtime 60423 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 : EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08

BK_STOP 1717223509685

--------------------
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 EisenbergMcGuire-PT-05-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/898/inv_0_
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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r492-smll-171636266300167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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