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-171683762401039.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 ShieldRVt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762401039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 614K 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 ShieldRVt-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717278273083

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:44:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:44:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:44:34] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-06-01 21:44:34] [INFO ] Transformed 2503 places.
[2024-06-01 21:44:34] [INFO ] Transformed 2503 transitions.
[2024-06-01 21:44:34] [INFO ] Found NUPN structural information;
[2024-06-01 21:44:34] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1953 ms. (20 steps per ms) remains 10/16 properties
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 627 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
// Phase 1: matrix 2503 rows 2503 cols
[2024-06-01 21:44:35] [INFO ] Computed 201 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2099/2326 variables, 185/412 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2326 variables, 2099/2511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2326 variables, 0/2511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 177/2503 variables, 16/2527 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 177/2704 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/2704 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2503/5006 variables, 2503/5207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5006/5006 variables, and 5207 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4405 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ShieldRVt-PT-050B-ReachabilityFireability-2024-11 is UNSAT
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2099/2326 variables, 185/412 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2326 variables, 2099/2511 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-01 21:44:41] [INFO ] Deduced a trap composed of 24 places in 530 ms of which 67 ms to minimize.
[2024-06-01 21:44:42] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 8 ms to minimize.
[2024-06-01 21:44:42] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 7 ms to minimize.
[2024-06-01 21:44:42] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 7 ms to minimize.
[2024-06-01 21:44:43] [INFO ] Deduced a trap composed of 49 places in 353 ms of which 7 ms to minimize.
[2024-06-01 21:44:43] [INFO ] Deduced a trap composed of 44 places in 350 ms of which 6 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 50 places in 366 ms of which 7 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 6 ms to minimize.
[2024-06-01 21:44:44] [INFO ] Deduced a trap composed of 43 places in 331 ms of which 6 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 21 places in 321 ms of which 6 ms to minimize.
[2024-06-01 21:44:45] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 5 ms to minimize.
SMT process timed out in 9640ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 217 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 2503 transition count 1918
Reduce places removed 585 places and 0 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 1 with 658 rules applied. Total rules applied 1243 place count 1918 transition count 1845
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 1316 place count 1845 transition count 1845
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 219 Pre rules applied. Total rules applied 1316 place count 1845 transition count 1626
Deduced a syphon composed of 219 places in 3 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 3 with 438 rules applied. Total rules applied 1754 place count 1626 transition count 1626
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 2058 place count 1322 transition count 1322
Iterating global reduction 3 with 304 rules applied. Total rules applied 2362 place count 1322 transition count 1322
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 2362 place count 1322 transition count 1220
Deduced a syphon composed of 102 places in 6 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 2566 place count 1220 transition count 1220
Performed 386 Post agglomeration using F-continuation condition.Transition count delta: 386
Deduced a syphon composed of 386 places in 7 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 3 with 772 rules applied. Total rules applied 3338 place count 834 transition count 834
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3540 place count 733 transition count 893
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3560 place count 723 transition count 898
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3561 place count 723 transition count 897
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3569 place count 723 transition count 889
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 3577 place count 715 transition count 889
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 3580 place count 715 transition count 886
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 3582 place count 715 transition count 886
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3583 place count 714 transition count 885
Applied a total of 3583 rules in 746 ms. Remains 714 /2503 variables (removed 1789) and now considering 885/2503 (removed 1618) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 757 ms. Remains : 714/2503 places, 885/2503 transitions.
RANDOM walk for 40000 steps (8 resets) in 973 ms. (41 steps per ms) remains 5/9 properties
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 4/5 properties
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
// Phase 1: matrix 885 rows 714 cols
[2024-06-01 21:44:47] [INFO ] Computed 201 invariants in 10 ms
[2024-06-01 21:44:47] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 379/486 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 228/714 variables, 85/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 885/1599 variables, 714/915 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1599 variables, 251/1166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1599 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1599/1599 variables, and 1166 constraints, problems are : Problem set: 0 solved, 4 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 714/714 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 379/486 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 21:44:48] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 11/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:49] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 228/714 variables, 85/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:44:50] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/714 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/714 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 885/1599 variables, 714/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1599 variables, 251/1193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1599 variables, 4/1197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:51] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:44:51] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1599 variables, 2/1199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1599 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1599 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1599/1599 variables, and 1199 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4765 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 714/714 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 29/29 constraints]
After SMT, in 5770ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1511 ms.
Support contains 107 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 885/885 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 714 transition count 861
Reduce places removed 24 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 690 transition count 858
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 687 transition count 858
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 54 place count 687 transition count 821
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 128 place count 650 transition count 821
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 135 place count 643 transition count 814
Iterating global reduction 3 with 7 rules applied. Total rules applied 142 place count 643 transition count 814
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 270 place count 579 transition count 750
Renaming transitions due to excessive name length > 1024 char.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 316 place count 556 transition count 771
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 556 transition count 770
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 556 transition count 768
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 321 place count 554 transition count 766
Applied a total of 321 rules in 104 ms. Remains 554 /714 variables (removed 160) and now considering 766/885 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 554/714 places, 766/885 transitions.
RANDOM walk for 40000 steps (8 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 196072 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 4
Probabilistic random walk after 196072 steps, saw 119981 distinct states, run finished after 3011 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 766 rows 554 cols
[2024-06-01 21:44:57] [INFO ] Computed 201 invariants in 5 ms
[2024-06-01 21:44:57] [INFO ] State equation strengthened by 208 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 277/384 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/448 variables, 32/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 662/1110 variables, 448/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 196/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 180/1290 variables, 88/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1290 variables, 44/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1290 variables, 12/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1290 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 30/1320 variables, 18/954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 9/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1320 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1320 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 963 constraints, problems are : Problem set: 0 solved, 4 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 554/554 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 277/384 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:58] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:44:58] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 64/448 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:44:59] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 662/1110 variables, 448/609 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 196/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 180/1290 variables, 88/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1290 variables, 44/938 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1290 variables, 12/950 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1290 variables, 3/953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 21:45:00] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1290 variables, 1/954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1290 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 30/1320 variables, 18/972 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1320 variables, 9/981 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1320 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1320 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 981 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3441 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 554/554 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4364ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1888 ms.
Support contains 107 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 766/766 transitions.
Applied a total of 0 rules in 13 ms. Remains 554 /554 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 554/554 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 766/766 transitions.
Applied a total of 0 rules in 12 ms. Remains 554 /554 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2024-06-01 21:45:04] [INFO ] Invariant cache hit.
[2024-06-01 21:45:04] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-01 21:45:04] [INFO ] Invariant cache hit.
[2024-06-01 21:45:04] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-06-01 21:45:05] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-06-01 21:45:05] [INFO ] Redundant transitions in 38 ms returned []
Running 744 sub problems to find dead transitions.
[2024-06-01 21:45:05] [INFO ] Invariant cache hit.
[2024-06-01 21:45:05] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (OVERLAPS) 19/554 variables, 130/201 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-06-01 21:45:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 21:45:18] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 8 ms to minimize.
[2024-06-01 21:45:18] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 21:45:19] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 21:45:19] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 21:45:20] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:45:20] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-06-01 21:45:20] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/1320 variables, and 209 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/554 constraints, ReadFeed: 0/208 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 3 (OVERLAPS) 19/554 variables, 130/203 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 6 (OVERLAPS) 766/1320 variables, 554/763 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1320 variables, 208/971 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 744/1715 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-06-01 21:46:03] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 1716 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 554/554 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 9/9 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61877 ms. Remains : 554/554 places, 766/766 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 554 vertex of which 2 / 554 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1774 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 115 edges and 551 vertex of which 4 / 551 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 549 transition count 761
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 113 edges and 546 vertex of which 2 / 546 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 545 transition count 754
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 112 edges and 544 vertex of which 2 / 544 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 543 transition count 749
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 542 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 29 place count 542 transition count 745
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 540 transition count 745
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 81 place count 540 transition count 696
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 107 place count 540 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 540 transition count 684
Applied a total of 119 rules in 69 ms. Remains 540 /554 variables (removed 14) and now considering 684/766 (removed 82) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 684 rows 540 cols
[2024-06-01 21:46:06] [INFO ] Computed 194 invariants in 2 ms
[2024-06-01 21:46:06] [INFO ] [Real]Absence check using 194 positive place invariants in 26 ms returned sat
[2024-06-01 21:46:06] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 21:46:06] [INFO ] [Nat]Absence check using 194 positive place invariants in 28 ms returned sat
[2024-06-01 21:46:06] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 21:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 21:46:07] [INFO ] After 198ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 21:46:07] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
[2024-06-01 21:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-06-01 21:46:07] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 21:46:07] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-06-01 21:46:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2024-06-01 21:46:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 21:46:07] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:46:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
TRAPS : Iteration 1
[2024-06-01 21:46:07] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
TRAPS : Iteration 2
[2024-06-01 21:46:08] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:46:08] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:46:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
TRAPS : Iteration 3
[2024-06-01 21:46:08] [INFO ] After 1882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 21:46:08] [INFO ] After 2596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2874 ms.
[2024-06-01 21:46:08] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 21:46:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 554 places, 766 transitions and 3729 arcs took 6 ms.
[2024-06-01 21:46:09] [INFO ] Flatten gal took : 109 ms
Total runtime 94937 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 : ShieldRVt-PT-050B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityFireability-2024-12
Could not compute solution for formula : ShieldRVt-PT-050B-ReachabilityFireability-2024-14

BK_STOP 1717278369430

--------------------
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 ShieldRVt-PT-050B-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/775/inv_0_
rfs formula name ShieldRVt-PT-050B-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/775/inv_1_
rfs formula name ShieldRVt-PT-050B-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/775/inv_2_
rfs formula name ShieldRVt-PT-050B-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/775/inv_3_
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="ShieldRVt-PT-050B"
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 ShieldRVt-PT-050B, 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 r528-tall-171683762401039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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