fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r494-smll-171636275100098
Last Updated
July 7, 2024

About the Execution of LTSMin+red for EisenbergMcGuire-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
717.567 55347.00 142035.00 214.10 F 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.r494-smll-171636275100098.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 EisenbergMcGuire-PT-04, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r494-smll-171636275100098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717219756781

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:29:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 05:29:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:29:18] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-06-01 05:29:18] [INFO ] Transformed 196 places.
[2024-06-01 05:29:18] [INFO ] Transformed 448 transitions.
[2024-06-01 05:29:18] [INFO ] Found NUPN structural information;
[2024-06-01 05:29:18] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 317 ms.
RANDOM walk for 40000 steps (8 resets) in 2447 ms. (16 steps per ms) remains 45/196 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
[2024-06-01 05:29:20] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2024-06-01 05:29:20] [INFO ] Computed 13 invariants in 24 ms
[2024-06-01 05:29:20] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 138/183 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 138/190 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 2/185 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 7/192 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 284/476 variables, 192/396 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 112/508 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (OVERLAPS) 4/480 variables, 4/512 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 18 (OVERLAPS) 0/480 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 517 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3485 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 138/183 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 138/190 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 2/185 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 7/192 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 36 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 17/221 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 284/476 variables, 192/413 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 112/525 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 24/549 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (OVERLAPS) 4/480 variables, 4/553 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 21/579 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 579 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5013 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 17/17 constraints]
After SMT, in 8623ms problems are : Problem set: 0 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 8 place count 192 transition count 404
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 88 place count 152 transition count 404
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 140 transition count 356
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 140 transition count 356
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 128 transition count 344
Applied a total of 136 rules in 97 ms. Remains 128 /196 variables (removed 68) and now considering 344/448 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 128/196 places, 344/448 transitions.
RANDOM walk for 4000000 steps (8 resets) in 25405 ms. (157 steps per ms) remains 43/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 740 ms. (539 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 556 ms. (718 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 560 ms. (713 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 548 ms. (728 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 552 ms. (723 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 564 ms. (707 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 553 ms. (722 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 551 ms. (724 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 553 ms. (722 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 556 ms. (718 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 555 ms. (719 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 545 ms. (732 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 549 ms. (727 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 549 ms. (727 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 560 ms. (713 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 558 ms. (715 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 553 ms. (722 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 555 ms. (719 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 550 ms. (725 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 555 ms. (719 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 546 ms. (731 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 549 ms. (727 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 602 ms. (663 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 543 ms. (735 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 544 ms. (733 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 545 ms. (732 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 685 ms. (583 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 633 ms. (630 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 556 ms. (718 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 626 ms. (637 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 752 ms. (531 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 695 ms. (574 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 523 ms. (763 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 511 ms. (781 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 521 ms. (766 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 510 ms. (782 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 517 ms. (772 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 514 ms. (776 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 520 ms. (767 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 510 ms. (782 steps per ms) remains 40/40 properties
[2024-06-01 05:29:43] [INFO ] Flow matrix only has 180 transitions (discarded 164 similar events)
// Phase 1: matrix 180 rows 128 cols
[2024-06-01 05:29:43] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 05:29:43] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 76/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 8/124 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 180/304 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 4/308 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 217 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 76/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 8/124 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 05:29:45] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-06-01 05:29:45] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2024-06-01 05:29:45] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:29:46] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:29:47] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 180/304 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 76/228 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 24/252 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 4/308 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 16/273 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 05:29:49] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 5 ms to minimize.
[2024-06-01 05:29:49] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-01 05:29:49] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-06-01 05:29:49] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-06-01 05:29:49] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 05:29:50] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 05:29:50] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-06-01 05:29:50] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-06-01 05:29:50] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 3 ms to minimize.
[2024-06-01 05:29:50] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 05:29:52] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 3 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/308 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 05:29:53] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 05:29:54] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 3 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/308 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 21 (OVERLAPS) 0/308 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 286 constraints, problems are : Problem set: 0 solved, 40 unsolved in 12037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 29/29 constraints]
After SMT, in 14058ms problems are : Problem set: 0 solved, 40 unsolved
Parikh walk visited 13 properties in 3461 ms.
Support contains 27 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 344/344 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 128 transition count 340
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 124 transition count 340
Applied a total of 8 rules in 37 ms. Remains 124 /128 variables (removed 4) and now considering 340/344 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 124/128 places, 340/344 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19905 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 440 ms. (907 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 454 ms. (879 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 451 ms. (884 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 449 ms. (888 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 450 ms. (886 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 450 ms. (886 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 465 ms. (858 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 452 ms. (883 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 442 ms. (902 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 451 ms. (884 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 451 ms. (884 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 449 ms. (888 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 825 ms. (484 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 453 ms. (881 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 446 ms. (894 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 447 ms. (892 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 446 ms. (894 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 446 ms. (894 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 451 ms. (884 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 464 ms. (860 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 580 ms. (688 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 579 ms. (689 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 553 ms. (722 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 459 ms. (869 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 461 ms. (865 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 469 ms. (851 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 451 ms. (884 steps per ms) remains 27/27 properties
Finished probabilistic random walk after 191523 steps, run visited all 27 properties in 1054 ms. (steps per millisecond=181 )
Probabilistic random walk after 191523 steps, saw 40343 distinct states, run finished after 1061 ms. (steps per millisecond=180 ) properties seen :27
Able to resolve query StableMarking after proving 196 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 53622 ms.
ITS solved all properties within timeout

BK_STOP 1717219812128

--------------------
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 StableMarking -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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="StableMarking"
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 EisenbergMcGuire-PT-04, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r494-smll-171636275100098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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