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.r528-tall-171683761500622.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 ShieldPPPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 185K May 18 16:43 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 ShieldPPPt-PT-010B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717257017151

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:50:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:50:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:50:18] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-01 15:50:18] [INFO ] Transformed 783 places.
[2024-06-01 15:50:18] [INFO ] Transformed 713 transitions.
[2024-06-01 15:50:18] [INFO ] Found NUPN structural information;
[2024-06-01 15:50:18] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1507 ms. (26 steps per ms) remains 3/13 properties
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 346 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 830 ms. (48 steps per ms) remains 3/3 properties
// Phase 1: matrix 713 rows 783 cols
[2024-06-01 15:50:19] [INFO ] Computed 111 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 693/783 variables, 111/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 693/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 713/1496 variables, 783/1677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1496 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1496 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 1677 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1430 ms.
Refiners :[Domain max(s): 783/783 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 783/783 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/90 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 693/783 variables, 111/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 693/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:50:21] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 20 ms to minimize.
[2024-06-01 15:50:21] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:50:21] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-06-01 15:50:21] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 6 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 7 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 5 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-06-01 15:50:22] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 20/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 15:50:23] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 6/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 713/1496 variables, 783/1703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1496 variables, 3/1706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:50:24] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:50:24] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:50:24] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:50:24] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 3 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:50:25] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-06-01 15:50:26] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 1719 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5012 ms.
Refiners :[Domain max(s): 783/783 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 39/39 constraints]
After SMT, in 6550ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 90 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 783 transition count 581
Reduce places removed 132 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 150 rules applied. Total rules applied 282 place count 651 transition count 563
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 300 place count 633 transition count 563
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 300 place count 633 transition count 524
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 378 place count 594 transition count 524
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 431 place count 541 transition count 471
Iterating global reduction 3 with 53 rules applied. Total rules applied 484 place count 541 transition count 471
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 484 place count 541 transition count 450
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 526 place count 520 transition count 450
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 800 place count 383 transition count 313
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 826 place count 370 transition count 313
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 837 place count 370 transition count 302
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 848 place count 359 transition count 302
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 868 place count 359 transition count 302
Applied a total of 868 rules in 216 ms. Remains 359 /783 variables (removed 424) and now considering 302/713 (removed 411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 359/783 places, 302/713 transitions.
RANDOM walk for 40000 steps (8 resets) in 639 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/3 properties
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 302 rows 359 cols
[2024-06-01 15:50:26] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 15:50:26] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 312/359 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 302/661 variables, 359/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 31/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/661 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 501 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 359/359 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 312/359 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 302/661 variables, 359/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 31/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:50:27] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
[2024-06-01 15:50:28] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:50:28] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:50:28] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:50:28] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:50:28] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 8/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:50:28] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/661 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 518 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 359/359 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 1870ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1155 ms.
Support contains 47 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 359 transition count 290
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 347 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 346 transition count 289
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 26 place count 346 transition count 281
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 338 transition count 281
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 337 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 337 transition count 280
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 88 place count 315 transition count 258
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 309 transition count 258
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 309 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 308 transition count 257
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 308 transition count 257
Applied a total of 107 rules in 58 ms. Remains 308 /359 variables (removed 51) and now considering 257/302 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 308/359 places, 257/302 transitions.
RANDOM walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/2 properties
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
// Phase 1: matrix 257 rows 308 cols
[2024-06-01 15:50:30] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 15:50:30] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/308 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 257/565 variables, 308/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 47/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/565 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 308/308 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/308 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 8 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 257/565 variables, 308/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 47/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:50:30] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 308/308 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1128ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 43 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 257/257 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 308 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 306 transition count 255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 304 transition count 253
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 304 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 303 transition count 252
Applied a total of 10 rules in 26 ms. Remains 303 /308 variables (removed 5) and now considering 252/257 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 303/308 places, 252/257 transitions.
RANDOM walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 834132 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 1
Probabilistic random walk after 834132 steps, saw 506086 distinct states, run finished after 3005 ms. (steps per millisecond=277 ) properties seen :0
// Phase 1: matrix 252 rows 303 cols
[2024-06-01 15:50:34] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 15:50:34] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 260/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 252/555 variables, 303/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 47/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 260/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:50:34] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 12/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 252/555 variables, 303/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 47/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:50:35] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 1359ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 43 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 252/252 transitions.
Applied a total of 0 rules in 8 ms. Remains 303 /303 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 303/303 places, 252/252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 252/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 303 /303 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-06-01 15:50:35] [INFO ] Invariant cache hit.
[2024-06-01 15:50:36] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 15:50:36] [INFO ] Invariant cache hit.
[2024-06-01 15:50:36] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 15:50:36] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-06-01 15:50:36] [INFO ] Redundant transitions in 13 ms returned []
Running 251 sub problems to find dead transitions.
[2024-06-01 15:50:36] [INFO ] Invariant cache hit.
[2024-06-01 15:50:36] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:50:38] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:50:38] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:50:39] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:50:40] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:50:40] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:50:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:50:40] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:50:41] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:50:41] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 4 ms to minimize.
[2024-06-01 15:50:41] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:50:41] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:50:41] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 252/555 variables, 303/441 constraints. Problems are: Problem set: 0 solved, 251 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 47/488 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 488 constraints, problems are : Problem set: 0 solved, 251 unsolved in 14857 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 27/138 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:50:53] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:50:53] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 252/555 variables, 303/443 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 47/490 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 251/741 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:50:58] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:50:58] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:50:59] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:51:00] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:51:00] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:51:00] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:51:03] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 7/748 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:51:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:51:11] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:51:12] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 3/751 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-06-01 15:51:15] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 752 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 303/303 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 40/40 constraints]
After SMT, in 44920ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 44925ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45527 ms. Remains : 303/303 places, 252/252 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 303 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 303 transition count 250
Applied a total of 44 rules in 29 ms. Remains 303 /303 variables (removed 0) and now considering 250/252 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 250 rows 303 cols
[2024-06-01 15:51:21] [INFO ] Computed 111 invariants in 1 ms
[2024-06-01 15:51:21] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 15:51:21] [INFO ] [Nat]Absence check using 111 positive place invariants in 14 ms returned sat
[2024-06-01 15:51:21] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 15:51:21] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 15:51:21] [INFO ] After 60ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 15:51:21] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:51:21] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 368 ms
TRAPS : Iteration 1
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 403 ms
TRAPS : Iteration 2
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:51:22] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 270 ms
TRAPS : Iteration 3
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 214 ms
TRAPS : Iteration 4
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 439 ms
TRAPS : Iteration 5
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 6
[2024-06-01 15:51:23] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:51:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
TRAPS : Iteration 7
[2024-06-01 15:51:24] [INFO ] After 2329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 15:51:24] [INFO ] After 2616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2716 ms.
[2024-06-01 15:51:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 15:51:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 303 places, 252 transitions and 1021 arcs took 6 ms.
[2024-06-01 15:51:24] [INFO ] Flatten gal took : 58 ms
Total runtime 66127 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 : ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01

BK_STOP 1717257084656

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1018/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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-010B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761500622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;