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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 512K 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 ShieldIIPt-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717237706217

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:28:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:28:27] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-01 10:28:27] [INFO ] Transformed 2103 places.
[2024-06-01 10:28:27] [INFO ] Transformed 1953 transitions.
[2024-06-01 10:28:27] [INFO ] Found NUPN structural information;
[2024-06-01 10:28:27] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1603 ms. (24 steps per ms) remains 7/16 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 826 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
// Phase 1: matrix 1953 rows 2103 cols
[2024-06-01 10:28:28] [INFO ] Computed 271 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1090/1205 variables, 138/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1205 variables, 1090/1343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1205 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 898/2103 variables, 133/1476 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2103 variables, 898/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2103 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1953/4056 variables, 2103/4477 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4056/4056 variables, and 4477 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2555 ms.
Refiners :[Domain max(s): 2103/2103 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 2103/2103 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1090/1205 variables, 138/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1205 variables, 1090/1343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:28:32] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 42 ms to minimize.
[2024-06-01 10:28:32] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-06-01 10:28:32] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 3 ms to minimize.
[2024-06-01 10:28:32] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
[2024-06-01 10:28:32] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-06-01 10:28:32] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-06-01 10:28:33] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 3 ms to minimize.
[2024-06-01 10:28:33] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-06-01 10:28:33] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-06-01 10:28:33] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-06-01 10:28:33] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-06-01 10:28:33] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 10:28:33] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-06-01 10:28:34] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-06-01 10:28:34] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:28:34] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 10:28:34] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 10:28:34] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-06-01 10:28:34] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:28:35] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1205 variables, 20/1363 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:28:35] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
[2024-06-01 10:28:35] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 3 ms to minimize.
[2024-06-01 10:28:35] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1205 variables, 3/1366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:28:35] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1205 variables, 1/1367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1205 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 898/2103 variables, 133/1500 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2103 variables, 898/2398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:28:36] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 5 ms to minimize.
[2024-06-01 10:28:36] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 4 ms to minimize.
SMT process timed out in 7789ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 433 rules applied. Total rules applied 433 place count 2103 transition count 1520
Reduce places removed 433 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 451 rules applied. Total rules applied 884 place count 1670 transition count 1502
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 903 place count 1652 transition count 1501
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 903 place count 1652 transition count 1377
Deduced a syphon composed of 124 places in 2 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 1151 place count 1528 transition count 1377
Discarding 196 places :
Symmetric choice reduction at 3 with 196 rule applications. Total rules 1347 place count 1332 transition count 1181
Iterating global reduction 3 with 196 rules applied. Total rules applied 1543 place count 1332 transition count 1181
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1543 place count 1332 transition count 1107
Deduced a syphon composed of 74 places in 6 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 1691 place count 1258 transition count 1107
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 2 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2591 place count 808 transition count 657
Renaming transitions due to excessive name length > 1024 char.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 2731 place count 738 transition count 691
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 2732 place count 738 transition count 690
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2738 place count 738 transition count 684
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2744 place count 732 transition count 684
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 2774 place count 732 transition count 684
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2775 place count 731 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2776 place count 730 transition count 683
Applied a total of 2776 rules in 926 ms. Remains 730 /2103 variables (removed 1373) and now considering 683/1953 (removed 1270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 959 ms. Remains : 730/2103 places, 683/1953 transitions.
RANDOM walk for 40000 steps (8 resets) in 542 ms. (73 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
// Phase 1: matrix 683 rows 730 cols
[2024-06-01 10:28:38] [INFO ] Computed 270 invariants in 2 ms
[2024-06-01 10:28:38] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 335/449 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 220/669 variables, 104/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 655/1324 variables, 669/910 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 152/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 66/1390 variables, 46/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1390 variables, 21/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1390 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/1391 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1391 variables, 1/1131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1391 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/1393 variables, 1/1132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1393 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 20/1413 variables, 14/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1413 variables, 6/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1413 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1413 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1413/1413 variables, and 1152 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 730/730 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 335/449 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 6 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:28:40] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 15/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 220/669 variables, 104/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:41] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:42] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:42] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 8 ms to minimize.
[2024-06-01 10:28:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:42] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:28:42] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 655/1324 variables, 669/943 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 152/1095 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 5/1100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:43] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2024-06-01 10:28:43] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:28:43] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:28:43] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1324 variables, 4/1104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1324 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 66/1390 variables, 46/1150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1390 variables, 21/1171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 1/1172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:28:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-06-01 10:28:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-06-01 10:28:46] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1390 variables, 3/1175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1390 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/1391 variables, 1/1176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1391 variables, 1/1177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1391 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/1393 variables, 1/1178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1393 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 20/1413 variables, 14/1192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1413 variables, 6/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1413 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 0/1413 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1413/1413 variables, and 1198 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9295 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 730/730 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 40/40 constraints]
After SMT, in 11098ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5096 ms.
Support contains 114 out of 730 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 730/730 places, 683/683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 730 transition count 682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 729 transition count 682
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 729 transition count 682
Applied a total of 3 rules in 67 ms. Remains 729 /730 variables (removed 1) and now considering 682/683 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 729/730 places, 682/683 transitions.
RANDOM walk for 40000 steps (8 resets) in 524 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 144729 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 6
Probabilistic random walk after 144729 steps, saw 102626 distinct states, run finished after 3022 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 682 rows 729 cols
[2024-06-01 10:28:58] [INFO ] Computed 270 invariants in 8 ms
[2024-06-01 10:28:58] [INFO ] State equation strengthened by 153 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 335/449 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 219/668 variables, 104/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 654/1322 variables, 668/909 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1322 variables, 153/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1322 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 66/1388 variables, 46/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1388 variables, 21/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1388 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/1389 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1389 variables, 1/1131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1389 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/1391 variables, 1/1132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1391 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 20/1411 variables, 14/1146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1411 variables, 6/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1411 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1411 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1411/1411 variables, and 1152 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1777 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 729/729 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 335/449 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 10/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:29:00] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 219/668 variables, 104/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:29:01] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:29:02] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:02] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:02] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 654/1322 variables, 668/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1322 variables, 153/1092 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1322 variables, 5/1097 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:03] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-06-01 10:29:03] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1322 variables, 2/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1322 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 66/1388 variables, 46/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1388 variables, 21/1166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1388 variables, 1/1167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 10:29:04] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1388 variables, 1/1168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1388 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/1389 variables, 1/1169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1389 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1389 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/1391 variables, 1/1171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1391 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 20/1411 variables, 14/1185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1411 variables, 6/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1411 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 0/1411 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1411/1411 variables, and 1191 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7647 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 729/729 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 9481ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2837 ms.
Support contains 114 out of 729 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 729/729 places, 682/682 transitions.
Applied a total of 0 rules in 26 ms. Remains 729 /729 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 729/729 places, 682/682 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 729/729 places, 682/682 transitions.
Applied a total of 0 rules in 25 ms. Remains 729 /729 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-06-01 10:29:10] [INFO ] Invariant cache hit.
[2024-06-01 10:29:10] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 10:29:10] [INFO ] Invariant cache hit.
[2024-06-01 10:29:11] [INFO ] State equation strengthened by 153 read => feed constraints.
[2024-06-01 10:29:12] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
[2024-06-01 10:29:12] [INFO ] Redundant transitions in 42 ms returned []
Running 674 sub problems to find dead transitions.
[2024-06-01 10:29:12] [INFO ] Invariant cache hit.
[2024-06-01 10:29:12] [INFO ] State equation strengthened by 153 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/724 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/724 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (OVERLAPS) 5/729 variables, 232/270 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:29:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:29:27] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/729 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 10:29:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:29:35] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:29:35] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:29:36] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:29:36] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:29:36] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:29:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:29:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:29:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:29:37] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:29:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:29:38] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:29:38] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:29:38] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:29:38] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:29:38] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:29:39] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-06-01 10:29:40] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/1411 variables, and 308 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/729 constraints, ReadFeed: 0/153 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/724 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/724 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (OVERLAPS) 5/729 variables, 232/270 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/729 variables, 38/308 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 10:29:53] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:29:54] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:29:54] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:29:54] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 10:29:54] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:29:54] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/729 variables, 6/314 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/729 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 6 (OVERLAPS) 682/1411 variables, 729/1043 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1411 variables, 153/1196 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1411 variables, 674/1870 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1411/1411 variables, and 1870 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 729/729 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 44/44 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62075 ms. Remains : 729/729 places, 682/682 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 89 times.
Drop transitions (Partial Free agglomeration) removed 89 transitions
Iterating global reduction 0 with 89 rules applied. Total rules applied 89 place count 729 transition count 682
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 729 transition count 679
Applied a total of 92 rules in 40 ms. Remains 729 /729 variables (removed 0) and now considering 679/682 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 679 rows 729 cols
[2024-06-01 10:30:12] [INFO ] Computed 270 invariants in 3 ms
[2024-06-01 10:30:12] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-01 10:30:12] [INFO ] [Nat]Absence check using 270 positive place invariants in 36 ms returned sat
[2024-06-01 10:30:13] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-01 10:30:13] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 10:30:13] [INFO ] After 411ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 2 ms to minimize.
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:30:14] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1548 ms
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 10:30:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2024-06-01 10:30:15] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 897 ms
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-06-01 10:30:16] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
TRAPS : Iteration 1
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 10:30:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 551 ms
[2024-06-01 10:30:18] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:30:18] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-06-01 10:30:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2024-06-01 10:30:18] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-06-01 10:30:18] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 10:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-06-01 10:30:18] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
TRAPS : Iteration 2
[2024-06-01 10:30:19] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-06-01 10:30:19] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-06-01 10:30:19] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-06-01 10:30:19] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-06-01 10:30:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 500 ms
[2024-06-01 10:30:19] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:30:19] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-06-01 10:30:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2024-06-01 10:30:20] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 10:30:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
TRAPS : Iteration 3
[2024-06-01 10:30:20] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:30:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-06-01 10:30:20] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-06-01 10:30:21] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-06-01 10:30:21] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-06-01 10:30:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
TRAPS : Iteration 4
[2024-06-01 10:30:21] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-01 10:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-06-01 10:30:21] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-06-01 10:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
TRAPS : Iteration 5
[2024-06-01 10:30:22] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 10:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-06-01 10:30:22] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-01 10:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
TRAPS : Iteration 6
[2024-06-01 10:30:23] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-06-01 10:30:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
TRAPS : Iteration 7
[2024-06-01 10:30:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 10:30:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2024-06-01 10:30:24] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 10:30:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-06-01 10:30:24] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:30:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
TRAPS : Iteration 8
[2024-06-01 10:30:25] [INFO ] After 12090ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-01 10:30:26] [INFO ] After 13277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 13488 ms.
[2024-06-01 10:30:26] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 10:30:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 729 places, 682 transitions and 2988 arcs took 7 ms.
[2024-06-01 10:30:26] [INFO ] Flatten gal took : 97 ms
Total runtime 118947 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 : ShieldIIPt-PT-030B-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldIIPt-PT-030B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldIIPt-PT-030B-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-030B-ReachabilityFireability-2024-05
Could not compute solution for formula : ShieldIIPt-PT-030B-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldIIPt-PT-030B-ReachabilityFireability-2024-15

BK_STOP 1717237826604

--------------------
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 ShieldIIPt-PT-030B-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/1202/inv_0_
rfs formula name ShieldIIPt-PT-030B-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/1202/inv_1_
rfs formula name ShieldIIPt-PT-030B-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/1202/inv_2_
rfs formula name ShieldIIPt-PT-030B-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1202/inv_3_
rfs formula name ShieldIIPt-PT-030B-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/1202/inv_4_
rfs formula name ShieldIIPt-PT-030B-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/1202/inv_5_
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="ShieldIIPt-PT-030B"
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 ShieldIIPt-PT-030B, 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-171683760800303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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