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.r480-tall-171624189900742.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 DES-PT-50b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900742
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717198142880

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:29:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:29:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:29:04] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-31 23:29:04] [INFO ] Transformed 479 places.
[2024-05-31 23:29:04] [INFO ] Transformed 430 transitions.
[2024-05-31 23:29:04] [INFO ] Found NUPN structural information;
[2024-05-31 23:29:04] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (339 resets) in 1638 ms. (24 steps per ms) remains 9/12 properties
FORMULA DES-PT-50b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (51 resets) in 258 ms. (154 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (44 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 315 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (49 resets) in 783 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (38 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (44 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (42 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
// Phase 1: matrix 430 rows 479 cols
[2024-05-31 23:29:05] [INFO ] Computed 65 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 336/442 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 336/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 37/479 variables, 24/507 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 37/544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 430/909 variables, 479/1023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/909 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/909 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 1023 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3852 ms.
Refiners :[Domain max(s): 479/479 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 336/442 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 336/482 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:29:10] [INFO ] Deduced a trap composed of 24 places in 369 ms of which 49 ms to minimize.
[2024-05-31 23:29:10] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 2 ms to minimize.
[2024-05-31 23:29:10] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-31 23:29:12] [INFO ] Deduced a trap composed of 20 places in 1773 ms of which 2 ms to minimize.
[2024-05-31 23:29:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:29:12] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:29:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:29:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 8/491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:29:13] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:29:13] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 37/479 variables, 24/517 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 37/554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:29:14] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-05-31 23:29:14] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-05-31 23:29:14] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:29:14] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:29:14] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 3 ms to minimize.
[2024-05-31 23:29:14] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
SMT process timed out in 9208ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 470 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 470 transition count 418
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 462 transition count 414
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 458 transition count 414
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 26 place count 458 transition count 408
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 38 place count 452 transition count 408
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 50 place count 440 transition count 396
Iterating global reduction 3 with 12 rules applied. Total rules applied 62 place count 440 transition count 396
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 67 place count 435 transition count 391
Iterating global reduction 3 with 5 rules applied. Total rules applied 72 place count 435 transition count 391
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 77 place count 435 transition count 386
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 173 place count 387 transition count 338
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 177 place count 385 transition count 342
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 184 place count 385 transition count 335
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 191 place count 378 transition count 335
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 195 place count 378 transition count 331
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 199 place count 374 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 374 transition count 330
Applied a total of 200 rules in 231 ms. Remains 374 /479 variables (removed 105) and now considering 330/430 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 374/479 places, 330/430 transitions.
RANDOM walk for 40000 steps (489 resets) in 967 ms. (41 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (84 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (88 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (90 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (86 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (73 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (86 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (78 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 638379 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 9
Probabilistic random walk after 638379 steps, saw 103806 distinct states, run finished after 3006 ms. (steps per millisecond=212 ) properties seen :0
// Phase 1: matrix 330 rows 374 cols
[2024-05-31 23:29:18] [INFO ] Computed 60 invariants in 8 ms
[2024-05-31 23:29:18] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 81/187 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 145/332 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/333 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 330/663 variables, 333/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 9/402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 41/704 variables, 41/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/704 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/704 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 704/704 variables, and 443 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1682 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 374/374 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 81/187 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:29:20] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:29:20] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-31 23:29:20] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:29:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 23:29:20] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-31 23:29:20] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-31 23:29:20] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-31 23:29:21] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:29:21] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 145/332 variables, 24/68 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 23:29:21] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 330/663 variables, 333/403 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 9/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/663 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 41/704 variables, 41/454 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/704 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/704 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/704 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 704/704 variables, and 462 constraints, problems are : Problem set: 0 solved, 9 unsolved in 19529 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 374/374 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 10/10 constraints]
After SMT, in 21267ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 36926 ms.
Support contains 106 out of 374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 330/330 transitions.
Applied a total of 0 rules in 28 ms. Remains 374 /374 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 374/374 places, 330/330 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 330/330 transitions.
Applied a total of 0 rules in 14 ms. Remains 374 /374 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2024-05-31 23:30:17] [INFO ] Invariant cache hit.
[2024-05-31 23:30:17] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-31 23:30:17] [INFO ] Invariant cache hit.
[2024-05-31 23:30:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 23:30:17] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-31 23:30:17] [INFO ] Redundant transitions in 16 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-31 23:30:17] [INFO ] Invariant cache hit.
[2024-05-31 23:30:17] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/374 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 329 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 330/704 variables, 374/434 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 9/443 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (OVERLAPS) 0/704 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 704/704 variables, and 443 constraints, problems are : Problem set: 0 solved, 329 unsolved in 26555 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 374/374 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 1/374 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:30:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-31 23:30:48] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:30:49] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:30:50] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-31 23:30:51] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:30:52] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:30:54] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-31 23:30:54] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-31 23:30:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-31 23:30:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:30:57] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-31 23:30:57] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-31 23:30:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:31:00] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (OVERLAPS) 330/704 variables, 374/482 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/704 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/704 variables, 329/820 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/704 variables, and 820 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 374/374 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 48/48 constraints]
After SMT, in 56817ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 56823ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57505 ms. Remains : 374/374 places, 330/330 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 990 edges and 374 vertex of which 373 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 373 /374 variables (removed 1) and now considering 330/330 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 330 rows 373 cols
[2024-05-31 23:31:14] [INFO ] Computed 59 invariants in 9 ms
[2024-05-31 23:31:14] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-31 23:31:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-31 23:31:14] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-31 23:31:15] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 428 ms
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:31:16] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:31:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2024-05-31 23:31:17] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-31 23:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-31 23:31:17] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
TRAPS : Iteration 1
[2024-05-31 23:31:18] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-31 23:31:19] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-31 23:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-31 23:31:19] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-31 23:31:19] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:31:19] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-31 23:31:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
TRAPS : Iteration 2
[2024-05-31 23:31:20] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:31:20] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:31:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
TRAPS : Iteration 3
[2024-05-31 23:31:21] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-31 23:31:21] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:31:21] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:31:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:31:22] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:31:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 293 ms
TRAPS : Iteration 4
[2024-05-31 23:31:23] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:31:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
TRAPS : Iteration 5
[2024-05-31 23:31:23] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:31:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
TRAPS : Iteration 6
[2024-05-31 23:31:25] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:31:25] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:31:25] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:31:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 246 ms
TRAPS : Iteration 7
[2024-05-31 23:31:26] [INFO ] After 11712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-31 23:31:27] [INFO ] After 12847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 13014 ms.
[2024-05-31 23:31:27] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 23:31:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 374 places, 330 transitions and 1337 arcs took 5 ms.
[2024-05-31 23:31:27] [INFO ] Flatten gal took : 55 ms
Total runtime 143745 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 : DES-PT-50b-ReachabilityCardinality-2024-01
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-02
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-05
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-06
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-07
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-08
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-09
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-11
Could not compute solution for formula : DES-PT-50b-ReachabilityCardinality-2024-14

BK_STOP 1717198288296

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/852/inv_0_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/852/inv_1_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/852/inv_2_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/852/inv_3_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/852/inv_4_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/852/inv_5_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/852/inv_6_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/852/inv_7_
rfs formula name DES-PT-50b-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/852/inv_8_
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="DES-PT-50b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DES-PT-50b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189900742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;