fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r482-tall-171624201400172
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CloudReconfiguration-PT-401

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
603.199 17547.00 39192.00 90.50 T normal

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.r482-tall-171624201400172.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 CloudReconfiguration-PT-401, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201400172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 19:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 19:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 19:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 19:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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 912K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717178788149

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-401
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:06:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 18:06:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:06:29] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-05-31 18:06:29] [INFO ] Transformed 3554 places.
[2024-05-31 18:06:29] [INFO ] Transformed 4263 transitions.
[2024-05-31 18:06:29] [INFO ] Found NUPN structural information;
[2024-05-31 18:06:29] [INFO ] Parsed PT model containing 3554 places and 4263 transitions and 8889 arcs in 299 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 3554/3554 places, 4263/4263 transitions.
Graph (trivial) has 4080 edges and 3554 vertex of which 1260 / 3554 are part of one of the 88 SCC in 26 ms
Free SCC test removed 1172 places
Ensure Unique test removed 1348 transitions
Reduce isomorphic transitions removed 1348 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1605 transitions
Trivial Post-agglo rules discarded 1605 transitions
Performed 1605 trivial Post agglomeration. Transition count delta: 1605
Iterating post reduction 0 with 1605 rules applied. Total rules applied 1606 place count 2382 transition count 1310
Reduce places removed 1605 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 1740 rules applied. Total rules applied 3346 place count 777 transition count 1175
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 3394 place count 733 transition count 1171
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 3394 place count 733 transition count 1141
Deduced a syphon composed of 30 places in 8 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 3454 place count 703 transition count 1141
Performed 389 Post agglomeration using F-continuation condition with reduction of 100 identical transitions.
Deduced a syphon composed of 389 places in 1 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 3 with 778 rules applied. Total rules applied 4232 place count 314 transition count 652
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4236 place count 314 transition count 648
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 4308 place count 278 transition count 720
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 4328 place count 278 transition count 700
Applied a total of 4328 rules in 210 ms. Remains 278 /3554 variables (removed 3276) and now considering 700/4263 (removed 3563) transitions.
[2024-05-31 18:06:29] [INFO ] Flow matrix only has 590 transitions (discarded 110 similar events)
// Phase 1: matrix 590 rows 278 cols
[2024-05-31 18:06:29] [INFO ] Computed 5 invariants in 18 ms
[2024-05-31 18:06:30] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-31 18:06:30] [INFO ] Flow matrix only has 590 transitions (discarded 110 similar events)
[2024-05-31 18:06:30] [INFO ] Invariant cache hit.
[2024-05-31 18:06:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 18:06:30] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [93, 211, 270]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 817 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 275/3554 places, 700/4263 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 272 transition count 697
Applied a total of 6 rules in 7 ms. Remains 272 /275 variables (removed 3) and now considering 697/700 (removed 3) transitions.
[2024-05-31 18:06:30] [INFO ] Flow matrix only has 587 transitions (discarded 110 similar events)
// Phase 1: matrix 587 rows 272 cols
[2024-05-31 18:06:30] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 18:06:30] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 18:06:30] [INFO ] Flow matrix only has 587 transitions (discarded 110 similar events)
[2024-05-31 18:06:30] [INFO ] Invariant cache hit.
[2024-05-31 18:06:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 18:06:31] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 272/3554 places, 697/4263 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1544 ms. Remains : 272/3554 places, 697/4263 transitions.
Discarding 433 transitions out of 697. Remains 264
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (3877 resets) in 2704 ms. (14 steps per ms) remains 43/263 properties
BEST_FIRST walk for 4004 steps (46 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (47 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (45 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (43 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4004 steps (52 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (59 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 9 ms. (400 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (34 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (34 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
[2024-05-31 18:06:32] [INFO ] Flow matrix only has 587 transitions (discarded 110 similar events)
[2024-05-31 18:06:32] [INFO ] Invariant cache hit.
[2024-05-31 18:06:32] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 83/127 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 83/129 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 496/623 variables, 127/256 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 230/853 variables, 140/398 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 140/538 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/853 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 5/858 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/858 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/858 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 1/859 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/859 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (OVERLAPS) 0/859 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 556 constraints, problems are : Problem set: 0 solved, 38 unsolved in 4455 ms.
Refiners :[Domain max(s): 272/272 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 272/272 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 83/127 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 83/129 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 496/623 variables, 127/256 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 230/853 variables, 140/403 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/853 variables, 140/543 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/853 variables, 7/550 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/853 variables, 33/583 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/853 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 5/858 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/858 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/858 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (OVERLAPS) 1/859 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/859 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/859 variables, and 594 constraints, problems are : Problem set: 0 solved, 38 unsolved in 5026 ms.
Refiners :[Domain max(s): 272/272 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 272/272 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 9719ms problems are : Problem set: 0 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 697/697 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 272 transition count 606
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 189 place count 174 transition count 497
Iterating global reduction 1 with 98 rules applied. Total rules applied 287 place count 174 transition count 497
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 371 place count 174 transition count 413
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 382 place count 163 transition count 399
Iterating global reduction 2 with 11 rules applied. Total rules applied 393 place count 163 transition count 399
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 401 place count 163 transition count 391
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 404 place count 160 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 407 place count 160 transition count 382
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 410 place count 157 transition count 370
Iterating global reduction 3 with 3 rules applied. Total rules applied 413 place count 157 transition count 370
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 416 place count 154 transition count 352
Iterating global reduction 3 with 3 rules applied. Total rules applied 419 place count 154 transition count 352
Performed 25 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 469 place count 129 transition count 320
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 482 place count 129 transition count 307
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 492 place count 124 transition count 314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 497 place count 124 transition count 309
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 498 place count 123 transition count 303
Iterating global reduction 5 with 1 rules applied. Total rules applied 499 place count 123 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 535 place count 123 transition count 267
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 5 with 1 rules applied. Total rules applied 536 place count 123 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 537 place count 122 transition count 266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 539 place count 121 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 541 place count 121 transition count 263
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 7 with 1 rules applied. Total rules applied 542 place count 121 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 543 place count 120 transition count 262
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 544 place count 120 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 545 place count 119 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 546 place count 119 transition count 260
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 555 place count 119 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 558 place count 119 transition count 257
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 561 place count 119 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 564 place count 119 transition count 254
Applied a total of 564 rules in 126 ms. Remains 119 /272 variables (removed 153) and now considering 254/697 (removed 443) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 119/272 places, 254/697 transitions.
RANDOM walk for 4000000 steps (501292 resets) in 10440 ms. (383 steps per ms) remains 1/38 properties
BEST_FIRST walk for 4000003 steps (117603 resets) in 2001 ms. (1998 steps per ms) remains 1/1 properties
[2024-05-31 18:06:45] [INFO ] Flow matrix only has 235 transitions (discarded 19 similar events)
// Phase 1: matrix 235 rows 119 cols
[2024-05-31 18:06:45] [INFO ] Computed 5 invariants in 5 ms
[2024-05-31 18:06:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/353 variables, 118/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/354 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 119/119 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/353 variables, 118/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 119/119 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 254/254 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 119 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 118 transition count 253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 118 transition count 251
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 116 transition count 251
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 11 place count 111 transition count 245
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 111 transition count 245
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 101 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 53 place count 101 transition count 218
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 65 place count 89 transition count 206
Iterating global reduction 3 with 12 rules applied. Total rules applied 77 place count 89 transition count 206
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 82 place count 89 transition count 201
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 96 place count 82 transition count 194
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 103 place count 82 transition count 187
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 110 place count 75 transition count 180
Iterating global reduction 5 with 7 rules applied. Total rules applied 117 place count 75 transition count 180
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 124 place count 75 transition count 173
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 140 place count 67 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 152 place count 67 transition count 161
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 160 place count 59 transition count 153
Iterating global reduction 7 with 8 rules applied. Total rules applied 168 place count 59 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 176 place count 59 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 8 with 43 rules applied. Total rules applied 219 place count 59 transition count 102
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 220 place count 58 transition count 101
Iterating global reduction 8 with 1 rules applied. Total rules applied 221 place count 58 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 222 place count 58 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 228 place count 55 transition count 97
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 231 place count 55 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 232 place count 55 transition count 93
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 236 place count 55 transition count 89
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 240 place count 51 transition count 89
Applied a total of 240 rules in 50 ms. Remains 51 /119 variables (removed 68) and now considering 89/254 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 51/119 places, 89/254 transitions.
RANDOM walk for 58124 steps (6125 resets) in 127 ms. (454 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 264 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 16378 ms.
ITS solved all properties within timeout

BK_STOP 1717178805696

--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML

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="CloudReconfiguration-PT-401"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 CloudReconfiguration-PT-401, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r482-tall-171624201400172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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