fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r213-smll-167840356600193
Last Updated
May 14, 2023

About the Execution of LoLa+red for HealthRecord-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
254.724 94538.00 185215.00 573.30 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/mcc2023-input.r213-smll-167840356600193.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HealthRecord-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-167840356600193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 26 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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 1678611399610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-12 08:56:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-12 08:56:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:56:42] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-12 08:56:42] [INFO ] Transformed 158 places.
[2023-03-12 08:56:42] [INFO ] Transformed 333 transitions.
[2023-03-12 08:56:42] [INFO ] Found NUPN structural information;
[2023-03-12 08:56:42] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 195 ms.
Graph (trivial) has 270 edges and 158 vertex of which 10 / 158 are part of one of the 5 SCC in 5 ms
Free SCC test removed 5 places
Structural test allowed to assert that 32 places are NOT stable. Took 14 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Incomplete random walk after 10000 steps, including 771 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 126) seen :71
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 55) seen :1
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Running SMT prover for 52 properties.
[2023-03-12 08:56:43] [INFO ] Flow matrix only has 284 transitions (discarded 17 similar events)
// Phase 1: matrix 284 rows 153 cols
[2023-03-12 08:56:43] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-12 08:56:44] [INFO ] After 614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:52
[2023-03-12 08:56:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-12 08:56:44] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-12 08:56:45] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :52
[2023-03-12 08:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 08:56:46] [INFO ] After 617ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :52
[2023-03-12 08:56:46] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 10 ms to minimize.
[2023-03-12 08:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-12 08:56:47] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2023-03-12 08:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-12 08:56:47] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2023-03-12 08:56:47] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2023-03-12 08:56:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-03-12 08:56:47] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2023-03-12 08:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-12 08:56:47] [INFO ] After 2306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :52
Attempting to minimize the solution found.
Minimization took 710 ms.
[2023-03-12 08:56:48] [INFO ] After 4346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :52
Fused 52 Parikh solutions to 41 different solutions.
Parikh walk visited 2 properties in 352 ms.
Support contains 50 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 301/301 transitions.
Graph (complete) has 664 edges and 153 vertex of which 144 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 144 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 142 transition count 279
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 142 transition count 277
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 21 place count 139 transition count 277
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 63 place count 97 transition count 193
Iterating global reduction 2 with 42 rules applied. Total rules applied 105 place count 97 transition count 193
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 92 transition count 183
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 92 transition count 183
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 121 place count 92 transition count 177
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 133 place count 86 transition count 200
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 140 place count 86 transition count 193
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 86 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 85 transition count 192
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 85 transition count 192
Applied a total of 143 rules in 71 ms. Remains 85 /153 variables (removed 68) and now considering 192/301 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 85/153 places, 192/301 transitions.
Incomplete random walk after 1000000 steps, including 180504 resets, run finished after 27239 ms. (steps per millisecond=36 ) properties (out of 50) seen :12
Incomplete Best-First random walk after 100001 steps, including 2706 resets, run finished after 455 ms. (steps per millisecond=219 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2713 resets, run finished after 395 ms. (steps per millisecond=253 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2718 resets, run finished after 409 ms. (steps per millisecond=244 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2718 resets, run finished after 456 ms. (steps per millisecond=219 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2748 resets, run finished after 443 ms. (steps per millisecond=225 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 2698 resets, run finished after 459 ms. (steps per millisecond=217 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2724 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 2753 resets, run finished after 463 ms. (steps per millisecond=215 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2749 resets, run finished after 459 ms. (steps per millisecond=217 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2682 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2688 resets, run finished after 443 ms. (steps per millisecond=225 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2686 resets, run finished after 456 ms. (steps per millisecond=219 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2713 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2694 resets, run finished after 460 ms. (steps per millisecond=217 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2742 resets, run finished after 454 ms. (steps per millisecond=220 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2676 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2716 resets, run finished after 468 ms. (steps per millisecond=213 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2701 resets, run finished after 443 ms. (steps per millisecond=225 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2704 resets, run finished after 437 ms. (steps per millisecond=228 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2715 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 2690 resets, run finished after 462 ms. (steps per millisecond=216 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2732 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 2701 resets, run finished after 449 ms. (steps per millisecond=222 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2697 resets, run finished after 443 ms. (steps per millisecond=225 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2735 resets, run finished after 450 ms. (steps per millisecond=222 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2686 resets, run finished after 451 ms. (steps per millisecond=221 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2678 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2680 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 2721 resets, run finished after 453 ms. (steps per millisecond=220 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2708 resets, run finished after 449 ms. (steps per millisecond=222 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2733 resets, run finished after 461 ms. (steps per millisecond=216 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2710 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2726 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2729 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100000 steps, including 2711 resets, run finished after 394 ms. (steps per millisecond=253 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2740 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2708 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2701 resets, run finished after 458 ms. (steps per millisecond=218 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
[2023-03-12 08:57:33] [INFO ] Flow matrix only has 183 transitions (discarded 9 similar events)
// Phase 1: matrix 183 rows 85 cols
[2023-03-12 08:57:33] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-12 08:57:33] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-12 08:57:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 08:57:33] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-12 08:57:34] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2023-03-12 08:57:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 08:57:34] [INFO ] After 304ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :38
[2023-03-12 08:57:34] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-12 08:57:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-12 08:57:35] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-12 08:57:35] [INFO ] After 1769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Fused 38 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 38 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 192/192 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 85 transition count 189
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 82 transition count 188
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 14 place count 75 transition count 174
Iterating global reduction 2 with 7 rules applied. Total rules applied 21 place count 75 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 75 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 73 transition count 177
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 41 place count 73 transition count 177
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 55 place count 73 transition count 177
Applied a total of 55 rules in 31 ms. Remains 73 /85 variables (removed 12) and now considering 177/192 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 73/85 places, 177/192 transitions.
Incomplete random walk after 1000000 steps, including 63932 resets, run finished after 13771 ms. (steps per millisecond=72 ) properties (out of 38) seen :35
Incomplete Best-First random walk after 1000001 steps, including 11946 resets, run finished after 2140 ms. (steps per millisecond=467 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 11938 resets, run finished after 2161 ms. (steps per millisecond=462 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 11747 resets, run finished after 2163 ms. (steps per millisecond=462 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 08:57:55] [INFO ] Flow matrix only has 160 transitions (discarded 17 similar events)
// Phase 1: matrix 160 rows 73 cols
[2023-03-12 08:57:55] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-12 08:57:55] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:57:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:57:55] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-12 08:57:55] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:57:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 08:57:55] [INFO ] After 24ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:57:55] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-12 08:57:55] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 177/177 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 49 transition count 129
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 49 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 45 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 45 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 42 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 42 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 39 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 39 transition count 106
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 86 place count 39 transition count 88
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 1 with 2 rules applied. Total rules applied 88 place count 38 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 35 transition count 99
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 35 transition count 98
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 35 transition count 98
Applied a total of 97 rules in 44 ms. Remains 35 /73 variables (removed 38) and now considering 98/177 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 35/73 places, 98/177 transitions.
Incomplete random walk after 1000000 steps, including 68689 resets, run finished after 10099 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14661 resets, run finished after 2336 ms. (steps per millisecond=428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14707 resets, run finished after 2403 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 14777 resets, run finished after 2373 ms. (steps per millisecond=421 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4456 steps, run visited all 3 properties in 40 ms. (steps per millisecond=111 )
Probabilistic random walk after 4456 steps, saw 1456 distinct states, run finished after 40 ms. (steps per millisecond=111 ) properties seen :3
Able to resolve query StableMarking after proving 128 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 90790 ms.
ITS solved all properties within timeout

BK_STOP 1678611494148

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="HealthRecord-PT-10"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is HealthRecord-PT-10, 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 r213-smll-167840356600193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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